Sufficient Condition over the Number of Parity Checks for Burst Error Detection/Correction in Linear Lee Weight Codes

DOI10.1142/S1005386707000338zbMath1120.94012OpenAlexW2062452447MaRDI QIDQ5297781

Sapna Jain, Kar Ping Shum

Publication date: 13 July 2007

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

Full work available at URL: http://www.worldscinet.com/ac/14/1402/S1005386707000338.html

zbMATH Keywords

linear codesminimum distanceLee weightburst errors

Mathematics Subject Classification ID

Bounds on codes (94B65) Burst-correcting codes (94B20)

Related Items (4)

Correction of CT burst array errors in the generalized-Lee-RT spaces ⋮ ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS ⋮ Array Codes in the Generalized Lee-RT Pseudo-Metric (GLRTP-Metric) ⋮ On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes

Cites Work

• Unnamed Item
• On some perfect codes with respect to Lee metric
• MODIFICATION TO A BOUND FOR RANDOM ERROR CORRECTION WITH LEE WEIGHT
• A note on bounds for burst correcting codes with Lee weight consideration
• Low-density-burst-correcting codes (Corresp.)

This page was built for publication: Sufficient Condition over the Number of Parity Checks for Burst Error Detection/Correction in Linear Lee Weight Codes