Structure and duality properties of polynomial ideal and additive Reed Solomon codes
On the structure of polynomial ideal codes and additive Reed--Solomon codes
Information Theory
Summary
This paper studies special types of error-correcting codes called polynomial ideal (PI) codes and additive Reed–Solomon (aRS) codes, which help fix mistakes in data transmission. The authors discovered how long these codes can be, how their dual versions behave, and detailed formulas describing their properties. They also found relationships between PI codes and aRS codes, showing they share important features and can be analyzed similarly. Finally, the paper extends these codes to more general cases and explores when they meet certain strong optimality conditions.
What this means in practice
- •For communication engineers: Design error-correcting codes that achieve maximum length and optimal dual properties for reliable data transmission over noisy channels.
- •For hardware system designers: Implement decoding algorithms using the structural properties of PI and aRS codes to improve fault tolerance in storage or computing devices.
A theory result. No direct application yet.
Authors
Umberto Martínez-Peñas, Rubén Rodríguez-Ballesteros
Abstract
We study structural properties of polynomial ideal (PI) codes and additive Reed--Solomon (aRS) codes in the folded Hamming metric (equivalently, the Hamming metric over a larger alphabet). We first determine the maximum possible length of PI codes, prove that the dual of every PI code is a generalized PI code, and deduce that PI codes are dually QMDS together with an explicit formula for their weight distribution. We then show that PI codes defined by irreducible polynomials correspond to aRS codes with pairwise nonconjugate evaluation points. For these aRS codes, the previous results on PI codes apply (duality, QMDS property and weight distribution). We show that, asymptotically, aRS codes with nonconjugate evaluation points achieve the same length as PI codes. We also compute the permutation group of such aRS codes. We also extend the family of PI codes to consider arbitrary polynomial modules (not necessarily pairwise coprime), and study when these and general aRS codes satisfy the QMDS and dually QMDS properties.