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

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.