DocumentCode
2057172
Title
How to efficiently find the minimum distance of tailbiting codes
Author
Bocharova, Irina E. ; Kudryashov, Boris D. ; Handlery, Marc ; Johannesson, Rolf
Author_Institution
Univ. of Aerosp. Instrum., St. Petersburg, Russia
fYear
2002
fDate
2002
Firstpage
259
Abstract
A bidirectional algorithm for computing spectral coefficients of convolutional and tailbiting codes is presented and used to obtain new codes.
Keywords
convolutional codes; tree codes; bidirectional algorithm; code tree; convolutional codes; minimum distance; spectral coefficients; tail-biting codes; Aerospace electronics; Convolutional codes; Councils; Hamming weight;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023531
Filename
1023531
Link To Document