English
Related papers

Related papers: Generalized ovals, 2.5-dimensional additive codes,…

200 papers

Consider a $q$-ary block code satisfying the property that no $l$-letters long codeword's prefix occurs as a suffix of any codeword for $l$ inside some interval. We determine a general upper bound on the maximum size of these codes and a…

Information Theory · Computer Science 2025-06-04 Lidija Stanovnik

We introduce and explore a new concept of evasive subspace with respect to a collection of subspaces sharing a common dimension, most notably partial spreads. We show that this concept generalises known notions of subspace scatteredness and…

Combinatorics · Mathematics 2023-10-17 Anina Gruica , Alberto Ravagnani , John Sheekey , Ferdinando Zullo

Recently a construction of optimal non-constant dimension subspace codes, also termed projective space codes, has been reported in a paper of Honold-Kiermaier-Kurz. Restricted to binary codes in a 5-dimensional ambient space with minimum…

Information Theory · Computer Science 2017-01-26 Anirban Ghatak

Generalized $t$-designs, which form a common generalization of objects such as $t$-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of $t$-designs, \emph{Discrete Math.}\ {\bf 309}…

Combinatorics · Mathematics 2011-11-17 Robert F. Bailey , Andrea C. Burgess

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…

Combinatorics · Mathematics 2018-10-01 Daniel Heinlein , Sascha Kurz

The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…

Combinatorics · Mathematics 2025-09-19 Angela Aguglia , Luca Giuzzi , Giovanni Longobardi , Viola Siconolfi

Blocking semiovals and the determination of their (minimum) sizes constitute one of the central research topics in finite projective geometry. In this article we introduce the concept of blocking set with the $r_\infty$-property in a finite…

Combinatorics · Mathematics 2025-07-31 Marilena Crupi , Antonino Ficarra

The exploration of linear subspaces, particularly scattered subspaces, has garnered considerable attention across diverse mathematical disciplines in recent years, notably within finite geometries and coding theory. Scattered subspaces play…

Combinatorics · Mathematics 2024-05-16 Daniele Bartoli , Alessandro Giannoni , Giuseppe Marino

In this note, we give a construction of codes on algebraic function field $F/ \mathbb{F}_{q}$ using places of $F$ (not necessarily of degree one) and trace functions from various extensions of $\mathbb{F}_{q}$. This is a generalization of…

Information Theory · Computer Science 2021-04-15 Nupur Patanker , Sanjay Kumar Singh

Recently, subfiled codes of linear code over GF$ (q) $ with good parameters were studied, and many optimal subfield codes were obtained. In this paper, Our mainly motivation is to generlize the results of the subfield codes of hyperoval in…

Information Theory · Computer Science 2022-11-02 Xiaoqiong Ran , Rong Luo

One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…

Information Theory · Computer Science 2021-03-19 Xianmang He , Yindong Chen , Zusheng Zhang , Kunxiao Zhou

We support some evidence that a long additive MDS code over a finite field must be equivalent to a linear code. More precisely, let $C$ be an $\mathbb F_q$-linear $(n,q^{hk},n-k+1)_{q^h}$ MDS code over $\mathbb F_{q^h}$. If $k=3$, $h \in…

Information Theory · Computer Science 2026-01-28 Sam Adriaensen , Simeon Ball

We consider Abelian topological quantum field theories (TQFTs) in 3d and show that gaugings of invertible global symmetries naturally give rise to additive codes. These codes emerge as nonanomalous subgroups of the 1-form symmetry group,…

High Energy Physics - Theory · Physics 2025-04-23 Ahmed Barbar , Anatoly Dymarsky , Alfred D. Shapere

The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance…

Information Theory · Computer Science 2010-11-04 Olav Geil , Carlos Munuera , Diego Ruano , Fernando Torres

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

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…

Information Theory · Computer Science 2017-01-05 Nuh Aydin , Ajdin Halilovic

Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…

Information Theory · Computer Science 2021-03-26 Ziling Heng , Dexiang Li , Jiao Du , Fuling Chen

Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…

Combinatorics · Mathematics 2020-03-03 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero…

Information Theory · Computer Science 2025-07-30 François Arnault , Philippe Gaborit , Nicolas Saussay

Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to…

Information Theory · Computer Science 2009-11-11 Lars Eirik Danielsen