Title :
Linear programming bounds for tree codes (Corresp.)
Author :
Aaltonen, Matti J.
fDate :
1/1/1979 12:00:00 AM
Abstract :
Two asymptotic upper bounds on the information rate of a tree code as a function of its feedback decoding minimum distance are presented. These bounds are generalizations of the linear programming bounds for binary block codes proved by McEliece et al., and they are derived from linear programming problems based on Delsarte´s theory of association schemes.
Keywords :
Linear programming; Tree codes; Block codes; Error probability; Information rates; Linear programming; Memoryless systems; Notice of Violation; Source coding; Testing; Upper bound; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1979.1056004
