Polycyclic codes over serial rings and their annihilator CSS construction
Abstract
In this paper, we investigate the algebraic structure for polycyclic codes over a specific class of serial rings, defined as R=R[x1,…, xs]/ t1(x1),…, ts(xs) , where R is a chain ring and each ti(xi) in R[xi] for i∈\1,…, s\ is a monic square-free polynomial. We define quasi-s-dimensional polycyclic codes and establish an R-isomorphism between these codes and polycyclic codes over R. We provide necessary and sufficient conditions for the existence of annihilator self-dual, annihilator self-orthogonal, annihilator linear complementary dual, and annihilator dual-containing polycyclic codes over this class of rings. We also establish the CSS construction for annihilator dual-preserving polycyclic codes over the chain ring R and use this construction to derive quantum codes from polycyclic codes over R.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.