Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
New coding and decoding schemes based on concatenated codes are proposed. The new coding schemes are potentially superior to Forney's original concatenation scheme in the sense that for discrete memoryless channels the former has a smaller upper bound on the probability of decoding error for th...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 1980-09, Vol.26 (5), p.527-534 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | New coding and decoding schemes based on concatenated codes are proposed. The new coding schemes are potentially superior to Forney's original concatenation scheme in the sense that for discrete memoryless channels the former has a smaller upper bound on the probability of decoding error for the same order of decoding complexity. |
|---|---|
| ISSN: | 0018-9448 1557-9654 |
| DOI: | 10.1109/TIT.1980.1056243 |