scientific article

zbMATH Open1215.94088MaRDI QIDQ3511802

Ki-Bong Nam, Sapna Jain

Publication date: 11 July 2008

Title of this publication is not available (Why is that?)

zbMATH Keywords

linear codesminimum distanceLee weightrandom errors

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (1)

On linear codes which attain the Solomon-Stiffler bound

Recommendations

• Title not available (Why is that?) 👍 👎
• On linear codes which attain the Solomon-Stiffler bound 👍 👎
• Gilbert-Varshamov type bounds for linear codes over finite chain rings 👍 👎
• Weight distributions of linear codes and the Gleason-Pierce theorem 👍 👎
• Linear codes with complementary duals meet the Gilbert-Varshamov bound 👍 👎
• Semidefinite programming bounds for Lee codes 👍 👎
• Extended Varshamov-Gilbert-Sacks bound for linear Lee weight codes 👍 👎
• Delsarte's Linear Programming Bound for Constant-Weight Codes 👍 👎
• Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes 👍 👎
• A Bound for the Maximum Weight of a Linear Code 👍 👎

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)