LDPC absorbing sets, the null space of the cycle consistency matrix, and Tanner's constructions

2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings

Volumn , Issue , 2011, Pages 455-459

  Wang, Jiadong ^a   Dolecek, Lara ^a   Wesel, Richard ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ABSORBING SET; BINARY CYCLES; COLUMN RANKS; CONSISTENCY CONDITIONS; LDPC CODES; MATRIX; NULL SPACE; SUB-MATRICES; SUFFICIENT CONDITIONS;

CODES (SYMBOLS); CODING ERRORS;

ERROR CORRECTION;

EID: 79955759373     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2011.5743618     Document Type: Conference Paper

References (15)

1. R. G. Gallager. Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. T. Richardson, M. Shokrollahi, and R. Urbanke. Design of capacityapproaching irregular low-density parity-check codes. IEEE Trans. Inform. Theory, 47(2):616-637, Feb. 2001.
3. T. Richardson. Error-floors of LDPC codes. In Proc. 41st Annual Allerton Conf., Monticello, IL, Oct. 2003.
4. L. Dolecek, Z. Zhang, M. J. Wainwright, V. Anantharam, and B. Nikolic. Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes. IEEE Trans. Inform. Theory, 56(1), Jan. 2010.
5. J. L. Fan. Array-codes as low-density parity-check codes. In Proc. Of Second Int. Symp. on Turbo Codes, pages 543-546, Sept. 2000.
6. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello. LDPC block and convolutional codes based on circulant matrices. IEEE Trans. Inform. Theory, 50(15):2966-2984, Dec. 2004.
7. M. P. C. Fossorier. Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inform. Theory, 58(8):1788-1793, Aug. 2004.
8. S. Laendner, T. Hehn, O. Milenkovic, and J. Huber. When does one redundant parity-check equation matter? In Proc. IEEE Global Telecomm. Conf. (GLOBECOM), San Francisco, CA, Nov. 2006.
9. O. Milenkovic, N. Kashyap, and D. Leyba. Shortened array codes of large girth. IEEE Trans. Inform. Theory, 5(8):3707-3722, Aug. 2006. (Pubitemid 44145129)
10. D. V. Nguyen, B. Vasic, and M. Marcellin. Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets. In Proc. IEEE Info. Theory Workshop (ITW), Dublin, Ireland, Sept. 2010.
11. L. Dolecek, J. Wang, and Z. Zhang. Towards Improved LDPC Code Designs Using Absorbing Set Spectrum Properties. In Proc. of 6th International symposium on turbo codes and iterative information processing, Brest, France, Sept. 2010.
12. J. Wang, L. Dolecek, and R. Wesel. Controlling LDPC Absorbing Sets via the Null Space of the Cycle Consistency Matrix. In Proc. IEEE Int. Conf. on Comm. (ICC), Kyoto, Japan, June. 2011.
13. Z. Zhang, L. Dolecek, B. Nikolic, V. Anantharam, and M. J. Wainwright. Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices. IEEE Trans. Comm., pages 3258- 3268, Nov. 2009.
14. R. Diestel. Graph Theory. Springer, 2006.
15. M.M. Mansour and N.R. Shanbhag. High-throughput LDPC decoders. IEEE Trans. on VLSI Systems, 1(6):976-996, Dec. 2003.