| 1. |
- Jimenez Feltström, Alberto, et al.
(författare)
-
Braided Block Codes
- 2009
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 55:6, s. 2640-2658
-
Tidskriftsartikel (refereegranskat)abstract
- A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.
|
|
| 2. |
- Lentmaier, Michael, et al.
(författare)
-
An analysis of the block error probability performance of iterative decoding
- 2005
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 51:11, s. 3834-3855
-
Tidskriftsartikel (refereegranskat)abstract
- Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes N and the number of iterations I go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability Pb, but also the block (frame) error probability PB, goes to zero as N and I go to infinity.
|
|
| 3. |
- Sridharan, Arvind, et al.
(författare)
-
Distance bounds for an ensemble of LDPC convolutional codes
- 2007
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448. ; 53:12, s. 4537-4555
-
Tidskriftsartikel (refereegranskat)abstract
- An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and existence-type lower bounds on the minimum distance dL, of code segments of finite length L and on the free distance dfree are derived. For sufficiently large constraint lengths v, the distances are shown to grow linearly with v and the ratio dL/v approaches the ratio dfee/v for large L. Moreover, the ratio of free distance to constraint length is several times larger than the ratio of minimum distance to block length for Gallager's ensemble of (J, K) -regular LDPC block codes.
|
|
| 4. |
|
|
