CT bursts-from classical to array coding
From MaRDI portal
Publication:2477374
DOI10.1016/J.DISC.2007.04.010zbMath1143.94018OpenAlexW2020221167MaRDI QIDQ2477374
Publication date: 13 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.010
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 ⋮ On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric ⋮ Array Codes in the Generalized Lee-RT Pseudo-Metric (GLRTP-Metric)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bursts in \(m\)-metric array codes
- Campopiano-type bounds in non-Hamming array coding
- Codes for the \(m\)-metric
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
- 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
- The Complete Weight Enumerator for Codes over M nxs(F q)
This page was built for publication: CT bursts-from classical to array coding