scientific article; zbMATH DE number 5299829

MaRDI QIDQ3511802zbMATH OpenFDO

Authors Sapna Jain, Ki-Bong Nam

Publication date 11 July 2008

zbMATH Keywords

Lee weightlinear codesminimum distancerandom errors

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• Extended Varshamov-Gilbert-Sacks bound for linear Lee weight codes
• Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
• Linear codes with complementary duals meet the Gilbert-Varshamov bound
• Gilbert-Varshamov type bounds for linear codes over finite chain rings
• Delsarte's Linear Programming Bound for Constant-Weight Codes
• On linear codes which attain the Solomon-Stiffler bound
• Semidefinite programming bounds for Lee codes
• A Bound for the Maximum Weight of a Linear Code
• Weight distributions of linear codes and the Gleason-Pierce theorem
• Improving the Gilbert-Varshamov bound for q-ary codes

Cited in

(4)

• Extended Varshamov-Gilbert-Sacks bound for linear Lee weight codes
• On some properties of Lee metric codes.
• On linear codes which attain the Solomon-Stiffler bound
• Gilbert-Varshamov type bounds for linear codes over finite chain rings

This page was built for publication:

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