English
Related papers

Related papers: Consta-dihedral Codes over Finite Fields

200 papers

We introduce a finite difference and $q$-difference analogues of the Asymptotic Iteration Method of Ciftci, Hall, and Saad. We give necessary, and sufficient condition for the existence of a polynomial solution to a general linear…

Classical Analysis and ODEs · Mathematics 2020-07-13 Mourad E. H. Ismail , Nasser Saad

In this paper quadratic residue codes over the ring Fp + vFp are introduced in terms of their idempotent generators. The structure of these codes is studied and it is observed that these codes share similar properties with quadratic residue…

Information Theory · Computer Science 2016-02-25 Abidin Kaya , Bahattin Yildiz , İrfan Siap

We show that a necessary and sufficient condition for a cyclic code C over Z4 of odd length to be an LCD code is that C=(f(x)) where f is a self-reciprocal polynomial in Z4[X].

Rings and Algebras · Mathematics 2019-05-30 Seth Gannon , Hamid Kulosman

Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a…

Information Theory · Computer Science 2026-02-05 Miguel Sales-Cabrera , Xaro Soler-Escrivà , Víctor Sotomayor

We use symplectic self-dual additive codes over $\mathbb{F}_4$ obtained from metacirculant graphs to construct, for the first time, $[[\ell, 0, d ]]$ qubit codes with parameters $(\ell,d) \in \{(78, 20), (90, 21), (91, 22),…

Information Theory · Computer Science 2021-05-27 Padmapani Seneviratne , Martianus Frederic Ezerman

Ben-Sasson, Goldreich and Sudan showed that a binary error correcting code admitting a $2$-query tester cannot be good, i.e., it cannot have both linear distance and positive rate. The same holds when the alphabet is a finite field…

Computational Complexity · Computer Science 2025-12-19 Uriya First , Stav Lazarovici

In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and…

Information Theory · Computer Science 2017-05-03 Xiusheng Liu , Yun Fan , Hualu Liu

There is a rich connection between classical error-correcting codes, Euclidean lattices, and chiral conformal field theories. Here we show that quantum error-correcting codes, those of the stabilizer type, are related to Lorentzian lattices…

High Energy Physics - Theory · Physics 2021-06-24 Anatoly Dymarsky , Alfred Shapere

New asymptotic upper bounds are presented on the rate of sequences of locally repairable codes (LRCs) with a prescribed relative minimum distance and locality over a finite field $F$. The bounds apply to LRCs in which the recovery functions…

Information Theory · Computer Science 2020-10-28 Ron M. Roth

In this paper we study the asymptotic behavior of solutions of fractional differential equations of the form $ D^{\alpha}_Cu(t)=Au(t)+f(t), u(0)=x, 0<\alpha\le1, ( *) $ where $D^{\alpha}_Cu(t)$ is the derivative of the function $u$ in the…

Classical Analysis and ODEs · Mathematics 2025-09-05 Vu Trong Luong , Nguyen Duc Huy , Nguyen Van Minh , Nguyen Ngoc Vien

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed $q$, our results can produce more classes of MDS…

Information Theory · Computer Science 2018-07-30 Khawla Labad , Honwei Liu , Jinquan Luo

In this paper, we prove the exact asymptotic behavior of singular positive solutions of fractional semi-linear equations $$(-\Delta)^\sigma u = u^p~~~~~~~~in ~~ B_1\backslash \{0\}$$ with an isolated singularity, where $\sigma \in (0, 1)$…

Analysis of PDEs · Mathematics 2018-05-11 Hui Yang , Wenming Zou

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}[u]/\langle u^4\rangle)$ and $n$ is an odd positive integer. For any $\delta,\alpha\in \mathbb{F}_{2^m}^{\times}$, ideals of the ring $R[x]/\langle…

Information Theory · Computer Science 2016-09-21 Yonglin Cao , Yuan Cao

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to…

Information Theory · Computer Science 2026-03-09 Kanat Abdukhalikov , Gyanendra K. Verma

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…

Information Theory · Computer Science 2024-02-05 Stefka Bouyuklieva

Let $\alpha$ and $\beta$ be irrational real numbers and $0<\F<1/30$. We prove a precise estimate for the number of positive integers $q\leq Q$ that satisfy $\|q\alpha\|\cdot\|q\beta\|<\F$. If we choose $\F$ as a function of $Q$ we get…

Number Theory · Mathematics 2016-03-22 Martin Widmer

The freedom one has in constructing locally gauge invariant charged fields in gauge theories is analyzed in full detail and exploited to construct, in QED, an electron field whose two-point function W(p), up to the fourth order in the…

High Energy Physics - Theory · Physics 2009-10-31 E. d'Emilio , S. Micciche

MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…

Information Theory · Computer Science 2022-08-30 Ruhao Wan , Shixin Zhu , Jin Li

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

Information Theory · Computer Science 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

We give a new construction of nonlinear error-correcting codes over suitable finite fields k from the geometry of modular curves with many rational points over k, combining two recent improvements on Goppa's construction. The resulting…

Number Theory · Mathematics 2007-07-16 Noam D. Elkies