Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
From MaRDI portal
Abstract: Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction capability. Employing cyclic and constacyclic codes, we construct three new classes of MDS symbol-pair codes with minimum pair-distance five or six. Moreover, we find a necessary and sufficient condition which ensures a class of cyclic codes to be MDS symbol-pair codes. This condition is related to certain property of a special kind of linear fractional transformations. A detailed analysis on these linear fractional transformations leads to an algorithm, which produces many MDS symbol-pair codes with minimum pair-distance seven.
Recommendations
- Constructions of MDS symbol-pair codes with minimum distance seven or eight
- MDS symbol-pair codes from repeated-root cyclic codes
- New constructions of MDS symbol-pair codes
- MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
- Improvement on minimum distance of symbol-pair codes
Cites work
Cited in
(17)- MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
- Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
- Cyclic codes of length \(5p\) with MDS symbol-pair
- New constructions of MDS symbol-pair codes
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
- AMDS symbol-pair codes from repeated-root cyclic codes
- A class of constacyclic BCH codes
- The \(b\)-weight distribution for MDS codes
- 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
- Construction of optimal codes from a class of constacyclic codes
- Maximum distance separable codes for b-symbol read channels
- MDS symbol-pair codes from repeated-root cyclic codes
- On the Hamming distances of repeated-root constacyclic codes of length 4p^s
- MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
- Optimal \(b\)-symbol constacyclic codes with respect to the Singleton bound
This page was built for publication: Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407054)
