DocumentCode :
921647
Title :
A decoding algorithm for binary block codes and 
-ary output channels (Corresp.)
-ary output channels (Corresp.)Author :
Dorsch, Bernhard G.
Volume :
20
Issue :
3
fYear :
1974
fDate :
5/1/1974 12:00:00 AM
Firstpage :
391
Lastpage :
394
Abstract :
A search algorithm is described to decode long binary block codes of any rate for the memoryless binary input -ary output channel. It can be used directly to perform maximum-likelihood decoding or in a constrained version that gives considerably fewer searches at a small sacrifice in performance. Simulation results are given for a rate-l/2 code of length 128 and minimum Hamming distance 22 on the quantized Gaussian channel.
-ary output channel. It can be used directly to perform maximum-likelihood decoding or in a constrained version that gives considerably fewer searches at a small sacrifice in performance. Simulation results are given for a rate-l/2 code of length 128 and minimum Hamming distance 22 on the quantized Gaussian channel.Keywords :
Block codes; Decoding; Block codes; Computational complexity; Computer simulation; Gaussian channels; Hamming distance; Hardware; Maximum likelihood decoding; Quantization; Random variables; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1974.1055217
Filename :
1055217
Link To Document :
