Generalized Extended Hamming Codes over Galois Ring of Characteristic $2^{n}$
نویسندگان
چکیده
In this paper, we introduce generalized extended Hamming codes over Galois rings GR(2,m) of characteristic 2 with extension degree m. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over GR(2,m) is 4 and the minimum Lee weight of generalized extended Hamming codes over GR(8,m) is 6 for all m ≥ 3. ——————————————————————– ———Received May 25, 2011. This work is supported by JSPS KAKENHI (20540014). AMS Subject Classification 94B05
منابع مشابه
Repeated-root cyclic and negacyclic codes over a finite chain ring
We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality and Hamming distance of repeated-root c...
متن کاملRepeated-root cyclic and negacyclic codes over a nite chain ring
We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality and Hamming distance of repeated-root c...
متن کاملAn Explicit Tower over Cubic Finite Fields and Zink’s Lower Bound
Codes over Galois Ring Gilberto Bini We shall briefly recall some basic facts on trace codes over finite fields. In particular, we will focus on generalizations of dual Melas codes. After such an overview, we will introduce the Galois ring set-up in which we try to extend some of the techniques over fields. For these purposes, we need some results on exponential sums over Galois rings. Finally,...
متن کاملRepeated Root Cyclic and Negacyclic Codes over Galois Rings
Repeated root Cyclic and Negacyclic codes over Galois rings have been studied much less than their simple root counterparts. This situation is beginning to change. For example, repeated root codes of length p, where p is the characteristic of the alphabet ring, have been studied under some additional hypotheses. In each one of those cases, the ambient space for the codes has turned out to be a ...
متن کاملMinimum Homogeneous Weights of a Class of Cyclic Codes over Primary Integer Residue Rings∗
EXTENDED ABSTRACT. Most of the results in traditional finite-field linear coding theory regarding the minimum distance of linear codes refer to the Hamming metric. Important early exceptions are given by Berlekamp’s nega-cyclic codes (cf. [1]) and Mazur’s [9] low-rate codes, both having interesting properties in terms of the Leemetric. At the beginning of the nineties of the previous century an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1310.5225 شماره
صفحات -
تاریخ انتشار 2013