A class of generalized LDPC codes with fast parallel decoding algorithms
IEEE Communications Letters
On LP decoding of nonbinary expander codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Woven graph codes: asymptotic performances and examples
IEEE Transactions on Information Theory
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding
IEEE Transactions on Information Theory
Linear time decoding of regular expander codes
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
Problems of Information Transmission
Linear-time decoding of regular expander codes
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 755.08 |
The minimum distance of some families of expander codes is studied, as well as some related families of codes defined on bipartite graphs. The weight spectrum and the minimum distance of a random ensemble of such codes are computed and it is shown that it sometimes meets the Gilbert-Varshamov (GV) bound. A lower bound on the minimum distances of constructive families of expander codes is derived. The relative minimum distance of the expander code is shown to exceed the product bound, i.e., the quantity δ0δ1 where δ0 and δ1 are the minimum relative distances of the constituent codes. As a consequence of this, a polynomially constructible family of expander codes is obtained whose relative distance exceeds the Zyablov bound on the distance of serial concatenations.