Papers for

data storage hardware teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

New cyclic codes improve error correction for overlapping symbol pairs

DS and AMDS Symbol-Pair Codes from Three Families of Simple Root Cyclic Codes

Abstract: Symbol-pair distances of simple-root cyclic codes are important for evaluating error correction performance under overlapping pair read channels. In this paper, we construct three families of simple-root cyclic codes over finite fields of odd characteristic via generator polynomials. For length \(2q+2\), the minimum symbol-pair distance is \(10\) for every odd prime power \(q\ge 7\), established by excluding invalid support configurations. For length \(4q-4\), when \(q\equiv 3\pmod 4\) and finite field constraints hold, it is \(9\) or \(10\). For length \(2(q-1)\), reciprocal-polynomial analysis shows it is \(11\) or \(12\). All obtained codes are MDS or AMDS symbol-pair codes.

Sat 10 OctInformation TheoryCryptography and Security

The gist

When data is read in overlapping pairs, errors can be tricky to detect and fix. The authors studied special cyclic codes to measure how well they correct mistakes in these overlapping pairs. They created three groups of codes that work over certain finite fields and have good minimum distances, which means better error detection and correction ability. Their codes are either maximum distance separable (MDS) or almost MDS, meaning they perform very well for their size. This work helps in understanding and building better coding methods for certain communication channels.

Open → 2610.14435v1