Upper bounds for constant weight and Lee codes slightly outside the Plotkin range

DOI10.1016/0166-218X(87)90063-1zbMath0631.94013MaRDI QIDQ1095110

Hannu Tarnanen

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

constant weight codessymmetric association schemeMcEliece boundn-class coloring structureTietäväinen bound

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (2)

New upper bounds on Lee codes ⋮ Fundamentals of coding type problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On t-distance sets of (0,+-1)-vectors
• On the nonbinary Johnson scheme
• THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
• Bounds for binary codes just outside the plotkin range
• A low-rate improvement on the Elias bound (Corresp.)
• Upper bounds on the cardinality of a binary code with a given minimum distance
• An upper bound on minimum distance for a k-ary code
• Sphere-packing in the Hamming metric

This page was built for publication: Upper bounds for constant weight and Lee codes slightly outside the Plotkin range