IEEE Transactions on Communications

New constructions of quasi-cyclic LDPC codes based on special classes of BIBD's for the AWGN and binary erasure channels

Lan Lan, Ying Yu Tai, Shu Lin, Behshad Memari, B. Honary

Published Jan 1, 2008• 71 citations

Abstract

This paper presents new methods for constructing efficiently encodable quasi-cyclic LDPC codes based on special balanced incomplete block designs (BIBD's). Codes constructed perform well over both the AWGN and binary erasure channels with iterative decoding.

DOI: 10.1109/tcomm.2008.050483

Related papers

New Constructions of Quasi-Cyclic LDPC Codes Based on Special Classes of BIBDs for the AWGN and Binary Erasure Channels

Lan Lan, Ying Yu Tai, Shu Lin +2 more

This paper presents new methods for efficiently constructing encodable quasi-cyclic low-density parity-check (LDPC) codes based on special balanced incomplete block designs (BIBDs). Codes constructed perform well over both the additive white Gaussian noise (AWGN) and binary erasure channels with iterative decoding.

IEEE Transactions on CommunicationsDec 1, 200710 citations

Balanced Incomplete Block Designs, Partial Geometries, and Their Associated QC-LDPC Codes

Juane Li, Yi Gong, Shu Lin +1 more

This paper presents two classes of partial geometries (PaGs) derived from balanced incomplete block designs (BIBDs) of a special type. Based on these two classes of partial geometries, quasi-cyclic (QC) LDPC codes can be constructed. These codes not only perform well over AWGN channels (AWGNCs) but also can correct bursts of erasures over binary erasure channels (BECs) effectively.

International Symposium on Turbo Codes and Iterative Information ProcessingAug 30, 20215 citations

New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels

Lan Lan, Ying Yu Tai, Shu Lin +2 more

Lecture notes in computer scienceJan 1, 20060 citations

Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings

Longwen Lan, Lingqi Zeng, Y.Y. Tai +2 more

This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block error performance and error-floor, collectively. The constructions are based on the cyclic subgroups of the multiplicative groups of finite fields and affine mappings

IEEE International Symposium on Information Theory (ISIT)Jan 1, 200518 citations

LDPC Code Based on Balanced Incomplete Block Design and Cycle Permutation Matrix

Yanhu Shan

A method to construct a flexible length or rate of quasi-cyclic Low Density Parity Check(LDPC) codes based on Balanced Incomplete Block Design(BIBD) and cycle permutation matrix is proposed.Based on actual demand,the corresponding template matrix is constructed by BIBD method.The template matrix is extended by the appropriate cycle permutation matrix.The quasi-cyclic LDPC codes constructed by the proposed method have a good structure and flexibility.This method improves the efficiency of construction good codes which meet the needs of a practical application.Simulations show that quasi-cyclic LDPC codes constructed by the proposed method perform well over AWGN channels with iterative decoding and have a lower error floor.

Jisuanji gongchengJan 1, 20120 citations

Construction of low density parity check codes: a combinatoric design approach

Bassem Ammar, B. Honary, Y. Kou +1 more

This paper presents a method for constructing low density parity check (LDPC) codes based on a special type of combinatoric designs, known as the balanced incomplete block designs (BIBDs). Several classes of BIBDs suitable for constructing LDPC codes are presented. Codes constructed based on these classes of BIBDs perform well with iterative decoding.

IEEE International Symposium on Information Theory (ISIT)Jun 25, 200324 citations