Codes over affine algebras with a finite commutative chain coefficient ring
From MaRDI portal
(Redirected from Publication:1679699)
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.
Recommendations
- Algebraic Coding Theory Over Finite Commutative Rings
- Constacyclic codes over finite commutative chain rings
- Notes on linear codes over finite commutative chain rings
- On codes over rings invariant under affine groups
- Codes over finite quotients of polynomial rings
- Constacyclic codes over finite commutative semi-simple rings
- Cyclic codes over a non-commutative finite chain ring
- Codes over a non chain ring with some applications
- Linear codes over finite chain rings
- Codes Over Algebraic Integer Rings of Cyclotomic Fields
Cites work
- scientific article; zbMATH DE number 53909 (Why is no real title available?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 1504681 (Why is no real title available?)
- scientific article; zbMATH DE number 1789344 (Why is no real title available?)
- 1-generator quasi-cyclic codes over finite chain rings
- Algebraic structure of quasicyclic codes
- Bounds on quasi-cyclic codes over finite chain rings
- Canonical generating system of a monic polynomial ideal over a commutative Artinian chain ring
- Codes over \(R_k\), Gray maps and their binary images
- Codes over finite quotients of polynomial rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Linearly representable codes and the Kerdock code over an arbitrary Galois field of characteristic 2
- Multivariable Codes Over Finite Chain Rings: Serial Codes
- Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over \(\mathbb{F}_4\)
- On codes over local Frobenius non-chain rings of order 16
- On repeated-root multivariable codes over a finite chain ring
- On the algebraic structure of quasi-cyclic codes. II: Chain rings
- On the structure of linear and cyclic codes over a finite chain ring
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Quasi-abelian codes
Cited in
(8)- On polycyclic codes over a finite chain ring
- Abelian and consta-abelian polyadic codes over affine algebras with a finite commutative chain coefficient ring
- On cyclic codes over \(\mathbb{Z}_q [u] / \langle u^2 \rangle\) and their enumeration
- Cyclic codes over a non-chain ring \(R_{e,q}\) and their application to LCD codes
- Infinite families of MDR cyclic codes over \(\mathbb{Z}_4\) via constacyclic codes over \(\mathbb{Z}_4 [u] \slash \langle u^2 - 1 \rangle \)
- On semisimple algebra codes: generator theory
- On \(\mathbb{Z}_2\mathbb{Z}_4\)-additive polycyclic codes and their Gray images
- Algebraic Coding Theory Over Finite Commutative Rings
This page was built for publication: Codes over affine algebras with a finite commutative chain coefficient ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679699)