The Gray Map on GR(p 2, n) and Repeated-Root Cyclic Codes

2004 ◽  
pp. 181-196 ◽  
Author(s):  
Horacio Tapia-Recillas
Keyword(s):  
Cyclic Codes ◽  
Gray Map

scholarly journals Constacyclic and Linear Complementary Dual Codes Over Fq + uFq

2020 ◽  
Vol 70 (6) ◽  
pp. 626-632
Author(s):  
Om Prakash ◽  
Shikha Yadav ◽  
Ram Krishna Verma
Keyword(s):  
Cyclic Codes ◽  
Gray Map ◽  
Constacyclic Codes ◽  
Dual Codes ◽  
Gray Image ◽  
New Class ◽  
Sharing Scheme ◽  
Lcd Codes ◽  
Reversible Cyclic Codes

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.

scholarly journals Skew cyclic codes over 𝔽4R

2020 ◽  
pp. 2250065
Author(s):  
Nasreddine Benbelkacem ◽  
Martianus Frederic Ezerman ◽  
Taher Abualrub ◽  
Nuh Aydin ◽  
Aicha Batoul
Keyword(s):  
Error Control ◽  
Cyclic Codes ◽  
Gray Map ◽  
Inner Product ◽  
Algebraic Structures ◽  
Error Control Codes ◽  
Dna Codes ◽  
Natural Connection ◽  
Skew Cyclic Codes

This paper considers a new alphabet set, which is a ring that we call [Formula: see text], to construct linear error-control codes. Skew cyclic codes over this ring are then investigated in details. We define a nondegenerate inner product and provide a criteria to test for self-orthogonality. Results on the algebraic structures lead us to characterize [Formula: see text]-skew cyclic codes. Interesting connections between the image of such codes under the Gray map to linear cyclic and skew-cyclic codes over [Formula: see text] are shown. These allow us to learn about the relative dimension and distance profile of the resulting codes. Our setup provides a natural connection to DNA codes where additional biomolecular constraints must be incorporated into the design. We present a characterization of [Formula: see text]-skew cyclic codes which are reversible complement.

On quantum codes obtained from cyclic codes over A2

2015 ◽  
Vol 13 (03) ◽  
pp. 1550031 ◽  
Author(s):  
Abdullah Dertli ◽  
Yasemin Cengellenmis ◽  
Senol Eren
Keyword(s):  
Cyclic Codes ◽  
Error Correcting Codes ◽  
Gray Map ◽  
Quantum Codes ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Arbitrary Length ◽  
Necessary And Sufficient ◽  
Quantum Error

In this paper, quantum codes from cyclic codes over A2 = F2 + uF2 + vF2 + uvF2, u2 = u, v2 = v, uv = vu, for arbitrary length n have been constructed. It is shown that if C is self orthogonal over A2, then so is Ψ(C), where Ψ is a Gray map. A necessary and sufficient condition for cyclic codes over A2 that contains its dual has also been given. Finally, the parameters of quantum error correcting codes are obtained from cyclic codes over A2.

scholarly journals New Quantum and LCD Codes over Finite Fields of Even Characteristic

2021 ◽  
Vol 71 (5) ◽  
pp. 656-661
Author(s):  
Habibul Islam ◽  
Om Prakash
Keyword(s):  
Finite Fields ◽  
Cyclic Codes ◽  
Error Correcting Codes ◽  
Gray Map ◽  
Chain Ring ◽  
Lcd Codes ◽  
Lcd Code ◽  
Quantum Error

For an integer m ≥ 1, we study cyclic codes of length l over a commutative non-chain ring F2m + uF2m , where u2 = u . With a new Gray map and Euclidean dual-containing cyclic codes, we provide many new and superior codes to the best-known quantum error-correcting codes. Also, we characterise LCD codes of length l with respect to their generator polynomials and prove that F2m − image of an LCD code of length l is an LCD code of length 2l . Finally, we provide several optimal LCD codes from the Gray images of LCD codes over F2m + uF2m .  

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
Keyword(s):  
Coding Theory ◽  
Cyclic Codes ◽  
Gray Map ◽  
Binary Codes ◽  
Binary Images ◽  
Frobenius Rings ◽  
Homogeneous Weights ◽  
Homogeneous Weight ◽  
Theoretical Results ◽  
Quasi Cyclic Codes

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.

