Name
Abstract | ||
|---|---|---|
Time-invariant low-density parity-check convolutional codes (LDPC-CCs) derived from corresponding quasi-cyclic (QC) LDPC block codes (LDPC-BCs) can be described by a polynomial syndrome former matrix (polynomial-domain transposed parity-check matrix). In this paper, an estimation of the distance spectrum of time-invariant LDPC-CCs is obtained by splitting the polynomial syndrome former matrix into submatrices representing "super codes" and then evaluating the linear dependence between codewords of the corresponding super codes. This estimation results in an upper bound on the minimum free distance of the original code and, additionally, a lower bound on the number of codewords A(w) with Hamming weight w. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISIT.2012.6284234 | 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) |
Keywords | Field | DocType |
polynomials,hamming weight,vectors,convolutional codes,block codes | Hamming code,Discrete mathematics,Combinatorics,Concatenated error correction code,Convolutional code,Computer science,Low-density parity-check code,Block code,Serial concatenated convolutional codes,Turbo code,Linear code | Conference |
Citations | PageRank | References |
4 | 0.45 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hua Zhou | 1 | 4 | 0.45 |
| David G. M. Mitchell | 2 | 147 | 20.94 |
| Norbert Goertz | 3 | 316 | 28.94 |
| Daniel J. Costello Jr. | 4 | 375 | 39.29 |