On maximum-length linear congruential-sequences-based low-density parity-check codes

IEEE Transactions on Communications

Volumn 53, Issue 12, 2005, Pages 1977-1980

  Sun, Jing ^a   Takeshita, Oscar Y ^b  

^a QUALCOMM INC   (United States)

^b The Ohio State University   (United States)

Author keywords

Error correction coding; Graph theory; Low density parity check (LDPC) codes; Permutation; Sequences

Indexed keywords

BIT ERROR RATE; ENCODING (SYMBOLS); ERROR CORRECTION; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION;

ERROR CORRECTION CODING; LOW DENSITY PARITY CHECK (LDPC) CODES; MAXIMAL-LENGTH LINEAR CONGRUENTIAL SEQUENCES (MLLCS); PERMUTATION;

CODES (SYMBOLS);

EID: 30344448584     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2005.860093     Document Type: Article

References (14)

1. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
2. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
3. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
4. D. J. C. MacKay, S. T. Wilson, and M. C. Davey, "Comparison of constructions of irregular Gallager codes," IEEE Trans. Commun., vol. 47, no. 10, pp. 1449-1454, Oct. 1999.
5. J. Campello, D. S. Modha, and S. Rajagopalan, "Designing LDPC codes using bit-filling," in Proc. Int. Conf. Commun., 2001, pp. 55-59.
6. Y. Kou, S. Lin, and M. P. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
7. J. L. Kim, U. N. Peled, I. Perepelitsa, and V. Pless, "Explicit construction of families of LDPC codes of girth at least six," in Proc. 40th Annu. Allerton Conf. Commun., Control, Comput., 2002, pp. 1024-1031.
8. K. Mellinger, "LDPC codes from triangle-free line sets," in Proc. 3rd Pythagorean Conf., Rhodes, Greece, 2003, pp. 341-350.
9. S. J. Johnson and S. R. Weller, "Construction of low-density parity-check codes from Kirkman triple systems," in Proc. GLOBECOM, Nov. 2001, pp. 970-974.
10. B. Vasic and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1156-1176, Jun. 2004.
11. A. Prabhakar and K. Narayanan, "Pseudo-random construction of low-density parity-check codes using linear congruential sequence," IEEE Trans. Commun., vol. 50, no. 9, pp. 1389-1396, Sep. 2002.
12. G. C. Clark, Jr. and J. B. Cain, Error-Correction Coding for Digital Communications. New York: Plenum, 1981.
13. B. Ammar, B. Honary, Y. Kou, J. Xu, and S. Lin, "Construction of low-density parity-check codes based on balanced incomplete block designs," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1257-1268, Jun. 2004.
14. D. J. C. MacKay and M. S. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Elsevier Sci. Electron. Notes Theoret. Comput. Sci., vol. 74, pp. 1-8, 2003.