English
Related papers

Related papers: Codes arising from incidence matrices of points an…

200 papers

Determining the weight distributions of the projective Reed-Muller codes is a very hard problem and has been studied extensively in the literature. In this article, we provide an alternative proof of the second weight of the projective…

Algebraic Geometry · Mathematics 2025-02-20 Mrinmoy Datta

In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…

Information Theory · Computer Science 2007-07-13 Roxana Smarandache , Marcel Wauer

We study the small weight codewords of the functional code C_2(Q), with Q a non-singular quadric of PG(N,q). We prove that the small weight codewords correspond to the intersections of Q with the singular quadrics of PG(N,q) consisting of…

Algebraic Geometry · Mathematics 2009-01-28 Frédéric Edoukou , Anja Hallez , François Rodier , Leo Storme

Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…

Information Theory · Computer Science 2017-07-25 Ziling Heng , Qin Yue

Let A be the incidence matrix of passant lines and internal points with respect to a conic in PG(2, q), where q is an odd prime power. In this article, we study both geometric and algebraic properties of the column null space L of A over…

Combinatorics · Mathematics 2016-11-25 Adonus L. Madison , Junhua Wu

Let $\A$ be the incidence matrix of lines and points of the classical projective plane $PG(2,q)$ with $q$ odd. With respect to a conic in $PG(2,q)$, the matrix $\A$ is partitioned into 9 submatrices. The rank of each of these submatices…

Combinatorics · Mathematics 2010-02-08 Junhua Wu

We determine the Smith normal forms of the incidence matrices of points and projective (r-1)-dimensional subspaces of PG(n,q) and of the incidence matrices of points and r-dimensional affine subspaces of AG(n,q) for all n, r, and arbitrary…

Combinatorics · Mathematics 2020-01-30 David B. Chandler , Peter Sin , Qing Xiang

In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…

Combinatorics · Mathematics 2020-03-06 Mustafa Gezek , Rudi Mathon , Vladimir D. Tonchev

In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown-up at its rational points. The LDPC codes given by these incidence matrices are studied. These sparse incidence…

Information Theory · Computer Science 2015-03-14 Alain Couvreur

Let $\Gamma_{n,q}$ be the point-hyperplane incidence graph of the projective space $\operatorname{PG}(n,q)$, where $n \ge 2$ is an integer and $q$ a prime power. We determine the order of magnitude of $1-i_V(\Gamma_{n,q})$, where…

Combinatorics · Mathematics 2020-02-18 Andrew Elvey Price , Muhammad Adib Surani , Sanming Zhou

We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or…

Information Theory · Computer Science 2012-05-28 Gladys Chalom , Raul Antônio Ferraz , Marinês Guerreiro , César Polcino Milies

An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective linear codes. Let m_r(2,q) denote the maximal number n of…

Combinatorics · Mathematics 2019-07-19 Michael Braun

Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set.…

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

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

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Information Theory · Computer Science 2020-12-02 P. G. Boyvalenkov , K. V. Delchev , D. V. Zinoviev , V. A. Zinoviev

We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…

Combinatorics · Mathematics 2023-05-23 Michael Kiermaier , Sascha Kurz

The elementary divisors of the incidence matrix of lines in PG(3,q) are computed, where two lines are incident if and only if they are skew.

Combinatorics · Mathematics 2011-10-07 Andries E. Brouwer , Joshua E. Ducey , Peter Sin

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…

Information Theory · Computer Science 2016-05-12 Ziling Heng , Qin Yue

Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…

Information Theory · Computer Science 2024-12-17 Giacomo Micheli , Vincenzo Pallozzi Lavorante , Phillip Waitkevich

Linear codes with few weights have been a significant area of research in coding theory for many years, due to their applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. Inspired by…

Information Theory · Computer Science 2025-10-30 Mrinal Kanti Bose , Abhay Kumar Singh