Regular LDPC codes from semipartial geometries

Acta Applicandae Mathematicae

Volumn 102, Issue 1, 2008, Pages 25-35

  Li, Xiuli ^a   Zhang, Chen ^b   Shen, Jun ^c  

^a QINGDAO UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

^c SHANGHAI UNIVERSITY OF ENGINEERING SCIENCE   (China)

Author keywords

Gallager codes; Iterative decoding; Low density parity check (LDPC) codes; Semipartial geometries

Indexed keywords

GEOMETRY; ITERATIVE DECODING;

GALLAGER CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; SEMIPARTIAL GEOMETRIES;

CODES (SYMBOLS);

EID: 42149109206     PISSN: 01678019     EISSN: 15729036     Source Type: Journal    
DOI: 10.1007/s10440-007-9186-y     Document Type: Article

References (26)

1. Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory IT-8, 21-28 (1962)
2. MacKay, D.J.C., Davey, M.C.: Evaluation of Gallager codes for short block length and high rate applications. In: Marcus, B., Rosenthal, J. (eds.) Codes, Systems and Graphical Models. IMA Volumes in Mathematics and Its Applications, vol. 123, pp. 113-130. Springer, New York (2000)
3. Lucas, R., Fossorier, M.P.C., Kou, Y., Lin, S.: Iterative decoding of one-step majority logic decodable codes based on belief propagation. IEEE Trans. Commun. 48, 931-937 (2000)
4. Kou, Y., Lin, S., Fossorier, M.P.C.: Low-density parity-check codes based on finite geometries: A rediscovery and new results. IEEE Trans. Inf. Theory 47, 2711-2736 (2001)
5. Johnson, S.J., Weller, S.R.: Regular low-density parity-check codes from combinatorial designs. In: Proc. IEEE Information Theory Workshop (1TW2002), pp. 90-92. Cairns, Sept 2001
6. Johnson, S.J., Weller, S.R.: Resolvable 2-designs for regular low-density parity-check codes. IEEE Trans. Commun. 51, 1413-1419 (2003)
7. Weller, S.R., Johnson, S.J.: Regular low-density parity-check codes from oval designs. Eur. Trans. Telecommun. 14(5), 399-409 (2003)
8. Vontobel, P.O., Tanner, R.M.: Construction of codes based on finite generalized quadrangles for iterative decoding. In: Proc. Int. Symp. Information Theory (ISIT'200J), p. 223. Washington, 24-29 June 2001
9. Johnson, S.J., Weller, S.R.: Codes for iterative decoding from partial geometries. IEEE Trans. Commun. 52, 236-243 (2004)
10. van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge Univ. Press, Cambridge (1992)
11. Bose, R.C.: Strongly regular graphs, partial geometries and partial designs. Pac. J. Math. 13, 389-419 (1963)
12. Debroey, I., Thas, J.A.: On semipartial geometries. J. Comb. Theory Ser. A 25, 242-250 (1978)
13. Tanner, R.M.: Minimum-distance bounds by graph analysis. IEEE Trans. Inf. Theory 47, 808-821 (2001)
14. Cameron, P.J., van Lint, J.H.: Graphs, Codes and Designs. London Math. Soc. Lecture Note Series, vol. 43. Cambridge Univ. Press, Cambridge (1980)
15. Buekenhout, F.: Handbook of Incidence Geometry. North-Holland, Amsterdam (1995)
16. Brouwer, A.E., van Eijl, C.A.: On the p-rank of strongly regular graphs. Algebra and Combinatorics 1, 72-82 (1992)
17. Anderson, I.: Combinatorial Designs: Construction Methods, Mathematics and Its Applications. Ellis Horwood, Chichester (1990)
18. Assmus, E.F. Jr., Key, J.D.: Designs and Their Codes. Cambridge Tracts in Math., vol. 103. Cambridge Univ. Press, Cambridge (1993)
19. Key, J.D.: Some applications of Magma in designs and codes: Oval designs, Hermitian unitals and generalized Reed-Muller codes. J. Symb. Comput. 31, 37-53 (2001)
20. Thas, J.A.: Semipartial geometries and spreads of classical polar spaces. J. Comb. Theory Ser. A 35, 58-66 (1983)
21. Tits, J.: Ovoïdes et groupes de Suzuki. Arch. Math. 13, 187-198 (1962)
22. Coxeter, H.S.M.: Twelve points in PG(5,3) with 95040 self transformations. Proc. R. Soc. Lond. Ser. A 247, 279-293 (1958)
23. 4 calotta completa. Atti Semin. Mat. Fis. Univ. Modena 23, 103-117 (1975)
24. 5,3. Atti. Accad. Naz. Lincei Rend. 54, 378-384 (1973)
25. Hill, R.: Caps and groups. In: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo II. Atti dei Convegni Lincei, vol. 17, pp. 389-394. Accad. Naz. Lincei, Rome (1976)
26. MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45, 399-431 (1999)