From the 1 of 9 linked papers with an AI index.
9 papers
A Survey on Code Equivalence: The State-of-the-Art and Open Questions
Anna-Lena Horlemann, Abhinaba Mazumder, Michael Schaller +1
The paper surveys the code equivalence problem and its variants, summarizing known algorithmic techniques, attacks, hardness assumptions, and outlining open research questions.
Equivalence of Families of Polycyclic Codes over Finite Fields
Hassan Ou-azzou, Anna-Lena Horlemann
We study the equivalence of families of polycyclic codes associated with polynomials of the form over a finite field. We begin with the…
The Power of Power Codes: New Classes of Easy Instances for the Linear Equivalence Problem
Michele Battagliola, Anna-Lena Horlemann, Abhinaba Mazumder +4
Given two linear codes, the Linear Equivalence Problem (LEP) asks to find (if it exists) a linear isometry between them; as a special case, we have the Permutation Equivalence Prob…
Distinguishers for Skew and Linearized Reed-Solomon Codes
Felicitas Hörmann, Anna-Lena Horlemann
Generalized Reed-Solomon (GRS) and Gabidulin codes have been proposed for various code-based cryptosystems, though most such schemes without elaborate disguising techniques have be…
Bounds and Equivalence of Skew Polycyclic Codes over Finite Fields
Hassan Ou-azzou, Anna-Lena Horlemann, Nuh Aydin
We study skew polycyclic codes over a finite field , associated with a skew polynomial , where is an automorphism of .…
-ary Sequential Locally Recoverable Codes from the Product Construction
Akram Baghban, Marc Newman, Anna-Lena Horlemann +1
This work focuses on sequential locally recoverable codes (SLRCs), a special family of locally repairable codes, capable of correcting multiple code symbol erasures, which are comm…