Linear programming bounds for tree codes (Corresp.)
From MaRDI portal
Publication:4173296
DOI10.1109/TIT.1979.1056004zbMath0391.94020MaRDI QIDQ4173296
Publication date: 1979
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Asymptotic Upper Bounds; Delsarte's Theory of Association Schemes; Linear Programming Bounds; Tree Codes
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
Covering radius and dual distance, A new upper bound on nonbinary block codes, On character sums and codes