$G$-codes over formal power series rings and finite chain rings
نویسندگان
چکیده
منابع مشابه
Some constacyclic codes over finite chain rings
For λ an n-th power of a unit in a finite chain ring we prove that λ-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the α+pβconstacyclic codes of length p over the Galois ring GR(p, r).
متن کاملLinear Codes over Finite Chain Rings
The aim of this paper is to develop a theory of linear codes over finite chain rings from a geometric viewpoint. Generalizing a well-known result for linear codes over fields, we prove that there exists a one-to-one correspondence between so-called fat linear codes over chain rings and multisets of points in projective Hjelmslev geometries, in the sense that semilinearly isomorphic codes corres...
متن کاملQuasi-Cyclic Codes Over Finite Chain Rings
In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we investigate the structural properties of 1-generator QC codes. Under some conditions, we discuss the enumeration of 1-generator QC codes and describe how to o...
متن کاملSkew constacyclic codes over finite chain rings
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of x − λ, where λ is a unit element, are exhibited. When λ = 1, the generators of Euclidean and Hermitian dual codes of such codes are determined tog...
متن کاملFormal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings
We next want to construct a much larger ring in which infinite sums of multiples of elements of S are allowed. In order to insure that multiplication is well-defined, from now on we assume that S has the following additional property: (#) For all s ∈ S, {(s1, s2) ∈ S × S : s1s2 = s} is finite. Thus, each element of S has only finitely many factorizations as a product of two elements. For exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2019
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.645026