English
Related papers

Related papers: All minimal $[9,4]_{2}$-codes are hyperbolic quadr…

200 papers

The hull of a linear code $C$ is the intersection of $C$ with its dual code. We present and analyze the number of linear $q$-ary codes of the same length and dimension but with different dimensions for their hulls. We prove that for given…

Information Theory · Computer Science 2025-07-28 Stefka Bouyuklieva , Iliya Bouyukliev , Ferruh Özbudak

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

Combinatorics · Mathematics 2026-03-31 Tim Alderson , Simeon Ball

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

In this article, We introduce a condition that is both necessary and sufficient for a linear code to achieve minimality when analyzed over the rings $\mathbb{Z}_{n}$.The fundamental inquiry in minimal linear codes is the existence of a…

Information Theory · Computer Science 2025-11-24 Biplab Chatterjee , Ratnesh Kumar Mishra

In this paper, we study and characterise certain blocking sets in generalised polygons. This will allow us to derive new results about the minimum weight and minimum weight code words in the code generated by the rows of the incidence…

Combinatorics · Mathematics 2025-11-12 Sebastian Petit , Geertrui Van de Voorde

For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

We give a combinatorial characterization of the family of lines of P G(3, q) which meet a hyperbolic quadric in two points (the so called secant lines) using their intersection properties with the points and planes of PG(3,q).

Combinatorics · Mathematics 2024-09-06 Puspendu Pradhan , Bikramaditya Sahu

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

Hermitian linear complementary dual codes are linear codes whose intersection with their Hermitian dual code is trivial. The largest minimum weight among quaternary Hermitian linear complementary dual codes of dimension $2$ is known for…

Combinatorics · Mathematics 2020-04-21 Keita Ishizuka

An irreducible ordinary character of a finite reductive group is called quadratic unipotent if it corresponds under Jordan decomposition to a semisimple element $s$ in a dual group such that $s^2=1$. We prove that there is a bijection…

Representation Theory · Mathematics 2013-04-22 Bhama Srinivasan

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

We show that extended cyclic codes over $\mathbb{F}_q$ with parameters $[q+2,3,q]$, $q=2^m$, determine regular hyperovals. We also show that extended cyclic codes with parameters $[qt-q+t,3,qt-q]$, $1<t<q$, determine (cyclic) Denniston…

Combinatorics · Mathematics 2021-05-04 Kanat Abdukhalikov , Duy Ho

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é

We study the classification of minimal codewords of projective Reed-Muller codes of order $2$. This problem is equivalent to identifying quadrics over finite fields whose set of rational points is maximal with respect to the inclusion. We…

Information Theory · Computer Science 2026-04-21 Alain Couvreur , Rati Ludhani

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-01-18 Hai Liu , Chengju Li , Cunsheng Ding

Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…

Information Theory · Computer Science 2023-05-24 Yun Li , Hongwei Liu , Sihem Mesnager

Let $M_{q}(k)$ be the maximum length of MDS codes with parameters $q,k$. In this paper, the properties of $M_{q}(k)$ are studied, and some new upper bounds of $M_{q}(k)$ are obtained. Especially we obtain that $M_{q}(q-1)\leq…

Combinatorics · Mathematics 2009-04-28 Jiansheng Yang , Yunying Zhang

We study the functional codes $C_2(X)$ defined on projective varieties $X$, in the case where $X\subset \mathbb{P}^3$ is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We find the minimum distance of these…

Algebraic Geometry · Mathematics 2007-05-23 Frederic A. B. Edoukou

In this article we construct new minimal intersection sets in ${\mathrm{AG}}(r,q^2)$ sporting three intersection numbers with hyperplanes; we then use these sets to obtain linear error correcting codes with few weights, whose weight…

Combinatorics · Mathematics 2017-03-23 Angela Aguglia , Luca Giuzzi

Linear codes with complementary duals (LCD) have a great deal of significance amongst linear codes. Maximum distance separable (MDS) codes are also an important class of linear codes since they achieve the greatest error correcting and…

Information Theory · Computer Science 2019-09-17 Mehmet E. Koroglu , Mustafa Sarı
‹ Prev 1 4 5 6 7 8 10 Next ›