AI & ML
On the structure of polynomial ideal codes and additive Reed--Solomon codes
arXiv math.IT0 views
arXiv:2610.21509v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2610.21509PreviousIterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like CodesNextIt Takes Two Moments: Rigidity and Limits of Continuous Encoders for Over-the-Air Computation
Related posts
Same model, same defences: 7 document attacks down to 0, chat attacks barely moved
0dev.to
Skill to Create Product Videos
0Hacker News
SOML – A Config Format for Humans
0Hacker News
Egoless Mathematics in the AI Era
0Hacker News
LifeVal
0OpenAI Blog
Claude’s new rules against game cloning won’t stop the AI copying boom
0Ars Technica