@inproceedings{a5d3719b6cc64448bd32300864798b29,
title = "Heapmod algorithm for computing the minimum free distance of convolutional codes",
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 in this letter. 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.",
author = "O. David and V. Lyandres",
note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; 21st IEEE Convention of the Electrical and Electronic Engineers in Israel, IEEEI 2000 ; Conference date: 11-04-2000 Through 12-04-2000",
year = "2000",
month = jan,
day = "1",
doi = "10.1109/EEEI.2000.924461",
language = "English",
series = "21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "435--438",
booktitle = "21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings",
address = "United States",
}