SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approaching Blokh-Zyablov error exponent with linear-time encodable/decodable codes
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
From prime codes to "A new construction of frequency-hopping codes"
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 754.84 |
An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers are described by bipartite graphs with good expanding properties. In particular, a modified expander code construction is shown to behave very much like Forney's classical concatenated codes, though with improved decoding complexity. It is proved that these new codes achieve the Zyablov bound δZ on the minimum distance. For these codes, a soft-decision, reliability-based, linear-time decoding algorithm is introduced, that corrects any fraction of errors up to almost δZ/2. For the binary-symmetric channel, this algorithm's error exponent attains the Forney bound previously known only for classical (serial) concatenations.