Campopiano-type bounds in non-Hamming array coding
From MaRDI portal
Publication:865455
DOI10.1016/j.laa.2006.06.021zbMath1130.94334OpenAlexW2012197665MaRDI QIDQ865455
Publication date: 14 February 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.06.021
Related Items (5)
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 ⋮ CT bursts-from classical to array coding ⋮ Array Codes in the Generalized Lee-RT Pseudo-Metric (GLRTP-Metric) ⋮ CONSTRUCTION OF m-METRIC ARRAY CODES DETECTING AND CORRECTING CT-BURST ARRAY ERRORS
Cites Work
- Bursts in \(m\)-metric array codes
- Codes for the \(m\)-metric
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
- 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)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Campopiano-type bounds in non-Hamming array coding