Skeleton simplicial evaluation codes

DOI10.1007/S10623-012-9793-0MaRDI QIDQ2249790zbMATH OpenOpenAlexFDO

Authors James Berg, Max D. Wakefield

Publication date 3 July 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

simplicial complexesStanley-Reisner ringssubspace arrangementslinear error-correcting codes

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Combinatorial aspects of simplicial complexes (05E45) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Linear codes (general theory) (94B05)

Abstract: For a subspace arrangement over a finite field we study the evaluation code defined on the arrangement's set of points. The length of this code is given by the subspace arrangement's characteristic polynomial. For coordinate subspace arrangements, the dimension is bounded below by the face vector of the corresponding simplicial complex. The minimum distance is determined for coordinate subspace arrangements where the simplicial complex is a skeleton.

Recommendations

• Evaluation codes over a particular complete intersection
• Evaluation codes arising from some subsets of the projective space
• Evaluation codes along subsets of complete intersections
• Evaluation codes from an affine variety code perspective
• Evaluation codes from smooth quadric surfaces and twisted Segre varieties

Cites work

• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• scientific article; zbMATH DE number 125901 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 727439 (Why is no real title available?)
• Cayley-Bacharach and evaluation codes on complete intersections
• Characteristic polynomials of subspace arrangements and finite fields
• Combinatorics and commutative algebra.
• Fundamentals of Error-Correcting Codes
• Lower bounds on minimal distance of evaluation codes
• MinT: A Database for Optimal Net Parameters
• New codes for the Berlekamp-Massey-Sakata algorithm
• On the De Boer-Pellikaan method for computing minimum distance
• On the structure of order domains
• Reed-Muller codes on complete intersections.
• Truncation formulas for invariant polynomials of matroids and geometric lattices
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets

Describes a project that uses

Uses Software

• MinT
• SageMath

This page was built for publication: Skeleton simplicial evaluation codes

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