A compact construction for LDPC codes using permutation polynomials

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 79-82

  Takeshita, Oscar Y ^a  

^a The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR PERFORMANCE; FINITE INTEGER RINGS; PERMUTATION POLYNOMIALS;

ALGORITHMS; ERROR ANALYSIS; HAMMING DISTANCE; INTEGER PROGRAMMING; POLYNOMIALS; QUADRATIC PROGRAMMING;

CHANNEL CODING;

EID: 39049093782     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261678     Document Type: Conference Paper

References (23)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
3. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
4. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
5. S. Chung, G. D. Forney, Jr., T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Letters, vol. 5, no. 2, pp. 58-60, Feb. 2001.
6. G. A. Margulis, "Explicit constructions of graphs without short cycles and low-density codes," Combinatorica, vol. 2, no. 1, pp. 71-78, 1982.
7. J. Rosenthal and P. Vontobel, "Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. 38th Annual Allerton Conference on Communication, Control, and Computing, Oct. 2000, pp. 248-257.
8. 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, pp. 2711-2736, Nov. 2001.
9. M. Fossorier, "Quasicyclic low density parity check codes," in Proc. 2003 IEEE International Symposium on Information Theory, Yokohama, Japan, June 2003, p. 150.
10. R. Smarandache and P. O. Vontobel, "On regular quasi-cyclic LDPC codes from binomials," in Proc. 2004 IEEE International Symposium on Information Theory, June 2004, p. 274.
11. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Progressive edge-growth Tanner graphs," in Proc. IEEE Globecom Conf., Nov. 2001, pp. 995-1001.
12. J. Sun and O. Y. Takeshita, "Interleaves for turbo codes using permutation polynomials over integer rings," IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 101-119, Jan. 2005.
13. O. Y. Takeshita, "Permutation polynomial interleavers: an algebraic-geometric perspective," IEEE Trans. Inform. Theory, Jan. 2006, submitted for publication. [Online], Available: http://arxiv.org/abs/cs. IT/0601048/
14. J. Ryu and O. Y. Takeshita, "On quadratic inverses for quadratic permutation polynomials over integer rings," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1254-1260, Mar. 2006.
15. O. Y. Takeshita, "On maximum contention-free interleavers and permutation polynomials over integer rings," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1249-1253, Mar. 2006.
16. A. Prabhakar and K. R. Narayanan, "Pseudorandom construction of low-density parity-check codes using linear congruential sequences," IEEE Trans. Commun., vol. 50, no. 9, pp. 1389-1396, Sept. 2002.
17. J. Sun and O. Y. Takeshita, "On maximum length linear congruential sequence-based low-density parity-check codes," IEEE Trans. Commun., vol. 53, no. 12, pp. 1977-1980, Dec. 2005.
18. O. Y. Takeshita, "A new construction for LDPC codes using permutation polynomials over integer rings," IEEE Trans. Inform. Theory, submitted for publication. [Online]. Available: http://arxiv.org/ abs/cs.IT/0506091/
19. O. Y. Takeshita and D. J. Costello, Jr., "On deterministic linear interleavers for turbo-codes," in Proc. 35th Annual Allerton Conference on Communication, Control, and Computing, Sept. 1997, pp. 711-712.
20. _, "New deterministic interleaver designs for turbo codes," IEEE Trans. Inform. Theory, vol. 46, no. 6, pp. 1988-2006, Sept. 2000.
21. X.-Y. Hu, M. P. C. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density parity-check codes," in Proc. IEEE International Conference on Communications, June 2004, pp. 767-771.
22. D. J. C. MacKay. (2006) Encyclopedia of sparse graph codes. [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/
23. M. P. C. Fossorier, "Quasicyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inform. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.