On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes

DOI10.1142/S100538671100037XzbMath1260.94078OpenAlexW2094321992MaRDI QIDQ3088412

Sapna Jain

Publication date: 19 August 2011

Published in: Algebra Colloquium (Search for Journal in Brave)

Full work available at URL: http://worldscinet.com/ac/18/1803/S100538671100037X.html

zbMATH Keywords

linear codesEuclidean weightEuclidean square distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Unnamed Item
• Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration
• On some perfect codes with respect to Lee metric
• MODIFICATION TO A BOUND FOR RANDOM ERROR CORRECTION WITH LEE WEIGHT
• Quaternary quadratic residue codes and unimodular lattices
• Sufficient Condition over the Number of Parity Checks for Burst Error Detection/Correction in Linear Lee Weight Codes

This page was built for publication: On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes