scientific article; zbMATH DE number 1284435
This Chapter 22 of the Handbook of Coding Theory (for the entire collection see Zbl 0907.94001) is concerned with array (matrix) codes. It seems here in reality that array coding is excellent in applications. Their interest lies in their ability to correct a cluster or burst of errors. Throughout its five sections, these error correcting codes are handled in a such a way as to show that the codes considered can be implemented and used for multitrack magnetic recording, satellite communications and disk array applications. Some of these codes can correct criss-cross mass type of errors, i.e errors in which a certain number of rows and columns have been erroneously received. Their resulting capability over other codes considered in this book lies in the fact that matrix codes can be either convolutional or of block-type defined over a finite field with deterministic processing using all mathematical branches such as algebra, geometry and algorithmic procedures. This fact makes them powerful among all others. For the entire collection see [Zbl 0907.94001].
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
- CT bursts-from classical to array coding
- Recovering erasures by using MDS codes over extension alphabets
- Perfect one-factorizations arising from the Lee metric
- Irregular MDS Array Codes
- Correction of 2-dimensional occasional and cluster errors in LRTJ-spaces.
- Array Folds Logic
- Array codes and cryptography
- Cryptography and Coding
- Codes for Distributed Storage
- Correction of CT burst array errors in the generalized-Lee-RT spaces
- On binary linear codes and binary pseudo-random sequences
- Additive codes with few weights
- Optimal array codes with hierarchical locality
- Construction of self-dual matrix codes
- Bursts in \(m\)-metric array codes
- Campopiano-type bounds in non-Hamming array coding
- An enumeration of the equivalence classes of self-dual matrix codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242029)