English
Related papers

Related papers: Linear codes arising from the point-hyperplane geo…

200 papers

Let $\bar{\Gamma}$ be the point-hyperplane geometry of a projective space $\mathrm{PG(V)},$ where $V$ is a $(n+1)$-dimensional vector space over a finite field $\mathbb{F}_q$ of order $q.$ Suppose that $\sigma$ is an automorphism of…

Combinatorics · Mathematics 2026-04-17 Ilaria Cardinali , Luca Giuzzi

Let ${\mathcal C}(\Omega)$ be the linear code arising from a projective system $\Omega$ of $\mathrm{PG}(V).$ Consider the point-line geometry $\Gamma=({\mathcal P},{\mathcal L})$ and a projective embedding $\varepsilon\colon…

Combinatorics · Mathematics 2026-05-06 Ilaria Cardinali , Luca Giuzzi

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

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

The {\it linear representation} of a subset of a finite projective space is an incidence system of affine points and lines determined by the subset. In this paper we use character theory to show that the rank of the incidence matrix has a…

Combinatorics · Mathematics 2020-01-30 Peter Sin , Julien Sorci , Qing Xiang

We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…

Information Theory · Computer Science 2026-03-05 Antonio Jesús Lorite López , Daniel Camazón Portela , Juan Antonio López Ramos

Segre-Veronese manifolds are smooth submanifolds of tensors comprising the partially symmetric rank-1 tensors. We investigate a one-parameter family of warped geometries of Segre-Veronese manifolds, which includes the standard Euclidean…

Numerical Analysis · Mathematics 2026-01-27 Simon Jacobsson , Lars Swijsen , Joeri Van der Veken , Nick Vannieuwenhoven

An $\mathbb{F}_q$- linear set $L=L_U$ of $\Lambda=\mathrm{PG}(V, \mathbb{F}_{q^n}) \cong \mathrm{PG}(r-1,q^n)$ is a set of points defined by non-zero vectors of an $\mathbb{F}_q$-subspace $U$ of $V$. The integer $\dim_{\mathbb{F}_q} U$ is…

Combinatorics · Mathematics 2024-05-03 Giovanni Giuseppe Grimaldi , Somi Gupta , Giovanni Longobardi , Rocco Trombetti

Hyperplanes and hyperplane complements in the Segre product of partial linear spaces are investigated . The parallelism of such a complement is characterized in terms of the point-line incidence. Assumptions, under which the automorphisms…

Combinatorics · Mathematics 2014-10-31 K. Petelczyc , M. Żynel

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Information Theory · Computer Science 2023-12-25 Peter Beelen , Trygve Johnsen , Prasant Singh

We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.

Combinatorics · Mathematics 2023-01-19 Romar dela Cruz , Michael Kiermaier , Sascha Kurz , Alfred Wassermann

Over the past few years, the codes $\mathcal{C}_{n-1}(n,q)$ arising from the incidence of points and hyperplanes in the projective space $\text{PG}(n,q)$ attracted a lot of attention. In particular, small weight codewords of…

Combinatorics · Mathematics 2022-12-23 Daniele Bartoli , Lins Denaux

We describe the syzygy spaces for the Segre embedding $\mathbb{P}(U)\times\mathbb{P}(V)\subset\mathbb{P}(U\otimes V)$ in terms of representations of ${\rm GL}(U)\times {\rm GL}(V)$ and construct the minimal resolutions of the sheaves…

Algebraic Geometry · Mathematics 2019-09-04 Igor V. Netay

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…

Information Theory · Computer Science 2017-04-10 Shudi Yang , Xiangli Kong , Chunming Tang

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

Algebraic Geometry · Mathematics 2009-03-31 Sudhir R. Ghorpade , Arunkumar R. Patil , Harish K. Pillai

Let $G$ be a reductive linear algebraic group. The simplest example of a projective homogeneous $G$-variety in characteristic $p$, not isomorphic to a flag variety, is the divisor $x_0 y_0^p+x_1 y_1^p+x_2 y_2^p=0$ in $P^2\times P^2$, which…

alg-geom · Mathematics 2008-02-03 Niels Lauritzen

In this paper, we study the p-ary linear code C(PG(n, q)), q = p^h, p prime, h >= 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small…

Combinatorics · Mathematics 2012-01-17 Michel Lavrauw , Leo Storme , Geertrui Van de Voorde

A classical result due to Segre states that on a real cubic surface in ${\mathbb P}^3_\R$ there exists two kinds of real lines: elliptic and hyperbolic lines. These two kinds of real lines are defined in an intrinsic way, i.e., their…

Algebraic Geometry · Mathematics 2012-02-24 Christian Okonek , Andrei Teleman

In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal…

Information Theory · Computer Science 2016-11-17 Pascal O. Vontobel , Roxana Smarandache , Negar Kiyavash , Jason Teutsch , Dejan Vukobratovic

The problem of error-control in random linear network coding is considered. A ``noncoherent'' or ``channel oblivious'' model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer…

Information Theory · Computer Science 2008-03-25 Ralf Koetter , Frank Kschischang
‹ Prev 1 2 3 10 Next ›