Array Codes in the Generalized Lee-RT Pseudo-Metric (GLRTP-Metric)

DOI10.1142/S1005386710000702zbMath1202.94215MaRDI QIDQ3057648

Sapna Jain

Publication date: 16 November 2010

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

Full work available at URL: http://www.worldscinet.com/ac/17/17spec01/S1005386710000702.html

zbMATH Keywords

array codesLee metricRT metric

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Correction of CT burst array errors in the generalized-Lee-RT spaces

Cites Work

• Unnamed Item
• Bursts in \(m\)-metric array codes
• Campopiano-type bounds in non-Hamming array coding
• Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
• CT bursts-from classical to array coding
• On some perfect codes with respect to Lee metric
• MODIFICATION TO A BOUND FOR RANDOM ERROR CORRECTION WITH LEE WEIGHT
• AN ALGORITHMIC APPROACH TO ACHIEVE MINIMUM $\\rho$-DISTANCE AT LEAST d IN LINEAR ARRAY CODES
• A new series of concatenated codes subject to matrix type-<tex>B</tex>codes
• Sufficient Condition over the Number of Parity Checks for Burst Error Detection/Correction in Linear Lee Weight Codes

This page was built for publication: Array Codes in the Generalized Lee-RT Pseudo-Metric (GLRTP-Metric)