English
Related papers

Related papers: Suzuki-invariant codes from the Suzuki curve

200 papers

The dual of the Kasami code of length $q^2-1$, with $q$ a power of $2$, is constructed by concatenating a cyclic MDS code of length $q+1$ over $F_q$ with a Simplex code of length $q-1$. This yields a new derivation of the weight…

Information Theory · Computer Science 2023-06-28 Minjia Shi , Denis Krotov , Patrick Solé

In this work, we study a class of skew cyclic codes over the ring $R:=\mathbb{Z}_4+v\mathbb{Z}_4,$ where $v^2=v,$ with an automorphism $\theta$ and a derivation $\Delta_\theta,$ namely codes as modules over a skew polynomial ring…

Information Theory · Computer Science 2024-01-25 Djoko Suprijanto , Hopein Christofen Tang

For a finite group $G$ and a positive integer $n$, let $G(n)$ be the set of all elements in $G$ such that $x^{n}=1$. The groups $G$ and $H$ are said to be of the same (order) type if $G(n)=H(n)$, for all $n$. The main aim of this paper is…

Group Theory · Mathematics 2016-06-02 Seyed Hassan Alavi , Ashraf Daneshkhah , Hosein Parvizi Mosaed

We look at AG codes associated to the projective line, re-examining the problem of determining their automorphism groups (originally investigated by Duer in 1987 using combinatorial techniques) using recent methods from algebraic geometry.…

Algebraic Geometry · Mathematics 2008-01-28 David Joyner , Amy Ksir , Will Traves

The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$. Such a code is…

Combinatorics · Mathematics 2026-03-03 Tao Feng , Henk D. L. Hollmann , Weicong Li , Qing Xiang

Let K be an algebraically closed field of characteristic 2, and let X be a curve over K of genus g>1 and 2-rank r>0. For 2-subgroups S of the K-automorphism group Aut(X) of X, the Nakajima bound is |S| < 4g-3. For every g=2^h+1>8, we…

Algebraic Geometry · Mathematics 2011-04-28 Massimo Giulietti , Gabor Korchmaros

We classify the automorphisms of the (chiral) level-k affine SU(3) fusion rules, for any value of k, by looking for all permutations that commute with the modular matrices S and T. This can be done by using the arithmetic of the cyclotomic…

High Energy Physics - Theory · Physics 2010-11-01 Philippe Ruelle

Let $R=\mathbb{Z}_4$ be the integer ring mod $4$. A double cyclic code of length $(r,s)$ over $R$ is a set that can be partitioned into two parts that any cyclic shift of the coordinates of both parts leaves invariant the code. These codes…

Information Theory · Computer Science 2015-01-08 Jian Gao , Minjia Shi , Tingting Wu , Fang-Wei Fu

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

It is well known that every closed Riemann surface $S$ of genus $g \geq 2$, admitting a group $G$ of conformal automorphisms so that $S/G$ has triangular signature, can be defined over a finite extension of ${\mathbb Q}$. It is interesting…

Algebraic Geometry · Mathematics 2017-12-11 Rubén A. Hidalgo , Leslie Jiménez , Saúl Quispe , Sebastián Reyes-Carocca

The Reed-Muller codes are a family of error-correcting codes that have been widely studied in coding theory. In 2020, Wei Yan and Sian-Jheng Lin introduced a variant of Reed-Muller codes so called symmetric Reed-Muller codes. We investigate…

Information Theory · Computer Science 2024-01-23 Sibel Kurt Toplu , Talha Arikan , Pinar AydoğDu , OğUz Yayla

We construct a ternary [49,25,7] code from the row span of a Jacobsthal matrix. It is equivalent to a Generalized Quadratic Residue (GQR) code in the sense of van Lint and MacWilliams (1978). These codes are the abelian generalizations of…

Information Theory · Computer Science 2024-07-24 Minjia Shi , Ruowen Liu , Patrick Solé

Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $\theta : \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with skew constacyclic codes, that is, linear codes of $\mathbb{F}_q^n$…

Information Theory · Computer Science 2018-06-11 Alexis E. Almendras Valdebenito , Andrea Luigi Tironi

In this paper, we construct a special family of cyclic codes, known as quadratic residue codes of prime length \( p \equiv \pm 1 \pmod{44} ,\) \( p \equiv \pm 5 \pmod{44} ,\) \( p \equiv \pm 7 \pmod{44} ,\) \( p \equiv \pm 9 \pmod{44} \)…

Information Theory · Computer Science 2026-03-27 Tapas Chatterjee , Priya Jain

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…

Combinatorics · Mathematics 2009-03-23 Rolf Bienert , Benjamin Klopsch

We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…

Information Theory · Computer Science 2021-02-22 Whan-Hyuk Choi , Jon-Lark Kim

In this paper, we investigate two-point Algebraic Geometry codes associated to the Skabelund maximal curve constructed as a cyclic cover of the Suzuki curve. In order to estimate the minimum distance of such codes, we make use of the…

Algebraic Geometry · Mathematics 2024-01-17 Leonardo Landi , Marco Timpanella , Lara Vicino

For a natural number $m$, let $\mathcal{S}_m/\mathbb{F}_2$ be the $m$th Suzuki curve. We study the mod $2$ Dieudonn\'{e} module of $\mathcal{S}_m$, which gives the equivalent information as the Ekedahl-Oort type or the structure of the…

Number Theory · Mathematics 2018-06-08 Beth Malmskog , Rachel Pries , Colin Weir

We study geometric monodromy groups $G_{\geo,\sF_q}$ of the local systems $\sF_q$ on the affine line over $\F_2$ of rank $D=\sqrt{q}(q-1)$, $q=2^{2n+1}$, constructed in \cite{Ka-ERS}. The main result of the paper shows that $G_{\geo,\sF_q}$…

Algebraic Geometry · Mathematics 2023-05-12 L. Alpoge , N. M. Katz , G. Navarro , E. A. O'Brien , P. H. Tiep

We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived…

Information Theory · Computer Science 2007-11-14 Kenza Guenda