One-Homogeneous Weight Codes Over Finite Chain Rings (original) (raw)
Related papers
Weight enumerators and gray maps of linear codes over rings
2006
The main focus in this thesis is linear codes over rings. In the first part, we look at linear codes over Galois rings, and using the homogeneous weight, we improve upon Wilson's results about the prime power that divides the coefficients of the homogeneous weight enumerators of these codes. We also prove that our results are best possible. Our results about homogeneous weight enumerators of linear codes over Galois rings generalize the results that we have for the Lee weight enumerators of linear codes over the ring of integers modulo 4. We also consider other weight enumerators, in particular the complete weight enumerators of linear codes and we obtain MacWilliams-like identities for these weight enumerators considering different rings. These MacWilliams-like identities lead to MacWilliams identities for the Hamming weight enumerators of linear codes over rings. We also give a counter-example to show that we cannot have MacWilliams-like identities for the Euclidean weight enu...
On bounds for codes over Frobenius rings under homogeneous weights
Discrete Mathematics, 2004
Homogeneous weight functions were introduced by Heise and Constantinescu (Lineare Codes über Restklassenringen ganzer Zahlen und ihre Automorphismen bezüglich einer verallgemeinerten Hamming-Metrik, Ph.D. Thesis, Technische Universität München, 1995; Problemy Peredachi Informatsii 33(3) (1997) 22-28). They appear as a natural generalization of the Hamming weight on finite fields and the Lee weight on Z 4 and have proven to be important in further papers (J. Combin. Theory 92 (2000) 17-28). This article develops a Plotkin and an Elias bound for (not necessarily linear) block codes on finite Frobenius rings that are equipped with this weight.
The homogeneous weight for Rk, related gray map and new binary quasi-cyclic codes
Filomat, 2017
Using theoretical results about the homogeneous weights for Frobenius rings, we describe the homogeneous weight for the ring family Rk, a recently introduced family of Frobenius rings which have been used extensively in coding theory. We find an associated Gray map for the homogeneous weight using first order Reed-Muller codes and we describe some of the general properties of the images of codes over Rk under this Gray map. We then discuss quasi-twisted codes over Rk and their binary images under the homogeneous Gray map. In this way, we find many optimal binary codes which are self-orthogonal and quasi-cyclic. In particular, we find a substantial number of optimal binary codes that are quasi-cyclic of index 8, 16 and 24, nearly all of which are new additions to the database of quasi-cyclic codes kept by Chen.
Characteristics of invariant weights related to code equivalence over rings
Designs, Codes and Cryptography, 2012
The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets, including the original MacWilliams' Equivalence Theorem for the Hamming weight on codes over finite fields. The question remains: What conditions must a weight satisfy so that the Extension Theorem will hold? In this paper we provide an algebraic framework for determining such conditions, generalising the approach taken in [5].
Multivariable Codes Over Finite Chain Rings: Serial Codes
Siam Journal on Discrete Mathematics, 2006
The structure of multivariate semisimple codes over a finite chain ring R is established using the structure of the residue fieldR. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include some non-trivial codes over R. The structure of the dual codes in the semisimple abelian case is also derived and some conditions on the existence of selfdual codes over R are studied.
Minimal and Optimal binary codes obtained using CDC_DCD-construction over the non-unital ring III
arXiv (Cornell University), 2023
In this article, we construct linear codes over the commutative non-unital ring I of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are minimal and self-orthogonal. All codes in this article are few-weight codes. Besides, an infinite class of these binary codes consists of distance optimal codes with respect to the Griesmer bound.
Codes over an infinite family of rings with a Gray map
Designs, Codes and Cryptography, 2013
Codes over an infinite family of rings which are an extension of the binary field are defined. Two Gray maps to the binary field are attached and are shown to be conjugate. Euclidean and Hermitian self-dual codes are related to binary self-dual and formally self-dual codes, giving a construction of formally self-dual codes from a collection of arbitrary binary codes. We relate codes over these rings to complex lattices. A Singleton bound is proved for these codes with respect to the Lee weight. The structure of cyclic codes and their Gray image is studied. Infinite families of self-dual and formally self-dual quasi-cyclic codes are constructed from these codes.
Information and Control, 1972
Given an integer m which is a product of distinct primes Pi, a method is given for constructing codes over the ring of integers modulo m from cyclic codes over GF(pi). Specifically, if we are given a cyclic (n, ki) code over GF(pt) with minimum Hamming distance di, for each i, then we construct a code of block length n over the integers modulo m with 1-[~ p~i codewords, which is both linear and cyclic and has minimum Hamming distance mini di. i j k
Lifted codes and lattices from codes over finite chain rings
Cryptography and Communications, 2022
In this paper we give the generalization of lifted codes over any finite chain ring. This has been done by using the construction of finite chain rings from p-adic fields. Further we propose a lattice construction from linear codes over finite chain rings using lifted codes. Keywords Codes over rings • Lifted codes • Lattices 1 Introduction Codes over finite rings have received significant attention in recent decades. Several authors have studied these codes due to their relationship with lattices construction, among other properties. The class of p-adic codes was introduced in [1]. Calderbank and Sloane investigated codes over p-adic integers and studied lifts of codes over F p and Z p e. Lifted codes over finite chain rings were studied in [2], however this study was restricted to the finite chain rings of the form F q [t]/ t k as pointed out by the reviewer in [12]. Later, Young Ho generalized the construction of cyclic lifted codes for arbitrary finite fields to codes over Galois rings GR(p e , r) in [10]. In [12], the reviewer stated that a unified treatment valid for all chain rings would certainly be desirable. Therefore, this study investigates the structure of finite chain rings as non-trivial quotient of ring integers of p-adic fields to generalize the construction in [2]. A finite commutative chain ring is a finite local ring whose maximal ideals are principal. Any finite chain ring can be constructed from p-adic fields (see for