Name
Abstract | ||
|---|---|---|
This letter presents a new technique to construct high-rate convolutional codes using a structure formed by a high-rate block code and a simpler convolutional code. The goal is to obtain good convolutional codes in terms of free distance and number of nearest neighbors, with better performance than punctured codes. The obtained codes improve over the best known high-rate punctured codes with the same rate and memory in terms of both bit error probability and computational decoding complexity. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/4234.966031 | IEEE Communications Letters |
Keywords | Field | DocType |
Convolutional codes,Maximum likelihood decoding,Block codes,Nearest neighbor searches,Error probability,Viterbi algorithm,Optical recording,Optical fibers,Microelectronics,Concatenated codes | Concatenated error correction code,Convolutional code,Sequential decoding,Computer science,Block code,Serial concatenated convolutional codes,Turbo code,Algorithm,Linear code,Quantum convolutional code | Journal |
Volume | Issue | ISSN |
5 | 11 | 1089-7798 |
Citations | PageRank | References |
7 | 0.71 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amat Alexandre Graell i | 1 | 456 | 65.56 |
| Guido Montorsi | 2 | 1032 | 179.05 |
| S. Benedetto | 3 | 883 | 167.24 |