Skeleton simplicial evaluation codes

DOI10.1007/S10623-012-9793-0zbMATH Open1298.52029arXiv1112.0283OpenAlexW2002576531MaRDI QIDQ2249790FDOQ2249790

Authors: James Berg, Max D. Wakefield 

Publication date: 3 July 2014

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

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.

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

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

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)

Cites Work

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

Uses Software

• SageMath
• MinT

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)