Projective nested Cartesian codes

DOI10.1007/S00574-016-0010-ZMaRDI QIDQ2399639zbMATH OpenOpenAlexFDO

Authors Victor G. L. Neumann, Cicero Carvalho, Hiram H. López

Publication date 24 August 2017

Published in Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.6819

affine codes Gröbner bases methods projective codes Reed-Muller type codes

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of

m a t h b b P^{n} (m a t h b b F_{q})

, and they may be seen as a generalization of the so-called projective Reed-Muller codes. We calculate the length and the dimension of such codes, a lower bound for the minimum distance and the exact minimum distance in a special case (which includes the projective Reed-Muller codes). At the end we show some relations between the parameters of these codes and those of the affine cartesian codes.

Review text

The present paper introduces a new family of linear error-correcting codes, the projective nested Cartesian codes and, using techniques of commutative algebra as Hilbert functions and Gröbner bases, studies their parameters. Projective Cartesian codes (respectively affine Cartesian codes) of order \(d\)\, over a finite field \(\mathbb{F}_q\)\, are the image of an evaluation map of the homogeneous polynomials of degree \(d\) of \(\mathbb{F}_q[X_0,\dots,X_n]\) (respectively polynomials of \(\mathbb{F}_q[X_1,\dots,X_n]\)\, of degree up to \(d\)) on the points of a subset \(\chi:=A_0\times \dots \times A_n\subseteq \mathbb{P}^n(\mathbb{F}_q)\) (respectively \(\chi:=A_1\times \dots \times A_n\subseteq \mathbb{A}^n(\mathbb{F}_q)\)), \(A_i\subseteq \mathbb{F}_q\). The projective Reed-Muller codes are projective Cartesian codes with \(A_i=\mathbb{F}_q,\, \forall i\). Section 2 gives the definition of projective nested Cartesian codes (projective Cartesian codes with additional conditions on the \(A_i\)), family including the projective Reed-Muller codes. Then formulas given the length and dimension of those codes are provided (Theorem 2.8). Section 3 deals with the minimum distance of projective nested Cartesian codes. Lemma 3.1 gives an upper bound for that distance and Theorem 3.8 shows that the bound is the true minimum distance when the \(A_i\)\, are a \textit{projective nested product of fields} (this is trivially the case for projective Reed-Muller codes). Finally Corollary 3.10 shows the relation between these last codes and affine Cartesian codes.

Recommendations

Cites work

Cited in

(20)

This page was built for publication: Projective nested Cartesian codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399639)