On covering radius of convolutional codes
Author
Summary, in English
We consider a problem of calculating covering capabilities for convolutional codes. An upper bound on covering radius for convolutional code is obtained by random coding arguments. The estimates on covering radius for some codes with small constraint length are presented.
Publishing year
1994
Language
English
Pages
56-62
Publication/Series
Algebraic Coding/Lecture Notes in Computer Science
Volume
781
Document type
Conference paper
Publisher
Springer
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
First French-Israeli Workshop
Conference date
1993-07-19 - 1993-07-21
Conference place
Paris, France
Status
Published
ISBN/ISSN/Other
- ISBN: 978-3-540-57843-7