Maximum Distance Separable Codes for Symbol-Pair Read Channels
From MaRDI portal
Abstract: We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound. In contrast to classical codes, where all known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair codes can have length Omega(q^2). In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters.
Cited in
(32)- A new family of AMDS symbol-pair constacyclic codes of length 4p and symbol-pair distance 9p
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- Bounds and constructions of optimal symbol-pair codes with constant pair-weight
- MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
- Cyclic codes of length \(5p\) with MDS symbol-pair
- New constructions of MDS symbol-pair codes
- On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
- On symbol-pair distance distributions of repeated-root constacyclic codes of length 4p^s and MDS codes
- Another expression of the MacWilliams identities and its applications
- Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
- AMDS symbol-pair codes from repeated-root cyclic codes
- A new class of AMDS symbol-pair codes from repeated-root codes
- The \(b\)-weight distribution for MDS codes
- Codes for Symbol-Pair Read Channels
- The b-symbol weight hierarchy of the Kasami codes
- New constructions of optimal symbol-pair constacyclic codes of length 4p^s
- On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
- Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
- Constructions of MDS symbol-pair codes with minimum distance seven or eight
- Maximum distance separable codes for b-symbol read channels
- Lee metric codes for symbol-pair read channels
- The \(b\)-symbol weight hierarchies of two families of cyclic codes over \(\mathbb{F}_q\)
- On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codes
- MDS symbol-pair codes from repeated-root cyclic codes
- Several new classes of MDS symbol-pair codes
- New constructions of MDS symbol-pair codes via simple-root cyclic codes
- The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
- Some bounds on the cardinality of the b-symbol weight spectrum of codes
- Optimal b-symbol constacyclic codes with respect to the Singleton bound
- Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\)
This page was built for publication: Maximum Distance Separable Codes for Symbol-Pair Read Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346251)
