On expander codes based on hypergraphs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 88-

  Schmidt, Georg ^a   Zyablov, Victor V ^b   Bossert, Martin ^a  

^a UNIVERSITY OF ULM   (Germany)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; DECODING; GAUSSIAN NOISE (ELECTRONIC); GRAPH THEORY; MATRIX ALGEBRA; PHASE SHIFT KEYING; WHITE NOISE;

BINARY PHASE SHIFT KEYING; EXPANDER CODES; HYPERGRAPHS; KRONECKER PRODUCT; LOW DENSITY PARITY CHECK CODES;

BINARY CODES;

EID: 0141904728     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228102     Document Type: Conference Paper

References (6)

1. M. Sipser and D. A. Spielman, "Expander Codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
2. R. G. Gallager, "Low-Density Parity-Check Codes," M.I.T. Press, Cambridge, 1963
3. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sep. 1981.
4. M. Lentmaier and K. Zigangirov, "On Generalized Low-Density Parity-Check Codes Based on Hamming Component Codes," IEEE Comm. Letters, vol. 3, no. 8, pp. 248-250, Aug. 1999.
5. G. A. Margulis, "Explicit constructions of concentrators," Prob. Peredachi Informatsii, vol. 9, no. 4, pp. 71-80, Oct.-Dec. 1973.
6. A. Lubotzky, R. Philips and P. Sarnak, "Ramanujan Graphs," Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.