Classification of self-dual cyclic codes over the chain ring $$\mathbb Z_p[u]/\langle u^3 \rangle $$

2020 ◽  
Vol 88 (10) ◽  
pp. 2247-2273
Author(s):  
Boran Kim ◽  
Yoonjin Lee
Keyword(s):  
Cyclic Codes ◽  
Chain Ring

Classification of cyclic codes over a non-Galois chain ring Zp[u]/〈u3〉

2019 ◽  
Vol 59 ◽  
pp. 208-237 ◽  
Author(s):  
Boran Kim ◽  
Yoonjin Lee ◽  
Jisoo Doo
Keyword(s):  
Cyclic Codes ◽  
Chain Ring

Skew Cyclic Codes over a Non-chain Ring

2017 ◽  
Vol 26 (3) ◽  
pp. 544-547 ◽  
Author(s):  
Minjia Shi ◽  
Ting Yao ◽  
Patrick Solé
Keyword(s):  
Cyclic Codes ◽  
Chain Ring ◽  
Skew Cyclic Codes

scholarly journals Classification of chain rings

2021 ◽  
Vol 7 (4) ◽  
pp. 5106-5116
Author(s):  
Yousef Alkhamees ◽  
◽  
Sami Alabiad
Keyword(s):  
Artinian Ring ◽  
Chain Ring ◽  
A Chain

<abstract><p>An associative Artinian ring with an identity is a chain ring if its lattice of left (right) ideals forms a unique chain. In this article, we first prove that for every chain ring, there exists a certain finite commutative chain subring which characterizes it. Using this fact, we classify chain rings with invariants $ p, n, r, k, k', m $ up to isomorphism by finite commutative chain rings ($ k' = 1 $). Thus the classification of chain rings is reduced to that of finite commutative chain rings.</p></abstract>

scholarly journals The properties and parameters of generic Bose – Chaudhuri – Hocquenghem codes

2020 ◽  
Vol 56 (2) ◽  
pp. 157-165
Author(s):  
A. V. Kushnerov ◽  
V. A. Lipinski ◽  
M. N. Koroliova
Keyword(s):  
Error Correction ◽  
Cyclic Codes ◽  
Error Correcting Code ◽  
Error Correcting Codes ◽  
Bch Codes ◽  
Close Connection ◽  
Design Parameters ◽  
Polynomial Invariants ◽  
Accurate Evaluation

The Bose – Chaudhuri – Hocquenghem type of linear cyclic codes (BCH codes) is one of the most popular and widespread error-correcting codes. Their close connection with the theory of Galois fields gave an opportunity to create a theory of the norms of syndromes for BCH codes, namely, syndrome invariants of the G-orbits of errors, and to develop a theory of polynomial invariants of the G-orbits of errors. This theory as a whole served as the basis for the development of effective permutation polynomial-norm methods and error correction algorithms that significantly reduce the influence of the selector problem. To date, these methods represent the only approach to error correction with non-primitive BCH codes, the multiplicity of which goes beyond design boundaries. This work is dedicated to a special error-correcting code class – generic Bose – Chaudhuri – Hocquenghem codes or simply GBCH-codes. Sufficiently accurate evaluation of the quantity of such codes in each length was produced during our work. We have investigated some properties and connections between different GBCH-codes. Special attention was devoted to codes with constructive distances of 3 and 5, as those codes are usual for practical use. Their almost complete description is given in the range of lengths from 7 to 107. The paper contains a fairly clear theoretical classification of GBCH-codes. Special attention is paid to the corrective capabilities of the codes of this class, namely, to the calculation of the minimal distances of these codes with various parameters. The codes are found whose corrective capabilities significantly exceed those of the well-known GBCH-codes with the same design parameters.

On Cyclic and Negacyclic Codes of Length 8ps Over Fpm + uFpm

2020 ◽  
Vol 87 (3-4) ◽  
pp. 231
Author(s):  
Saroj Rani
Keyword(s):  
Positive Integer ◽  
Algebraic Structure ◽  
Cyclic Codes ◽  
Constacyclic Codes ◽  
Chain Ring ◽  
Negacyclic Codes

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>.

Quantum codes from cyclic codes over F3 + vF3

2014 ◽  
Vol 12 (06) ◽  
pp. 1450042 ◽  
Author(s):  
Mohammad Ashraf ◽  
Ghulam Mohammad
Keyword(s):  
Commutative Ring ◽  
Cyclic Code ◽  
Cyclic Codes ◽  
Quantum Codes ◽  
Quantum Code ◽  
Chain Ring ◽  
Arbitrary Length ◽  
Orthogonal Codes ◽  
Finite Commutative Ring ◽  
A Chain

Let R = F3 + vF3 be a finite commutative ring, where v2 = 1. It is a finite semi-local ring, not a chain ring. In this paper, we give a construction for quantum codes from cyclic codes over R. We derive self-orthogonal codes over F3 as Gray images of linear and cyclic codes over R. In particular, we use two codes associated with a cyclic code over R of arbitrary length to determine the parameters of the corresponding quantum code.

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 .  

Sign in / Sign up

Export Citation Format

Share Document