Symbol-Pair Distances of Repeated-Root Negacyclic Codes of Length 2s over Galois Rings

2021 ◽  
Vol 28 (04) ◽  
pp. 581-600
Author(s):  
Hai Q. Dinh ◽  
Hualu Liu ◽  
Roengchai Tansuchat ◽  
Thang M. Vo
Keyword(s):  
Finite Field ◽  
Galois Ring ◽  
Maximum Distance ◽  
Galois Rings ◽  
Constacyclic Codes ◽  
Chain Ring ◽  
Negacyclic Codes ◽  
Singleton Bound ◽  
Maximum Distance Separable ◽  
Special Case

Negacyclic codes of length [Formula: see text] over the Galois ring [Formula: see text] are linearly ordered under set-theoretic inclusion, i.e., they are the ideals [Formula: see text], [Formula: see text], of the chain ring [Formula: see text]. This structure is used to obtain the symbol-pair distances of all such negacyclic codes. Among others, for the special case when the alphabet is the finite field [Formula: see text] (i.e., [Formula: see text]), the symbol-pair distance distribution of constacyclic codes over [Formula: see text] verifies the Singleton bound for such symbol-pair codes, and provides all maximum distance separable symbol-pair constacyclic codes of length [Formula: see text] over [Formula: see text].

Optimal b-symbol constacyclic codes with respect to the Singleton bound

2019 ◽  
Vol 19 (08) ◽  
pp. 2050151 ◽  
Author(s):  
Hai Q. Dinh ◽  
Xiaoqiang Wang ◽  
Jirakom Sirisrisakulchai
Keyword(s):  
Finite Field ◽  
Cyclic Codes ◽  
Maximum Distance ◽  
Constacyclic Codes ◽  
Singleton Bound ◽  
Maximum Distance Separable