Quantum codes over a class of finite chain ring

2016 ◽  
pp. 39-49
Author(s):  
Mustafa Sari ◽  
Irfan Siap
Keyword(s):  
Finite Field ◽  
Cyclic Codes ◽  
Gray Map ◽  
Quantum Codes ◽  
Finite Chain ◽  
Chain Ring ◽  
Finite Chain Ring ◽  
Quantum Error

In this study, we introduce a new Gray map which preserves the orthogonality from the chain ring F_2 [u] / (u^s ) to F^s_2 where F_2 is the finite field with two elements. We also give a condition of the existence for cyclic codes of odd length containing its dual over the ring F_2 [u] / (u^s ) . By taking advantage of this Gray map and the structure of the ring, we obtain two classes of binary quantum error correcting (QEC) codes and we finally illustrate our results by presenting some examples with good parameters.

On skew cyclic codes over a semi-local ring

2015 ◽  
Vol 07 (04) ◽  
pp. 1550042 ◽  
Author(s):  
Mohammad Ashraf ◽  
Ghulam Mohammad
Keyword(s):  
Local Ring ◽  
Structural Properties ◽  
Decomposition Method ◽  
Cyclic Code ◽  
Cyclic Codes ◽  
Gray Map ◽  
Gray Image ◽  
Skew Cyclic Codes

In the present paper, we study skew cyclic codes over the finite semi-local ring [Formula: see text], where [Formula: see text] and [Formula: see text] is an odd 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 proved that the Gray image of a skew cyclic code of length [Formula: see text] over [Formula: see text] is a skew [Formula: see text]-quasi-cyclic code of length [Formula: see text] over [Formula: see text]. Further, it is shown that the skew cyclic codes over [Formula: see text] are principally generated.

DNA cyclic codes over the ring 𝔽2[u,v]/〈u2 − 1,v3 − v,uv − vu〉

2018 ◽  
Vol 11 (03) ◽  
pp. 1850042 ◽  
Author(s):  
Hai Q. Dinh ◽  
Abhay Kumar Singh ◽  
Sukhamoy Pattanayak ◽  
Songsak Sriboonchitta
Keyword(s):  
Cyclic Code ◽  
Cyclic Codes ◽  
Sufficient Conditions ◽  
Gray Map ◽  
Arbitrary Length ◽  
Binary Images ◽  
Dna Codes ◽  
Cyclic Dna Codes ◽  
Living Organisms ◽  
Necessary And Sufficient

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.

scholarly journals Ideal structure of Zq + uZq and Zq + uZq-cyclic codes

Filomat ◽  
2020 ◽  
Vol 34 (12) ◽  
pp. 4199-4214
Author(s):  
Raj Kumar ◽  
Maheshanand Bhaintwal ◽  
Ramakrishna Bandi
Keyword(s):  
Cyclic Code ◽  
Cyclic Codes ◽  
Gray Map ◽  
Sufficient Condition ◽  
Ideal Structure ◽  
Necessary And Sufficient Condition ◽  
Complete Ideal ◽  
Necessary And Sufficient

In this paper, we study cyclic codes of length n over R = Zq + uZq, u2 = 0, where q is a power of a prime p and (n; p) = 1. We have determined the complete ideal structure of R. Using this, we have obtained the structure of cyclic codes and that of their duals through the factorization of xn-1 over R. We have also computed total number of cyclic codes of length n over R. A necessary and sufficient condition for a cyclic code over R to be self-dual is presented. We have presented a formula for the total number of self-dual cyclic codes of length n over R. A new Gray map from R to Z2rp is defined. Using Magma, some good cyclic codes of length 4 over Z9 + uZ9 are obtained.

Skew cyclic codes over Fq + uFq + vFq

2018 ◽  
Vol 11 (05) ◽  
pp. 1850072 ◽  
Author(s):  
Mohammad Ashraf ◽  
Ghulam Mohammad
Keyword(s):  
Structural Properties ◽  
Decomposition Method ◽  
Cyclic Codes ◽  
Gray Map ◽  
Skew Cyclic Codes ◽  
Quasi Cyclic Codes

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.

Sign in / Sign up

Export Citation Format

Share Document