Linear programming bounds for tree codes (Corresp.)
- 1 January 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 25 (1) , 85-90
- https://doi.org/10.1109/tit.1979.1056004
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
This publication has 4 references indexed in Scilit:
- On perfect codes in the hamming schemes H(n, q) with q arbitraryJournal of Combinatorial Theory, Series A, 1977
- An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.)IEEE Transactions on Information Theory, 1977
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963