Asymptotic bit error probability for convolutional codes (Q1179615)
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: Asymptotic bit error probability for convolutional codes |
scientific article; zbMATH DE number 25025
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic bit error probability for convolutional codes |
scientific article; zbMATH DE number 25025 |
Statements
Asymptotic bit error probability for convolutional codes (English)
0 references
26 June 1992
0 references
This note presents a generalization of \textit{M. V. Burnashev's} and \textit{D. L. Kohn's} [Probl. Peredachi Inf. 26, No. 4, 3-15 (1990; Zbl 0719.94018)] result for rate \((2,1)\)-convolutional encoders to arbitrary \((n,k)\)-convolutional encoders. An exact formula for the symbol error probability is derived, and a table of codes with good asymptotic behaviour is given.
0 references
convolutional codes
0 references
symbol error probability
0 references
