scholarly journals The homogeneous weight for Rk, related gray map and new binary quasi-cyclic codes

Filomat ◽  
2017 ◽  
Vol 31 (4) ◽  
pp. 885-897 ◽  
Author(s):  
Bahattin Yildiz ◽  
Ismail Kelebek

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.

2002 ◽  
Vol 48 (7) ◽  
pp. 2065-2069 ◽  
Author(s):  
N. Aydin ◽  
D.K. Ray-Chaudhuri

2018 ◽  
Vol 11 (03) ◽  
pp. 1850042 ◽  
Author(s):  
Hai Q. Dinh ◽  
Abhay Kumar Singh ◽  
Sukhamoy Pattanayak ◽  
Songsak Sriboonchitta

In this paper, our main objective is to find out the necessary and sufficient conditions for a cyclic code of arbitrary length over the ring of four elements [Formula: see text] [Formula: see text] to be a reversible cyclic code. We also obtain the structure of cyclic DNA codes of odd length over the ring [Formula: see text], which plays an important role in Computational Biology. Furthermore, we establish a direct link between the elements of ring [Formula: see text] and 64 codons used in the amino acids of living organisms by introducing a Gray map from [Formula: see text] to [Formula: see text]. Among others, binary images of cyclic codes over [Formula: see text] are also investigated. As applications, some cyclic DNA codes over [Formula: see text] using the Gray map are provided.


2018 ◽  
Vol 11 (05) ◽  
pp. 1850072 ◽  
Author(s):  
Mohammad Ashraf ◽  
Ghulam Mohammad

In this paper, we study skew cyclic codes over the ring [Formula: see text], where [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text] is a prime. We define a Gray map from [Formula: see text] to [Formula: see text] and investigate the structural properties of skew cyclic codes over [Formula: see text] using decomposition method. It is shown that the Gray images of skew cyclic codes of length [Formula: see text] over [Formula: see text] are the skew [Formula: see text]-quasi cyclic codes of length [Formula: see text] over [Formula: see text]. Finally, the idempotent generators of skew cyclic codes over [Formula: see text] have also been discussed.


Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2237-2248 ◽  
Author(s):  
Habibul Islam ◽  
Om Prakash

In this paper, we study (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes over the ring Z4 + uZ4 + vZ4 + uvZ4 where u2 = v2 = 0,uv = vu. We define some new Gray maps and show that the Gray images of (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes are cyclic, quasi-cyclic and permutation equivalent to quasi-cyclic codes over Z4. Further, we determine the structure of (1 + 2u + 2v)-constacyclic codes of odd length n.


2015 ◽  
Vol 08 (04) ◽  
pp. 1550085
Author(s):  
Sukhamoy Pattanayak ◽  
Abhay Kumar Singh

Quasi-cyclic (QC) codes are a natural generalization of cyclic codes. In this paper, we study some structural properties of QC codes over [Formula: see text], where [Formula: see text] is a prime and [Formula: see text]. By exploring their structure, we determine the one generator QC codes over [Formula: see text] and the size by giving a minimal spanning set. We discuss some examples of QC codes of various length over [Formula: see text].


2020 ◽  
Vol 70 (6) ◽  
pp. 626-632
Author(s):  
Om Prakash ◽  
Shikha Yadav ◽  
Ram Krishna Verma

This article discusses linear complementary dual (LCD) codes over ℜ = Fq+uFq(u2=1) where q is a power of an odd prime p. Authors come up with a new Gray map from ℜn to F2nq and define a new class of codes obtained as the gray image of constacyclic codes over .ℜ Further, we extend the study over Euclidean and Hermitian LCD codes and establish a relation between reversible cyclic codes and Euclidean LCD cyclic codes over ℜ. Finally, an application of LCD codes in multisecret sharing scheme is given.


2018 ◽  
Vol 64 (5) ◽  
pp. 3927-3943 ◽  
Author(s):  
Carlos Aguilar-Melchor ◽  
Olivier Blazy ◽  
Jean-Christophe Deneuville ◽  
Philippe Gaborit ◽  
Gilles Zemor

Sign in / Sign up

Export Citation Format

Share Document