English
Related papers

Related papers: Some $3$-designs invariant under $2.P{\Sigma}L(2,4…

200 papers

Let $\mathcal{G}=\mathrm{Spec}(A)$ be a finite and flat group scheme over the ring of algebraic integers $R$ of a number field $K$ and suppose that the generic fiber of $\mathcal{G}$ is the constant group scheme over $K$ for a finite group…

Number Theory · Mathematics 2025-09-08 Philippe Cassou-Noguès , Martin J. Taylor

We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…

Combinatorics · Mathematics 2018-04-10 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one…

Information Theory · Computer Science 2017-04-06 Alexander Zhdanov

In this article, we investigate $2$-$(v,k,\lambda)$ designs with $\gcd(r,\lambda)=1$ admitting flag-transitive automorphism groups $G$. We prove that if $G$ is an almost simple group, then such a design belongs to one of the seven infinite…

Group Theory · Mathematics 2020-08-11 Seyed Hassan Alavi , Ashraf Daneshkhah , Fatemeh Mouseli

Using the method for constructing binary self-dual codes with an automorphism of order square of a prime number we have classified all binary self-dual codes with length 76 having minimum distance $d=14$ and automorphism of order 9. Up to…

Combinatorics · Mathematics 2018-06-15 Nikolay Yankov , Radka Russeva , Emine Karatash

Bivariate bicycle codes are promising candidates for high-threshold, low-overhead fault-tolerant quantum memories. Meanwhile, color codes are the most prominent self-dual CSS codes, supporting transversal Clifford gates that have been…

Quantum Physics · Physics 2026-01-13 Zijian Liang , Yu-An Chen

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

Information Theory · Computer Science 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes,…

Information Theory · Computer Science 2018-07-25 Serhii Dyshko

A generator matrix of a linear code $\C$ over $\gf(q)$ is also a matrix of the same rank $k$ over any extension field $\gf(q^\ell)$ and generates a linear code of the same length, same dimension and same minimum distance over $\gf(q^\ell)$,…

Information Theory · Computer Science 2024-08-08 Cunsheng Ding , Zhonghua Sun , Qianqian Yan

Let $r,s,t$ be three positive integers and $\mathcal{C}$ be a binary linear code of lenght $r+s+t$. We say that $\mathcal{C}$ is a triple cyclic code of lenght $(r,s,t)$ over $\mathbb{Z}_2$ if the set of coordinates can be partitioned into…

Information Theory · Computer Science 2015-09-18 Hojjat Mostafanasab

In this paper, we construct three ternary linear codes associated with the orthogonal group O^-(2,q) and the special orthogonal groups SO^-(2,q) and SO^-(4,q). Here q is a power of three. Then we obtain recursive formulas for the power…

Number Theory · Mathematics 2009-09-07 Dae San Kim

This paper investigates block-transitive automorphism groups of t-(k^2,k,\lambda) designs. Let D be a non-trivial t-(k^2,k,\lambda) design, G \leq \Aut(D) be block-transitive with X\unlhd G\leq \Aut(X), where X = PSL(2,q)(q\geq4). Then q =…

Group Theory · Mathematics 2025-08-28 Guoqiang Xiong , Haiyan Guan

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

Klein's simple group $H$ of order $168$ is the automorphism group of the plane quartic curve $C$, called Klein quartic. By Torelli Theorem, the full automorphism group $G$ of the Jacobian $J=J(C)$ is the group of order $336$, obtained by…

Algebraic Geometry · Mathematics 2022-01-25 Dimitri Markushevich , Anne Moreau

We reveal an intriguing connection between the set of 27 (disregarding the identity) invertible symmetric 3 x 3 matrices over GF(2) and the points of the generalized quadrangle GQ(2,4). The 15 matrices with eigenvalue one correspond to a…

Algebraic Geometry · Mathematics 2012-10-01 Andrea Blunck , Peter Levay , Metod Saniga , Peter Vrana

The $\mathbb{Z}_{2^s}$-additive codes are subgroups of $\mathbb{Z}^n_{2^s}$, and can be seen as a generalization of linear codes over $\mathbb{Z}_2$ and $\mathbb{Z}_4$. A $\mathbb{Z}_{2^s}$-linear Hadamard code is a binary Hadamard code…

Information Theory · Computer Science 2018-01-17 Cristina Fernández-Córdoba , Carlos Vela , Mercè Villanueva

Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of…

Group Theory · Mathematics 2017-12-19 E. A. O'Brien , Petr Vojtěchovský

In this paper, we resolve a conjecture of Green and Liebeck [Disc. Math., 343 (8):117119, 2019] on codes in $PGL(2,q)$. To be specific, we show that: if $D$ is a dihedral subgroup of order $2(q+1)$ in $G=PGL(2,q)$, and $A=\{g\in G: g^{q+1}=…

Combinatorics · Mathematics 2020-09-03 Tao Feng , Weicong Li , Jingkun Zhou

This article is a continuation of our recent work (Yin Chen and Runxuan Zhang, Shape enumerators of self-dual NRT codes over finite fields. SIAM J. Discrete Math. 38 (2024), no. 4, 2841-2854) in the setting of quantum error-correcting…

Information Theory · Computer Science 2026-01-28 Yin Chen , Shan Ren , Runxuan Zhang

We give constructions of self-dual and formally self-dual codes from group rings where the ring is a finite commutative Frobenius ring. We improve the existing construction given in \cite{Hurley1} by showing that one of the conditions given…

Information Theory · Computer Science 2016-04-28 Steven T. Dougherty , Joe Gildea , Rhian Taylor , Alexander Tylyshchak