Correction of CT burst array errors in the generalized-Lee-RT spaces
From MaRDI portal
Publication:606296
DOI10.1007/S10114-010-8508-6zbMATH Open1201.94121OpenAlexW2016543230MaRDI QIDQ606296FDOQ606296
Publication date: 17 November 2010
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-010-8508-6
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of Error-Correcting Codes
- Codes for the \(m\)-metric
- Two-Dimensional Cluster-Correcting Codes
- 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
- Array Codes in the Generalized Lee-RT Pseudo-Metric (GLRTP-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
- ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS
- CONSTRUCTION OF m-METRIC ARRAY CODES DETECTING AND CORRECTING CT-BURST ARRAY ERRORS
- 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
- Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration
- Bursts in \(m\)-metric array codes
- Campopiano-type bounds in non-Hamming array coding
This page was built for publication: Correction of CT burst array errors in the generalized-Lee-RT spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606296)
