Campopiano-type bounds in non-Hamming array coding
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3172225 (Why is no real title available?)
- scientific article; zbMATH DE number 1284435 (Why is no real title available?)
- scientific article; zbMATH DE number 1795934 (Why is no real title available?)
- scientific article; zbMATH DE number 1874570 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- A new series of concatenated codes subject to matrix type-<tex>B</tex>codes
- Bursts in \(m\)-metric array codes
- Codes for the \(m\)-metric
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
- The Complete Weight Enumerator for Codes over M nxs(F q)
Cited in
(9)- 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
- Correction of CT burst array errors in the generalized-Lee-RT spaces
- Burst error enumeration of \(m\)-array codes over rings and its applications
- On a class of blockwise-bursts in array codes.
- Solid bursts-from Hamming to RT-spaces.
- Array codes in the generalized Lee-RT pseudo-metric (GLRTP-metric)
- scientific article; zbMATH DE number 4059291 (Why is no real title available?)
- CT bursts-from classical to array coding
This page was built for publication: Campopiano-type bounds in non-Hamming array coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865455)