Linear programming bounds for tree codes (Corresp.)

DOI10.1109/TIT.1979.1056004zbMATH Open0391.94020MaRDI QIDQ4173296FDOQ4173296

Authors: Matti J. Aaltonen 

Publication date: 1979

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

Asymptotic Upper BoundsDelsarte's Theory of Association SchemesLinear Programming BoundsTree Codes

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cited In (4)

• A new upper bound on nonbinary block codes
• On the lower bound for the length of minimal codes
• On character sums and codes
• Covering radius and dual distance

This page was built for publication: Linear programming bounds for tree codes (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173296)