On covering radius of convolutional codes
Författare
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.
Publiceringsår
1994
Språk
Engelska
Sidor
56-62
Publikation/Tidskrift/Serie
Algebraic Coding/Lecture Notes in Computer Science
Volym
781
Dokumenttyp
Konferensbidrag
Förlag
Springer
Ämne
- 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/Övrigt
- ISBN: 978-3-540-57843-7