Minimum-distance bounds by graph analysis

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 808-821

  Tanner, R M ^a  

^a University of California Santa Cruz   (United States)

Author keywords

Code graph; Eigenvalues; Error correcting codes; Linear programming; Minimum distance bound

Indexed keywords

CODING ERRORS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; ERROR CORRECTION; GRAPH THEORY; LINEAR PROGRAMMING;

CODE GRAPHS; ERROR CORRECTING CODES; MINIMUM DISTANCE BOUND;

ENCODING (SYMBOLS);

EID: 0035246312     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910591     Document Type: Article

References (10)

1. Four fundamental parameters of a code and their combinatorial significance
2. Coding theorems for 'Turbo-like codes'
3. Good error correcting codes based on very sparse matrices
4. Design of provably good low-density parity-check codes
5. The capacity of low-density parity-check codes under message-passing decoding
6. Expander codes
7. Linear-time encodeable and decodable error-correcting codes