DocumentCode
925792
Title
An optimum symbol-by-symbol decoding rule for linear codes
Author
Hartmann, Carlos R P ; Rudolph, Luther D.
Volume
22
Issue
5
fYear
1976
fDate
9/1/1976 12:00:00 AM
Firstpage
514
Lastpage
517
Abstract
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memory]ess channel for any linear error-correcting code when the codewords are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
Keywords
Decoding; Error-correcting codes; Linear codes; Block codes; Convolutional codes; Decoding; Error correction codes; Gaussian channels; Information science; Information theory; Linear code; Memoryless systems; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1976.1055617
Filename
1055617
Link To Document