An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.)

1 May 1977

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 23 (3) , 396-397
https://doi.org/10.1109/tit.1977.1055724

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
FEEDBACK
DISTANCE
MARKOV
HAMMING BOUND
EARLIER
CORRESP
ASYMPTOTIC HAMMING

This publication has 1 reference indexed in Scilit:

Error propagation and definite decoding of convolutional codes
IEEE Transactions on Information Theory, 1968