Linear programming bounds for tree codes (Corresp.)

DOI10.1109/TIT.1979.1056004zbMath0391.94020MaRDI QIDQ4173296

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)

Related Items (4)

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

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