Title: Linear programming bounds for tree codes (Corresp.)
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.
Publication Year: 1979
Publication Date: 1979-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 31
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot