English
Related papers

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

200 papers

A partial $(k-1)$-spread in $\operatorname{PG}(n-1,q)$ is a collection of $(k-1)$-dimensional subspaces with trivial intersection, i.e., each point is covered at most once. So far the maximum size of a partial $(k-1)$-spread in…

Combinatorics · Mathematics 2016-11-03 Sascha Kurz

We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap…

Information Theory · Computer Science 2017-03-20 Trygve Johnsen , Hugues Verdure

This note offers a probabilistic proof of Girard's angle excess formula for the area of a spherical triangle, based on the observation that an unbounded 3-dimensional convex cone, with single vertex at the origin, has only three kinds of…

History and Overview · Mathematics 2019-09-11 Daniel A. Klain

We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…

Combinatorics · Mathematics 2017-10-24 Relinde Jurrius

We revisit and extend the connections between $\mathbb{F}_{q^m}$-linear rank-metric codes and evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We give a unifying framework in which we prove in an elementary way how the parameters…

Combinatorics · Mathematics 2022-04-26 Giuseppe Marino , Alessandro Neri , Rocco Trombetti

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

In each of the three projective planes coordinatised by the Knuth's binary semifield $\mathbb{K}_n$ of order $2^n$ and two of its Knuth derivatives, we exhibit a new family of infinitely many translation hyperovals. In particular, when…

Combinatorics · Mathematics 2016-05-23 Nicola Durante , Rocco Trombetti , Yue Zhou

It is well-known that few-weight linear codes have better applications in secret sharing schemes \cite{JY2006,CC2005}.In particular, projective two-weight codes are very precious as they are closely related to finite projective spaces,…

Information Theory · Computer Science 2022-11-10 Canze Zhu , Qunying Liao

In this paper we demonstrate the first example of a finite translation plane which does not contain a translation hyperoval, disproving a conjecture of Cherowitzo. The counterexample is a semifield plane, specifically a Generalised Twisted…

Combinatorics · Mathematics 2023-09-06 Kevin Allen , John Sheekey

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

Combinatorics · Mathematics 2017-12-06 Daniel Heinlein , Sascha Kurz

We define and explicitly construct schemes evinced by generalized additive decompositions (GADs) of a given $d$-homogeneous polynomial $F$. We employ GADs to investigate the regularity of $0$-dimensional schemes apolar to $F$, focusing on…

Commutative Algebra · Mathematics 2024-07-08 Alessandra Bernardi , Alessandro Oneto , Daniele Taufer

Let PG$(r, q)$ be the $r$-dimensional projective space over the finite field ${\rm GF}(q)$. A set $\cal X$ of points of PG$(r, q)$ is a cutting blocking set if for each hyperplane $\Pi$ of PG$(r, q)$ the set $\Pi \cap \cal X$ spans $\Pi$.…

Combinatorics · Mathematics 2020-11-24 Daniele Bartoli , Antonio Cossidente , Giuseppe Marino , Francesco Pavese

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…

Information Theory · Computer Science 2013-07-09 Jian Gao , Fang-Wei Fu , Linzhi Shen

This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction.…

Information Theory · Computer Science 2024-11-12 Chaofeng Guan , Jingjie Lv , Gaojun Luo , Zhi Ma

Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be…

Information Theory · Computer Science 2024-05-27 Boris Ryabko

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

Combinatorics · Mathematics 2010-01-26 Thomas Zaslavsky

We develop three approaches of combinatorial flavour to study the structure of minimal codes and cutting blocking sets in finite geometry, each of which has a particular application. The first approach uses techniques from algebraic…

Combinatorics · Mathematics 2020-12-03 Gianira N. Alfarano , Martino Borello , Alessandro Neri , Alberto Ravagnani

It is shown that the structure of the generalized quadrangle of order two is fully encoded in the properties of the Desargues configuration. A point of the quadrangle is represented by a geometric hyperplane of the Desargues configuration…

Combinatorics · Mathematics 2011-01-06 Metod Saniga

In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space…

Combinatorics · Mathematics 2018-12-17 Thomas Honold , Michael Kiermaier , Sascha Kurz

We introduce a generalization of classical $q$-ary codes by allowing points to cover other points that are Hamming distance $1$ or $2$ in a freely chosen subset of all directions. More specifically, we generalize the notion of $1$-covering,…

Combinatorics · Mathematics 2018-02-01 Mehtaab Sawhney , David Stoner