Let [Formula: see text] be the finite field of order [Formula: see text], where [Formula: see text] is a power of odd prime [Formula: see text]. Assume that [Formula: see text], [Formula: see text] are nonzero elements of the finite field [Formula: see text] such that [Formula: see text]. In this paper, we determine the [Formula: see text]-distance of [Formula: see text]-constacyclic codes with generator polynomials [Formula: see text] of length [Formula: see text], where [Formula: see text] and [Formula: see text]. As an application, all maximum distance separable (MDS) [Formula: see text]-symbol constacyclic codes of length [Formula: see text] over [Formula: see text] are established. Among other results, we construct several classes of new MDS symbol-pair codes with minimum symbol-pair distance six or seven by using repeated-root cyclic codes of length [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is an odd prime.

Symbol-triple distance of repeated-root constacyclic codes of prime power lengths

2019 ◽  
Vol 19 (11) ◽  
pp. 2050209 ◽  
Author(s):  
Hai Q Dinh ◽  
Sampurna Satpati ◽  
Abhay Kumar Singh ◽  
Woraphon Yamaka
Keyword(s):  
Prime Power ◽  
Nonzero Element ◽  
Maximum Distance ◽  
Constacyclic Codes ◽  
Chain Ring ◽  
Maximum Distance Separable ◽  
Positive Integers

Let [Formula: see text] be an odd prime, [Formula: see text] and [Formula: see text] be positive integers and [Formula: see text] be a nonzero element of [Formula: see text]. The [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] are linearly ordered under set theoretic inclusion as ideals of the chain ring [Formula: see text]. Using this structure, the symbol-triple distances of all such [Formula: see text]-constacyclic codes are established in this paper. All maximum distance separable symbol-triple constacyclic codes of length [Formula: see text] are also determined as an application.

scholarly journals Normal Bases on Galois Ring Extensions

Symmetry ◽  
2018 ◽  
Vol 10 (12) ◽  
pp. 702
Author(s):  
Aixian Zhang ◽  
Keqin Feng
Keyword(s):  
Signal Processing ◽  
Finite Field ◽  
Block Cipher ◽  
Field Extension ◽  
Galois Ring ◽  
Normal Basis ◽  
Galois Rings ◽  
Ring Extension ◽  
Galois Fields ◽  
Normal Bases

Normal bases are widely used in applications of Galois fields and Galois rings in areas such as coding, encryption symmetric algorithms (block cipher), signal processing, and so on. In this paper, we study the normal bases for Galois ring extension R / Z p r , where R = GR ( p r , n ) . We present a criterion on the normal basis for R / Z p r and reduce this problem to one of finite field extension R ¯ / Z ¯ p r = F q / F p ( q = p n ) by Theorem 1. We determine all optimal normal bases for Galois ring extension.

scholarly journals New quantum codes from skew constacyclic codes

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Ram Krishna Verma ◽  
Om Prakash ◽  
Ashutosh Singh ◽  
Habibul Islam
Keyword(s):  
Finite Field ◽  
Gray Map ◽  
Quantum Codes ◽  
Constacyclic Codes ◽  
Dual Codes ◽  
Chain Ring ◽  
Css Construction ◽  
Positive Integers

<p style='text-indent:20px;'>For an odd prime <inline-formula><tex-math id="M1">\begin{document}$ p $\end{document}</tex-math></inline-formula> and positive integers <inline-formula><tex-math id="M2">\begin{document}$ m $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M3">\begin{document}$ \ell $\end{document}</tex-math></inline-formula>, let <inline-formula><tex-math id="M4">\begin{document}$ \mathbb{F}_{p^m} $\end{document}</tex-math></inline-formula> be the finite field with <inline-formula><tex-math id="M5">\begin{document}$ p^{m} $\end{document}</tex-math></inline-formula> elements and <inline-formula><tex-math id="M6">\begin{document}$ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $\end{document}</tex-math></inline-formula>. Thus <inline-formula><tex-math id="M7">\begin{document}$ R_{\ell,m} $\end{document}</tex-math></inline-formula> is a finite commutative non-chain ring of order <inline-formula><tex-math id="M8">\begin{document}$ p^{2^{\ell} m} $\end{document}</tex-math></inline-formula> with characteristic <inline-formula><tex-math id="M9">\begin{document}$ p $\end{document}</tex-math></inline-formula>. In this paper, we aim to construct quantum codes from skew constacyclic codes over <inline-formula><tex-math id="M10">\begin{document}$ R_{\ell,m} $\end{document}</tex-math></inline-formula>. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.</p>

Negacyclic codes of prime power length over the finite non-commutative chain ring 𝔽pm[u,𝜃] 〈u2〉

2021 ◽  
pp. 2150091
Author(s):  
Teeramet Inchaisri ◽  
Jirayu Phuto ◽  
Chakkrid Klin-Eam
Keyword(s):  
Algebraic Structure ◽  
Prime Power ◽  
Nonzero Element ◽  
Dual Code ◽  
Constacyclic Codes ◽  
Chain Ring ◽  
Negacyclic Codes ◽  
Ring Isomorphism ◽  
One To One ◽  
Negacyclic Code

In this paper, we focus on the algebraic structure of left negacyclic codes of length [Formula: see text] over the finite non-commutative chain ring [Formula: see text] where [Formula: see text] is an automorphism on [Formula: see text]. After that, the number of codewords of all left negacyclic codes is obtained. For each left negacyclic code, we also obtain the structure of its right dual code. In the remaining result, the number of distinct left negacyclic codes is given. Finally, a one-to-one correspondence between left negacyclic and left [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] is constructed via ring isomorphism, which carries over the results regarding left negacyclic codes corresponding to left [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] where [Formula: see text] is a nonzero element of the field [Formula: see text] such that [Formula: see text].

Structure of repeated-root constacyclic codes of length 8ℓmpn

2019 ◽  
Vol 12 (04) ◽  
pp. 1950050
Author(s):  
Saroj Rani
Keyword(s):  
Finite Field ◽  
Linear Codes ◽  
Important Class ◽  
Constacyclic Codes ◽  
Dual Codes ◽  
Negacyclic Codes ◽  
Positive Integers

Constacyclic codes form an important class of linear codes which is remarkable generalization of cyclic and negacyclic codes. In this paper, we assume that [Formula: see text] is the finite field of order [Formula: see text] where [Formula: see text] is a power of the prime [Formula: see text] and [Formula: see text] are distinct odd primes, and [Formula: see text] are positive integers. We determine generator polynomials of all constacyclic codes of length [Formula: see text] over the finite field [Formula: see text] We also determine their dual codes.

scholarly journals On subsystem codes beating the quantum Hamming or Singleton bound

2007 ◽  
Vol 463 (2087) ◽  
pp. 2887-2905 ◽  
Author(s):  
Andreas Klappenecker ◽  
Pradeep Kiran Sarvepalli
Keyword(s):  
The Other ◽  
Maximum Distance ◽  
Open Problems ◽  
Prime Field ◽  
Stabilizer Codes ◽  
Singleton Bound ◽  
Other Hand ◽  
Maximum Distance Separable ◽  
Linear Subsystem ◽  
Stabilizer Code

Subsystem codes are a generalization of noiseless subsystems, decoherence-free subspaces and stabilizer codes. We generalize the quantum Singleton bound to q -linear subsystem codes. It follows that no subsystem code over a prime field can beat the quantum Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the quantum Hamming bound. A number of open problems concern the comparison in the performance of stabilizer and subsystem codes. One of the open problems suggested by Poulin's work asks whether a subsystem code can use fewer syndrome measurements than an optimal q -linear maximum distance separable stabilizer code while encoding the same number of qudits and having the same distance. We prove that linear subsystem codes cannot offer such an improvement under complete decoding.

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

Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pm

2018 ◽  
Vol 17 (09) ◽  
pp. 1850173 ◽  
Author(s):  
Hai Q. Dinh ◽  
Anuradha Sharma ◽  
Saroj Rani ◽  
Songsak Sriboonchitta
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Algebraic Structures ◽  
Chain Ring ◽  
Negacyclic Codes

Let [Formula: see text] be the finite field of order [Formula: see text] where [Formula: see text] is an odd prime and [Formula: see text] is a positive integer. In this paper, we determine the algebraic structures of all cyclic and negacyclic codes of length [Formula: see text] over the finite commutative chain ring [Formula: see text] where [Formula: see text] and [Formula: see text] is a positive integer. We also obtain the number of codewords in each of these codes. Among others, we establish the duals of all such codes and derive some self-dual cyclic and negacyclic codes of length [Formula: see text] over [Formula: see text]

Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)

2018 ◽  
Vol 10 (03) ◽  
pp. 1850036 ◽  
Author(s):  
Anuradha Sharma ◽  
Tania Sidana
Keyword(s):  
Positive Integer ◽  
Galois Ring ◽  
Constacyclic Codes ◽  
Dual Codes ◽  
Negacyclic Codes

Let [Formula: see text] be a prime, [Formula: see text] be a positive integer, and let GR[Formula: see text] be the Galois ring of characteristic [Formula: see text] and cardinality [Formula: see text]. In this paper, all repeated-root constacyclic codes of arbitrary lengths over GR[Formula: see text] their sizes and their dual codes are determined. As an application, some isodual constacyclic codes over GR[Formula: see text] are also listed. To illustrate the results, all cyclic and negacyclic codes of length 10 over [Formula: see text] are obtained.

Sign in / Sign up

Export Citation Format

Share Document