New constructions of MDS symbol-pair codes
From MaRDI portal
Abstract: Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with the largest minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining the maximal minimum pair-distance is called a maximum distance separable (MDS) symbol-pair code. In this paper, we focus on constructing linear MDS symbol-pair codes over the finite field . We show that a linear MDS symbol-pair code over with pair-distance exists if and only if the length ranges from to . As for codes with pair-distance , length ranging from to , we construct linear MDS symbol-pair codes by using a configuration called ovoid in projective geometry. With the help of elliptic curves, we present a construction of linear MDS symbol-pair codes for any pair-distance with length satisfying , where or .
Recommendations
- Constructions of MDS symbol-pair codes with minimum distance seven or eight
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- MDS symbol-pair codes from repeated-root cyclic codes
- MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
- Improvement on minimum distance of symbol-pair codes
Cites work
- A Construction of New MDS Symbol-Pair Codes
- Algebraic Function Fields and Codes
- Codes for Symbol-Pair Read Channels
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- Curves in projective spaces and almost MDS codes
- Hard Problems of Algebraic Geometry Codes
- Maximum Distance Separable Codes for Symbol-Pair Read Channels
- On the main conjecture on geometric MDS codes
- Stopping Sets of Algebraic Geometry Codes
- The Arithmetic of Elliptic Curves
Cited in
(21)- Maximum distance separable codes for b-symbol read channels
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
- MDS symbol-pair codes from repeated-root cyclic codes
- Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- Constructions of MDS symbol-pair codes with minimum distance seven or eight
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
- Cyclic codes of length \(5p\) with MDS symbol-pair
- A characterization of MDS codes that have an error correcting pair
- Optimal b-symbol constacyclic codes with respect to the Singleton bound
- AMDS symbol-pair codes from repeated-root cyclic codes
- 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
- Another expression of the MacWilliams identities and its applications
- MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
- The b-symbol weight hierarchy of the Kasami codes
- The \(b\)-weight distribution for MDS codes
- Several new classes of MDS symbol-pair codes
- Some bounds on the cardinality of the b-symbol weight spectrum of codes
- Bounds and constructions of optimal symbol-pair codes with constant pair-weight
This page was built for publication: New constructions of MDS symbol-pair codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741924)