English
Related papers

Related papers: Codes over a weighted torus

200 papers

The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…

Information Theory · Computer Science 2011-09-09 Natalia Silberstein

Projective Reed-Muller codes(PRM codes) are constructed from the family of projective hypersurfaces of a fixed degree over a finite field $\F_q$. In this paper, we completely determine the minimal distance of the hull of any Projective…

Information Theory · Computer Science 2024-10-11 Yufeng Song , Jinquan Luo

Let X* be a subset of an affine space A^s, over a finite field K, which is parameterized by the edges of a clutter. Let X and Y be the images of X* under the maps x --> [x] and x --> [(x,1)] respectively, where [x] and [(x,1)] are points in…

Commutative Algebra · Mathematics 2013-06-24 Maria Vaz Pinto , Rafael H. Villarreal

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 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

Projective Reed-Muller codes were introduced by Lachaud, in 1988 and their dimension and minimum distance were determined by Serre and S{\o}rensen in 1991. In coding theory one is also interested in the higher Hamming weights, to study the…

Information Theory · Computer Science 2017-01-09 Cícero Carvalho , Victor G. L. Neumann

Let K be a finite field and let X* be an affine algebraic toric set parameterized by monomials. We give an algebraic method, using Groebner bases, to compute the length and the dimension of C_X*(d), the parameterized affine code of degree d…

Commutative Algebra · Mathematics 2024-02-07 Hiram H. Lopez , Eliseo Sarmiento , Maria Vaz Pinto , Rafael H. Villarreal

In this paper, we construct a large family of projective linear codes over ${\mathbb F}_{q}$ from the general simplicial complexes of ${\mathbb F}_{q}^m$ via the defining-set construction, which generalizes the results of [IEEE Trans. Inf.…

Information Theory · Computer Science 2023-05-15 Zhao Hu , Yunge Xu , Nian Li , Xiangyong Zeng , Lisha Wang , Xiaohu Tang

We consider weighted Reed-Muller codes over point ensemble $S_1 \times...\times S_m$ where $S_i$ needs not be of the same size as $S_j$. For $m = 2$ we determine optimal weights and analyze in detail what is the impact of the ratio…

Information Theory · Computer Science 2011-09-01 Olav Geil , Casper Thomsen

We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…

Combinatorics · Mathematics 2016-04-26 Peter Beelen , Sudhir R. Ghorpade , Sartaj Ul Hasan

A projective Reed-Muller (PRM) code, obtained by modifying a (classical) Reed-Muller code with respect to a projective space, is a doubly extended Reed-Solomon code when the dimension of the related projective space is equal to 1. The…

Information Theory · Computer Science 2015-12-09 Norihiro Nakashima , Hajime Matsui

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…

Commutative Algebra · Mathematics 2015-01-12 Jorge Neves , Maria Vaz Pinto , Rafael H. Villarreal

Projective Reed-Muller codes are constructed from the family of projective hypersurfaces of a fixed degree over a finite field $\F_q$. We consider the relationship between projective Reed-Muller codes and their duals. We determine when…

Information Theory · Computer Science 2024-06-10 Nathan Kaplan , Jon-Lark Kim

A projective linear code over $\mathbb{F}_q$ is called $\Delta$-divisible if all weights of its codewords are divisible by $\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications…

Combinatorics · Mathematics 2019-12-24 Daniel Heinlein , Thomas Honold , Michael Kiermaier , Sascha Kurz , Alfred Wassermann

We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight…

Information Theory · Computer Science 2013-04-09 Stéphane Ballet , Robert Rolland

A fake weighted projective space X is a Q-factorial toric variety with Picard number one. As with weighted projective space, X comes equipped with a set of weights (\lambda_0,...,\lambda_n). We see how the singularities of…

Algebraic Geometry · Mathematics 2022-10-28 Alexander Kasprzyk

Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a…

Commutative Algebra · Mathematics 2019-10-23 Manuel Gonzalez-Sarabia , Jose Martínez-Bernal , Rafael H. Villarreal , Carlos E. Vivares

We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…

Information Theory · Computer Science 2017-03-08 John B. Little

A generator matrix of a linear code $\C$ over $\gf(q)$ is also a matrix of the same rank $k$ over any extension field $\gf(q^\ell)$ and generates a linear code of the same length, same dimension and same minimum distance over $\gf(q^\ell)$,…

Information Theory · Computer Science 2024-08-08 Cunsheng Ding , Zhonghua Sun , Qianqian Yan

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…

Information Theory · Computer Science 2020-10-26 Simon Eisenbarth , Sihuang Hu