Title :
An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.)
Author :
Aaltonen, Matti J.
fDate :
5/1/1977 12:00:00 AM
Abstract :
An asymptotic Hamming bound for tree codes is derived. This bound is not new, it has been obtained earlier by Pinsker. However, Markov chains were used by Pinsker in its proof whereas more direct methods are used here.
Keywords :
Decoding; Tree codes; Block codes; Decoding; Error correction codes; Error probability; Feedback; Galois fields; Hamming distance; Hamming weight; Information rates; Linear matrix inequalities;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1977.1055724
