Construction of linear codes over $\mathfrak{R}=\sum_{s=0}^{4} v_{5}^{s}\mathcal{A}_{4}$
نویسندگان
چکیده
The aim of this paper is to propose a new family codes. We define over the ring R=∑^4_{s=0}v^s_5A_4, with v^5_5=v_5. derive its properties, generator matrix and Gray images. This codes illustrated by three applications.
منابع مشابه
Translates of Linear Codes Over
We give a method to compute the complete weight distribution of translates of linear codes over Z4. The method follows known ideas that have already been used successfully by others for Hamming weight distributions. For the particular case of quaternary Preparata codes, we obtain that the number of distinct complete weights for the dual Preparata codes and the number of distinct complete coset ...
متن کاملConstruction of Self - Dual Codes over F
We present two kinds of construction methods for self-dual codes over F2 + uF2. Specially, the second construction (respectively, the first one) preserves the types of codes, that is, the constructed codes from Type II (respectively, Type IV) is also Type II (respectively, Type IV). Every Type II (respectively, Type IV) code over F2 + uF2 of free rank larger than three (respectively, one) can b...
متن کاملConstruction of Z4-linear Reed-Muller codes
New quaternary Plotkin constructions are given and are used to obtain new families of quaternary codes. The parameters of the obtained codes, such as the length, the dimension and the minimum distance are studied. Using these constructions new families of quaternary Reed-Muller codes are built with the peculiarity that after using the Gray map the obtained Z4-linear codes have the same paramete...
متن کاملConstruction of (sometimes) Optimal Linear Codes
For the purpose of error correcting linear codes over a finite field GF (q) and fixed dimension k we are interested in codes with high minimum distance d as these allow the correction of up to b(d− 1)/2c errors. On the other hand we are interested in codes with minimum redundancy, i.e. codes of small length n. High minimum distance and small length are controversial goals for the optimization o...
متن کاملLinear Codes over Finite Rings
Linear codes over finite rings with identity have recently raised a great interest for their new role in algebraic coding theory and for their successful application in combined coding and modulation. Thus, in this paper we address the problems of constructing of new cyclic, BCH, alternant, Goppa and Srivastava codes over local finite commutative rings with identity. These constructions are ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical modeling and computing
سال: 2023
ISSN: ['2312-9794', '2415-3788']
DOI: https://doi.org/10.23939/mmc2023.01.147