Heuristic decoding of convolutional codes
Kybernetika (1981)
- Volume: 17, Issue: 2, page 158-168
- ISSN: 0023-5954
Access Full Article
top
How to cite
topKolář, Josef. "Heuristic decoding of convolutional codes." Kybernetika 17.2 (1981): 158-168. <http://eudml.org/doc/27911>.
@article{Kolář1981,
author = {Kolář, Josef},
journal = {Kybernetika},
keywords = {path-searching; code graph; decoding algorithms},
language = {eng},
number = {2},
pages = {158-168},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Heuristic decoding of convolutional codes},
url = {http://eudml.org/doc/27911},
volume = {17},
year = {1981},
}
TY - JOUR
AU - Kolář, Josef
TI - Heuristic decoding of convolutional codes
JO - Kybernetika
PY - 1981
PB - Institute of Information Theory and Automation AS CR
VL - 17
IS - 2
SP - 158
EP - 168
LA - eng
KW - path-searching; code graph; decoding algorithms
UR - http://eudml.org/doc/27911
ER -
References
top- A. J. Viterbi, Error Bounds for convolutional codes and an asymptotically optimal decoding algorithm, IEEE Trans. on Inform. Theory IT-13 (1967), 260-269. (1967)
- J. Kolář, Heuristický přístup k dekódování konvolučních kódů, Habilitation thesis (in Czech), FEL ČVUT, Prague 1979. (1979)
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.