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

zbMATH Keywords

Reed-Muller type codesprojective codesaffine codesGröbner bases methods

Mathematics Subject Classification ID

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 $mathbb{P}^n(mathbb{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.

Recommendations

• Affine Cartesian codes
• Generalized minimum distance functions
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• On the next-to-minimal weight of affine Cartesian codes
• Generalized Hamming weights of affine Cartesian codes

Cites work

• Affine Cartesian codes
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Decoding affine variety codes using Gröbner bases
• Evaluation codes from smooth quadric surfaces and twisted Segre varieties
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• On low weight codewords of generalized affine and projective Reed-Muller codes
• On the second Hamming weight of some Reed-Muller type codes
• Projective Reed-Muller codes
• Projective Reed-Muller type codes on rational normal scrolls
• Reed-Muller codes on complete intersections.
• Reed-Muller-type codes over the Segre variety
• Reed‐muller codes: an ideal theory approach
• The parameters of projective Reed-Müller codes
• Weighted Reed-Muller codes revisited

Cited in

(18)

• Coding theory package for Macaulay2
• Batch codes from affine Cartesian codes and quotient spaces
• Direct products in projective Segre codes
• A glimpse to most of the old and new results on very well-covered graphs from the viewpoint of commutative algebra
• Saturation and vanishing ideals
• Vanishing ideals of projective spaces over finite fields and a projective footprint bound
• Symbolic powers of monomial ideals and Cohen-Macaulay vertex-weighted digraphs
• Unmixedness of some weighted oriented graphs
• Generalized minimum distance functions
• Betti numbers of weighted oriented graphs
• Monomial ideals of weighted oriented graphs
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Evaluation codes and their basic parameters
• Affine Cartesian codes
• Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
• Affine Cartesian codes with complementary duals
• Projective Reed-Muller type codes on higher dimensional scrolls
• Edge ideals of oriented graphs

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)