On the error exponent for woven convolutional codes with outer warps
Author
Summary, in English
In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity
Publishing year
1999
Language
English
Pages
1649-1653
Publication/Series
IEEE Transactions on Information Theory
Volume
45
Issue
5
Full text
- Available as PDF - 158 kB
- Download statistics
Document type
Journal article
Publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Status
Published
ISBN/ISSN/Other
- ISSN: 0018-9448