On Tanner codes: Minimum distance and decoding

Applicable Algebra in Engineering, Communications and Computing

Volumn 13, Issue 5, 2003, Pages 335-347

  Janwa, H ^a   Lal, A K ^a  

^a UNIVERSITY OF PUERTO RICO   (Puerto Rico)

Author keywords

Decoding; Expander codes; Expander graphs; LDPC codes; Minimum distance; Multi partite graphs; N gons; Ramanujan graphs; Tanner codes

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DECODING; ERROR CORRECTION; GRAPH THEORY;

EXPANDER CODES; EXPANDER GRAPHS; LOW DENSITY PARITY CHECK CODES; MINIMUM DISTANCE; MULTIPARTITE GRAPH; RAMANUJAN GRAPHS; TANNER CODES;

CODES (SYMBOLS);

EID: 0037331718     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-003-0098-4     Document Type: Article

References (18)

1. Alon, N.: Eigenvalues and expanders. Combinatorica, 6, 83-96 (1986).
2. Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inform. Theory, 38(2), 509-516 (1992).
3. Alon, N., Chung, F.R.K.: Explicit construction of linear sized tolerant networks. Discrete Math., 72, 15-19 (1988).
4. Elias, P.: Error-free coding. IRE Trans. Inform. Theory, vol. PGIT-4, pp. 29-37, Sept. 1954.
5. Gallager, R.G.: Low Density Parity Check Codes, M.I.T. Press, 1963.
6. Janwa, H., Lal, A. K.: On Expander Graphs: Parameters and Applications. submitted to Siam J. of Disc. Math., February 02, 2001.
7. Janwa, H., Moreno, O.: Ramanujan Graphs, Codes, Exponential Sums, and Sequence, to be submitted to IEEE Trans. Inform. Theory
8. Kou, Y., Lin, S., Fossorier, M.P.C.: Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results. IEEE Trans. Inform. Theory, 47, 2711-2736 (2001).
9. Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica, 8(3), 261-277 (1988).
10. Mackay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory, 45, 399-431 (1999).
11. Margulis, G.A.: Explicit group theoretical constructions of combinatorial schemes and their application to design of expanders and concentrators. Probl. Inform. Transm., 24(1), 39-46 (1988)
12. Morgenstern, M.: Existence and explicit constructions of (q + 1)-regular Ramanujan graphs for every prime power q. J. Comb. Theory, Ser. B, 62, 44-62 (1994)
13. Sipser, M., Spielman, D.A.: Expander codes. IEEE Trans. Inform. Theory, 42(6), 1710-1722 (1996)
14. Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inform. Theory, 42(6), 1723-1731 (1996)
15. Tanner, R.M.: Explicit concentrators from generalized n-gons. SIAM J. Alg. Disc. Math., 5(3), 287-293 (1984).
16. Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inform. Theory, IT-27(5), 533-547 (1981)
17. Zémor, G.: On Expander Codes. IEEE Trans. Inform. Theory, IT-47(2), 835-837 (2001).
18. Zémor, G., Barg, A.: Error exponents of expander codes, to appear in IEEE Trans. Inform. Theory