English

Polycyclic codes over serial rings and their annihilator CSS construction

Information Theory 2025-03-06 v3 math.IT

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)\mathscr R=R[x_1,\ldots, x_s]/\langle t_1(x_1),\ldots, t_s(x_s) \rangle, where RR is a chain ring and each ti(xi)t_i(x_i) in R[xi]R[x_i] for i{1,,s}i\in\{1,\ldots, s\} is a monic square-free polynomial. We define quasi-ss-dimensional polycyclic codes and establish an RR-isomorphism between these codes and polycyclic codes over R\mathscr 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 RR and use this construction to derive quantum codes from polycyclic codes over R\mathscr{R}.

Keywords

Cite

@article{arxiv.2404.10452,
  title  = {Polycyclic codes over serial rings and their annihilator CSS construction},
  author = {Maryam Bajalan and Edgar Martinez-Moro},
  journal= {arXiv preprint arXiv:2404.10452},
  year   = {2025}
}

Comments

24 pages, version accepted for publication in Cryptography and Communications

R2 v1 2026-06-28T15:55:40.219Z