Cyclic codes over a non-chain ring R, and their application to LCD codes

2021 ◽  
Vol 344 (10) ◽  
pp. 112545
Author(s):  
Habibul Islam ◽  
Edgar Martínez-Moro ◽  
Om Prakash
Keyword(s):  
2021 ◽  
Vol 71 (5) ◽  
pp. 656-661
Author(s):  
Habibul Islam ◽  
Om Prakash

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 .  


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.


2017 ◽  
Vol 86 (10) ◽  
pp. 2261-2278 ◽  
Author(s):  
Chengju Li
Keyword(s):  

Author(s):  
M. Boumezbeur ◽  
S. Mesnager ◽  
K. Guenda

In this paper, we study the relationship between vectorial (Boolean) functions and cyclic codes in the context of algebraic attacks. We first derive a direct link between the annihilators of a vectorial function (in univariate form) and certain [Formula: see text]-ary cyclic codes (which we show that they are LCD codes). We also present some properties of those cyclic codes as well as their weight enumerator. In addition, we generalize the so-called algebraic complement and study its properties.


2017 ◽  
Vol 26 (3) ◽  
pp. 544-547 ◽  
Author(s):  
Minjia Shi ◽  
Ting Yao ◽  
Patrick Solé

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 18902-18914 ◽  
Author(s):  
Hai Q. Dinh ◽  
Tushar Bag ◽  
Ashish Kumar Upadhyay ◽  
Ramakrishna Bandi ◽  
Warattaya Chinnakum
Keyword(s):  

2020 ◽  
Vol 87 (3-4) ◽  
pp. 231
Author(s):  
Saroj Rani

In this paper, we establish the algebraic structure of all cyclic and negacyclic codes of length 8<em>p</em><sup>s</sup> over the chain ring Fp<sup>m</sup> + uFp<sup>m</sup> in terms of their generator polynomials, where u<sup>2</sup> = 0 and s is a positive integer and p is an odd prime. We also find out the number of codewords in each of these cyclic codes. Besides this, we determine duals of cyclic codes and list self-dual cyclic and negacyclic codes of length 8<em>p</em><sup>s</sup> over Fp<sup>m</sup> + uFp<sup>m</sup>. Also, we determine μ and -constacyclic codes of length 8<em>p</em><sup>s</sup> over Fp<sup>m</sup> + uFp<sup>m</sup>.


Sign in / Sign up

Export Citation Format

Share Document