$${\mathbb {F}}_{q^{2}}$$-double cyclic codes with respect to the Hermitian inner product

2022 ◽  
Author(s):  
Ismail Aydogdu ◽  
Taher Abualrub ◽  
Karim Samei
Keyword(s):  
Cyclic Codes ◽  
Inner Product ◽  
Hermitian Inner Product

scholarly journals An explicit construction of quantum codes from one-generator generalized quasi-cyclic codes

2021 ◽  
Vol 336 ◽  
pp. 04001
Author(s):  
Yu Yao ◽  
Yuena Ma ◽  
Husheng Li ◽  
Jingjie Lv
Keyword(s):  
Cyclic Codes ◽  
Explicit Construction ◽  
Error Correcting Codes ◽  
Inner Product ◽  
Quantum Codes ◽  
Dual Codes ◽  
Index 2 ◽  
Quantum Error ◽  
Hermitian Inner Product ◽  
Quasi Cyclic Codes

In this paper, we take advantage of a class of one-generator generalized quasi-cyclic (GQC) codes of index 2 to construct quantum error-correcting codes. By studying the form of Hermitian dual codes and their algebraic structure, we propose a sufficient condition for self-orthogonality of GQC codes with Hermitian inner product. By comparison, the quantum codes we constructed have better parameters than known codes.

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.

scholarly journals An algorithmic approach to entanglement-assisted quantum error-correcting codes from the Hermitian curve

2022 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
René B. Christensen ◽  
Carlos Munuera ◽  
Francisco R. F. Pereira ◽  
Diego Ruano
Keyword(s):  
Unknown Parameter ◽  
Error Correcting Codes ◽  
Field Size ◽  
Inner Product ◽  
Hermitian Curve ◽  
Algorithmic Approach ◽  
Entangled Quantum States ◽  
Quantum Error ◽  
Hermitian Inner Product ◽  
Ag Code

<p style='text-indent:20px;'>We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown parameter is <inline-formula><tex-math id="M1">\begin{document}$ c $\end{document}</tex-math></inline-formula>, the number of required maximally entangled quantum states since the Hermitian dual of an AG code is unknown. In this article, we present an efficient algorithmic approach for computing <inline-formula><tex-math id="M2">\begin{document}$ c $\end{document}</tex-math></inline-formula> for this family of EAQECCs. As a result, this algorithm allows us to provide EAQECCs with excellent parameters over any field size.</p>

scholarly journals EMBEDDINGS OF COMPLEX LINE SYSTEMS AND FINITE REFLECTION GROUPS

2008 ◽  
Vol 85 (2) ◽  
pp. 211-228 ◽  
Author(s):  
MURALEEDARAN KRISHNASAMY ◽  
D. E. TAYLOR
Keyword(s):  
Infinite Family ◽  
Inner Product ◽  
Reflection Groups ◽  
Complex Reflection ◽  
Closed Sets ◽  
Complex Reflection Groups ◽  
Least Eigenvalue ◽  
Third Line ◽  
Hermitian Inner Product

AbstractA star is a planar set of three lines through a common point in which the angle between each pair is 60∘. A set of lines through a point in which the angle between each pair of lines is 60 or 90∘ is star-closed if for every pair of its lines at 60∘ the set contains the third line of the star. In 1976 Cameron, Goethals, Seidel and Shult showed that the indecomposable star-closed sets in Euclidean space are the root systems of types An, Dn, E6, E7 and E8. This result was a key part of their determination of all graphs with least eigenvalue −2. Subsequently, Cvetković, Rowlinson and Simić determined all star-closed extensions of these line systems. We generalize this result on extensions of line systems to complex n-space equipped with a hermitian inner product. There is one further infinite family, and two exceptional types arising from Burkhardt and Mitchell’s complex reflection groups in dimensions five and six. The proof is a geometric version of Mitchell’s classification of complex reflection groups in dimensions greater than four.

scholarly journals Construction of Dual Cyclic Codes over {F}_{2}[u,v]/ for DNA Computation

2018 ◽  
Vol 68 (5) ◽  
pp. 467-472
Author(s):  
Manoj Kumar Singh ◽  
Abhay Kumar Singh ◽  
Narendra Kumar ◽  
Pooja Mishra ◽  
Indivar Gupta
Keyword(s):  
Cyclic Codes ◽  
Gc Content ◽  
Inner Product ◽  
Dual Codes ◽  
Dna Computation ◽  
Dna Codes ◽  
Reverse Complement

Here, we assume the construction of cyclic codes over ℜ={F}_{2}[u,v]/ < u^2, v^2 - v, uv - vu >. In particular, dual cyclic codes over ℜ= {F}_{2}[u]/ <u^2> with respect to Euclidean inner product are discussed. The cyclic dual codes over ℜ are studied with respect to DNA codes (reverse and reverse complement). Many interesting results are obtained. Some examples are also provided, which explain the main results. The GC-Content and DNA codes over ℜ are discussed. We summarise the article by giving a special DNA table.

Sign in / Sign up

Export Citation Format

Share Document