ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS
From MaRDI portal
Publication:3521584
DOI10.1142/S1793557108000138zbMath1145.94025OpenAlexW2133864619MaRDI QIDQ3521584
Publication date: 26 August 2008
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557108000138
Linear codes (general theory) (94B05) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (1)
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
- A new series of concatenated codes subject to matrix type-<tex>B</tex>codes
- Fundamentals of Error-Correcting 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: ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS