2021/10/25 by Caruso, Xavier, Durand, Amaury · 1 citation
#FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Rings and Algebras (math.RA)
paper · doi:10.48550/arxiv.2110.12675
We give a description of the duals of linearized Reed-Solomon codes in terms of codes obtained by taking residues of Ore rational functions. Our construction shows in particular that, under some assumptions on the base field, the class of linearized Reed-Solomon codes is stable under duality. As a byproduct of our work, we develop a theory of residues in the Ore setting.