Codes over Affine Algebras with a Finite Commutative Chain coefficient Ring
E. Mart\'inez-Moro, A. Pi\~nera-Nicol\'as, I.F. R\'ua

TL;DR
This paper studies a new class of algebraic codes over affine algebras built from finite commutative chain rings, generalizing existing codes and exploring their structure and duality properties.
Contribution
It introduces a canonical generator matrix for these codes and extends duality concepts to this new algebraic setting.
Findings
Codes generalize polynomial quotient and multivariable codes
Canonical generator matrices are constructed for these codes
Duality properties are established for the codes
Abstract
We consider codes defined over an affine algebra , where is a monic univariate polynomial over a finite commutative chain ring . Namely, we study the submodules of (). These codes generalize both the codes over finite quotients of polynomial rings and the multivariable codes over finite chain rings. {Some codes over Frobenius local rings that are not chain rings are also of this type}. A canonical generator matrix for these codes is introduced with the help of the Canonical Generating System. Duality of the codes is also considered.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cooperative Communication and Network Coding
