Constructions of Maximum Distance Separable Symbol-Pair Codes Using Cyclic and Constacyclic Codes

August 09, 2016 ยท Declared Dead ยท ๐Ÿ› Designs, Codes and Cryptography

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shuxing Li, Gennian Ge arXiv ID 1608.02687 Category cs.IT: Information Theory Cross-listed math.CO Citations 58 Venue Designs, Codes and Cryptography Last Checked 3 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Theory

Died the same way โ€” ๐Ÿ‘ป Ghosted