Generalized unit-memory convolutional concatenated codes (Q1091349)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized unit-memory convolutional concatenated codes |
scientific article; zbMATH DE number 4010396
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized unit-memory convolutional concatenated codes |
scientific article; zbMATH DE number 4010396 |
Statements
Generalized unit-memory convolutional concatenated codes (English)
0 references
1986
0 references
This paper discusses a generalized concatenated coding system using unit- memory convolutional codes (UMC-codes) as inner codes and Reed-Solomon codes as outer codes. The Viterbi-algorithm is modified in order to give a required tradeoff between errors and erasures in the output from the inner decoder. Bounds on the probability of errors and erasures as well as on the complexity are derived.
0 references
generalized concatenated codes
0 references
unit-memory convolutional codes
0 references
UMC- codes
0 references
Reed-Solomon codes
0 references
