Quasi-cyclic codes from extended difference families

IEEE Wireless Communications and Networking Conference, WCNC

Volumn 2, Issue , 2005, Pages 1036-1040

  Xia, Tao ^a   Xia, Bo ^b  

^a UNIVERSITY OF ARIZONA   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE SIZE; LOW-COMPLEXICITY SHIFT REGISTER ENCODING; QUASI-CYSLIC CODES;

ALGEBRA; CODES (SYMBOLS); CONSTRAINT THEORY;

SIGNAL ENCODING;

EID: 24944432810     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCNC.2005.1424651     Document Type: Conference Paper

References (16)

1. R. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
2. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, no. 5, pp. 533-547, Sept. 1981.
3. D. MacKay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
4. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
5. R. Lucas, M. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of onestep majority-logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, June 2000.
6. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
7. B. Ammar, B. Honary, Y. Kou, and S. Lin, "Construction of low density parity check codes: a combinatoric design approach," in Proc. IEEE Int. Symp. Inform. Theory, 2002.
8. B. Vasic, "Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording," in Proc. IEEE GlobeCom, San Antonio, TX, Nov. 2001.
9. S. Johnson and S. Weller, "Construction of low-density parity-check codes from Kirkman triple systems," in Proc. IEEE GlobeCom, San Antonio, TX, Nov. 2001.
10. _, "Quasi-cyclic LDPC codes from difference families," in 3rd AusCTW, Canberra, Australia, Feb. 2002.
11. J. Fan, "Array codes as low-density parity-check codes," in Proc. Int. Symp. Turbo Code and Related Topics, Brest, France, Sept. 2000.
12. M. Buratti, "Constructions of (q, k, 1) difference families with q a prime power and k = 4, 5," Discrete Mathematics, vol. 138, pp. 169-175, 1995.
13. D. K. Ray-Chaudhuri and R. M. Wilson, "Solution of Kirkman's schoolgirl problem," in Proc. Symp. Pure Math., AMS, Providence, RI, 1971, pp. 187-203.
14. D. MacKay and M. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Proc. IMA Workshop on Codes, Systems and Graphical Models, 1999.
15. M. Tanner, "Transforming quasi-cyclic codes with sparse graphs," unpublished.
16. B. Xia and W. Ryan, "On importance sampling for low-density paritycheck codes," IEEE Trans. Commun., submitted for publication.