LP decoding of codes with expansion parameter above 2/3

Authors:
Michael Viderman
Affiliations:
Computer Science Department, Technion - Israel Institute of Technology, Haifa 32000, Israel
Venue:
Information Processing Letters
Year:
2013

Citing 10
Cited 0

List decoding: algorithms and applications

ACM SIGACT News
Message passing algorithms and improved LP decoding

Proceedings of the forty-first annual ACM symposium on Theory of computing
Iterative approximate linear programming decoding of LDPC codes with linear complexity

IEEE Transactions on Information Theory
Linear time decoding of regular expander codes

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Expander codes

IEEE Transactions on Information Theory - Part 1
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
A recursive approach to low complexity codes

IEEE Transactions on Information Theory
Using linear programming to Decode Binary linear codes

IEEE Transactions on Information Theory
LP Decoding Corrects a Constant Fraction of Errors

IEEE Transactions on Information Theory
LP Decoding of Regular LDPC Codes in Memoryless Channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

A code C@?F"2^n is a (c,@d,@e)-expander code if it has a Tanner graph, where every variable node has degree c, and every subset of variable nodes L"0 such that |L"0|=23+13c. In this paper, we provide a slight consolidation of their work and show that this result holds for every expansion parameter @e23.