paper

A Gröbner Approach to Dual-Containing Cyclic Left Module -Codes over Finite Commutative Frobenius Rings

arXiv:2308.13395

Abstract

For a skew polynomial ring where is a commutative Frobenius ring, an endomorphism of and a -derivation of , we consider cyclic left module codes where is a left and right divisor of in . In this paper, we derive a parity check matrix when is a finite commutative Frobenius ring using only the framework of skew polynomial rings. We consider rings which are free -modules where the restriction of and to are polynomial maps. If a Gröbner basis can be computed over , then we show that all Euclidean and Hermitian dual-containing codes can be computed using a Gröbner basis. We also give an algorithm to test if the dual code is again a cyclic left module code. We illustrate our approach for rings of order with non-trivial endomorphism and the Galois ring of characteristic .

20 pages, 11 tables

A Gröbner Approach to Dual-Containing Cyclic Left Module $(θ,δ)$-Codes over Finite Commutative Frobenius Rings · wovepaper