An upper bound on minimum distance for a k-ary code

DOI10.1016/S0019-9958(68)90779-1MaRDI QIDQ5563193zbMATH OpenOpenAlexFDO

Authors Aaron D. Wyner, Ron Graham

Publication date 1968

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(68)90779-1

zbMATH Keywords

information, communications

Cited in

(8)

• Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
• On maximum Lee distance codes
• New upper bounds on Lee codes
• Bounds in the Lee metric and optimal codes
• A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\)
• NEW OPTIMAL LINEAR CODES OVER
• Constructing optimal few weight quaternary linear codes via multivariable functions
• Better bounds on the minimum Lee distance

This page was built for publication: An upper bound on minimum distance for a k-ary code

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