Structured LDPC codes for high-density recording: Large girth and low error floor

IEEE Transactions on Magnetics

Volumn 42, Issue 2, 2006, Pages 208-213

  Lu, J ^a   Moura, J M F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Girth; LDPC code

Indexed keywords

ALGORITHMS; DECODING; DISTANCE MEASUREMENT; ERROR ANALYSIS; ITERATIVE METHODS; SIGNAL TO NOISE RATIO;

COLUMN WEIGHT; GIRTH; LDPC CODE; PS-LDPC CODES;

MAGNETIC RECORDING;

EID: 31344476518     PISSN: 00189464     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMAG.2005.861748     Document Type: Article

References (11)

1. R. G. Gallager, Low-Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
3. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
4. Y. Kou, S. Lin, and M. P. C. 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.
5. B. Vasic, "Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording," Proc. IEEE Globecom 2001, vol. 5, pp. 2954-2960, Nov. 2001.
6. H. Tang, J. Xu, Y. Kou, S. Lin, and K. A. S. Abdel-Ghaffar, "On algebraic construction of Gallager and circulant low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1269-1279, Jun. 2004.
7. M. P. C. Fossorier, "Quasicyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
8. 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.
9. J. M. F. Moura, J. Lu, and H. Zhang, "Structured LDPC codes with large girth," IEEE Signal Process. Mag., vol. 21, no. 1, pp. 42-55, Jan. 2004.
10. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory, submitted for publication.
11. 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.