Counting double-polycyclic codes over a finite chain ring of nilpotency index two

DOI10.3934/AMC.2025013MaRDI QIDQ6952870zbMATH OpenFDO

Authors Sarra Talbi, Alexandre Fotue Tabue, Meenakshi Devi

Publication date 25 July 2025

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2025013

zbMATH Keywords

double polycyclic codesfinite chain ringnon-separable codessquare-free polynomial

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Cyclic codes (94B15)

Cites work

• A representation theorem for Chain rings
• Enumeration of \({\mathbb{Z}}_4\)-double cyclic codes
• Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• On \(\mathbb{Z}_2\mathbb{Z}_4\)-additive polycyclic codes and their Gray images
• On double cyclic codes over \(\mathbb{Z}_4\)
• On polycyclic codes over a finite chain ring
• On the algebraic structure of quasi-polycyclic codes and new quantum codes
• On the number of \(\mathbb{Z}_2 \mathbb{Z}_4\) and \(\mathbb{Z}_p \mathbb{Z}_{p^2}\)-additive cyclic codes
• Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes

This page was built for publication: Counting double-polycyclic codes over a finite chain ring of nilpotency index two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952870)