English
Related papers

Related papers: Multispreads

200 papers

Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…

Information Theory · Computer Science 2015-12-24 Qiuyan Wang , Fei Li , Dongdai Lin

In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.

Combinatorics · Mathematics 2022-10-04 Manuel Gonzalez Sarabia , Rafael H. Villarreal

We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum rank, the covering radius, and the field size. The focus of…

Information Theory · Computer Science 2023-12-12 Anina Gruica , Altan B. Kilic , Alberto Ravagnani

Extended $1$-perfect codes in the Hamming scheme $H(n,q)$ can be equivalently defined as codes that turn to $1$-perfect codes after puncturing in any coordinate, as completely regular codes with certain intersection array, as uniformly…

Combinatorics · Mathematics 2024-08-30 Evgeny A. Bespalov , Denis S. Krotov

Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…

Combinatorics · Mathematics 2016-08-19 Masaaki Harada , Sho Suda

Multivariate generalized Pareto distributions arise as the limit distributions of exceedances over multivariate thresholds of random vectors in the domain of attraction of a max-stable distribution. These distributions can be parametrized…

Statistics Theory · Mathematics 2017-05-24 Holger Rootzén , Johan Segers , Jennifer L. Wadsworth

In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…

Information Theory · Computer Science 2025-09-24 Régis Blache , Emmanuel Hallouin

We consider binary liquid mixtures near their critical consolute points and exposed to geometrically flat but chemically structured substrates. The chemical contrast between the various substrate structures amounts to opposite local…

Soft Condensed Matter · Physics 2009-11-11 Monika Sprenger , Frank Schlesener , S. Dietrich

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

We provide a characterisation of $(n-1)$-spreads in $\mathrm{PG}(rn-1,q)$ that have $r$ normal elements in general position. In the same way, we obtain a geometric characterisation of Desarguesian $(n-1)$-spreads in $\mathrm{PG}(rn-1,q)$,…

Combinatorics · Mathematics 2017-03-09 Sara Rottey , John Sheekey

We describe first-degree prime ideals of biquadratic extensions in terms of first-degree prime ideals of two underlying quadratic fields. The identification of the prime divisors is given by numerical conditions involving their ideal norms.…

Number Theory · Mathematics 2021-12-22 Giordano Santilli , Daniele Taufer

In this paper, we tie together two well studied topics related to finite Desarguesian affine and projective planes. The first topic concerns directions determined by a set, or even a multiset, of points in an affine plane. The second topic…

Combinatorics · Mathematics 2026-01-28 Sam Adriaensen , Tamás Szőnyi , Zsuzsa Weiner

Hyperovals in $\PG(2,\gf(q))$ with even $q$ are maximal arcs and an interesting research topic in finite geometries and combinatorics. Hyperovals in $\PG(2,\gf(q))$ are equivalent to $[q+2,3,q]$ MDS codes over $\gf(q)$, called hyperoval…

Information Theory · Computer Science 2018-04-18 Ziling Heng , Cunsheng Ding

A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…

Information Theory · Computer Science 2016-09-26 Gerardo Vega

In this paper, we introduce a additive Tridiagonal and Double-Tridiagonal codes over $\mathbb{F}_4$ and then we study the properties of the code. Also, we find the number of additive Tridiagonal codes over $\mathbb{F}_4.$ Finally, we study…

Information Theory · Computer Science 2021-04-13 N. Annamalai , Anandhu Mohan , C. Durairajan

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

Number Theory · Mathematics 2022-11-29 Petr Kucheriaviy

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

Number Theory · Mathematics 2023-02-23 Valentin Blomer , Lasse Grimmelt , Junxian Li , Simon L. Rydin Myerson

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

We employ analytic number theoretic techniques, specifically character sums and Weil type estimates, to study the covering radius of the generalized Zetterberg codes over all finite fields. Although the even and odd field cases require…

Number Theory · Mathematics 2025-10-30 Haode Yan , Maosheng Xiong

This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-08-18 Keren Censor-Hillel , Erez Kantor , Nancy Lynch , Merav Parter