Title :
On variable-length error-correcting codes
Author :
Buttigieg, Victor ; Farrell, Patrick G.
Author_Institution :
Dept. of Electr. Eng., Manchester Univ., UK
fDate :
27 Jun-1 Jul 1994
Abstract :
A different viewpoint on variable-length error correcting (VLEC) codes is presented, as compared to that found in the literature. Consequently, a maximum likelihood decoding algorithm for binary VLEC codes over the binary symmetric channel (BSC) is derived. It is shown that this algorithm achieves significant coding gain over the α-prompt decoding introduced by Hartnett et. Al. (1990), at the expense of increased complexity
Keywords :
binary sequences; error correction codes; maximum likelihood decoding; telecommunication channels; variable length codes; α-prompt decoding; binary VLEC codes; binary symmetric channel; coding gain; complexity; maximum likelihood decoding algorithm; variable-length error-correcting codes; Binary codes; Error correction codes; Hamming distance; Maximum likelihood decoding; Viterbi algorithm;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.395122
