An upper bound on minimum distance for a k-ary code
From MaRDI portal
Publication:5563193
DOI10.1016/S0019-9958(68)90779-1zbMath0174.50901OpenAlexW2027861675MaRDI QIDQ5563193
Ronald L. Graham, Aaron D. Wyner
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
Related Items
Upper bounds for constant weight and Lee codes slightly outside the Plotkin range, Bounds in the Lee metric and optimal codes, A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\), On maximum Lee distance codes, New upper bounds on Lee codes, NEW OPTIMAL LINEAR CODES OVER
