Decoding of block codes obtained from convolution codes (Q751626)
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: Decoding of block codes obtained from convolution codes |
scientific article; zbMATH DE number 4176978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decoding of block codes obtained from convolution codes |
scientific article; zbMATH DE number 4176978 |
Statements
Decoding of block codes obtained from convolution codes (English)
0 references
1990
0 references
The paper presents a decoding algorithm for block codes which are obtained from convolutional codes by tail biting [cf. \textit{H. H. Ma} and \textit{J. K. Wolf}, IEEE Trans. Commun. COM-34, No.2, 104-111 (1986; Zbl 0586.94020)]. It is shown that for the presented decoding method there are block codes achieving the same asymptotic decoding error versus decoding complexity ratio as convolutional codes with Viterbi decoding.
0 references
decoding algorithm for block codes
0 references
convolutional codes
0 references
tail biting
0 references
asymptotic decoding error
0 references
decoding complexity
0 references
Viterbi decoding
0 references
0.9083600044250488
0 references
0.8284863233566284
0 references
0.8020673990249634
0 references
