DocumentCode
3118834
Title
Heapmod algorithm for computing the minimum free distance of convolutional codes
Author
David, O. ; Lyandres, V.
fYear
2000
fDate
2000
Firstpage
435
Lastpage
438
Abstract
The minimum free distance of a convolutional code is the most important characteristic determining the code capability of detecting and correcting errors. A new algorithm for its computing is presented. A heap data structure and simple modulo calculations are used to implement the computations. The algorithm can be used by free hand for relatively short constraint length
Keywords
convolutional codes; error correction codes; error detection codes; tree data structures; convolutional codes; error correcting code; error detecting code; heap data structure; heapmod algorithm; minimum free distance; modular arithmetic calculations; modulo calculations; short constraint length; Binary trees; Computer errors; Convolutional codes; Data structures; Error correction codes; Hamming weight; Memory management; Polynomials; Shift registers; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and electronic engineers in israel, 2000. the 21st ieee convention of the
Conference_Location
Tel-Aviv
Print_ISBN
0-7803-5842-2
Type
conf
DOI
10.1109/EEEI.2000.924461
Filename
924461
Link To Document