A new formula for the minimum distance of an expander code
A new formula for the minimum distance of an expander code
Linear code, Minimum distance, Expander graph Adjacency matrix,
___
- [1] N. Alon, J. Bruck, J. Naor, M. Naor, R. Roth, Construction of asymptotically good low-rate errorcorrecting codes through pseudo-random graphs, IEEE Trans. Inf. Theory 38(2) (1992) 509–516.
- [2] M. R. Capalbo, O. Reingold, S. Vadhan, A. Wigderson, Randomness conductors and constant-degree lossless expanders, Proceedings of the ACM Symposium on Theory of Computing (2002) 659–668.
- [3] Sudipta Mallik, Bahattin Yildiz, Graph theoretic aspects of minimum distance and equivalence of binary linear codes, Australas. J. Combin. 79(3) (2021) 515–526.
- [4] Sudipta Mallik, Bahattin Yildiz, Isodual and self-dual codes from graphs, Algebra Discrete Math. 32(1) (2021) 49–64.
- [5] R. M. Roth, Introduction to coding theory, Cambridge University Press (2006).
- [6] M. Sipser, D. Spielman, Expander codes, IEEE Trans. Inf. Theory 42(6) (1996) 1710–1722.
- [7] M. Tanner, A recursive approach to low complexity codes, IEEE Trans. Inf. Theory 27(5) (1981) v533–547.
- [8] G. Zemor, On expander codes, IEEE Trans. Inf. Theory 47(2) (2001) 835-837.
- Başlangıç: 2015
- Yayıncı: İrfan ŞİAP
On the generation of alpha graphs
On the isomorphism of unitary subgroups of noncommutative group algebras
A note on $GDD(1, n, n , 4;\lambda_{1},\lambda_{2})$
Dinesh G. SARVATE, Dinkayehu M. WOLDEMARİAM
A new formula for the minimum distance of an expander code
The bicyclic semigroup as the quotient inverse semigroup by any gauge inverse submonoid