pith. sign in

arxiv: 1112.0283 · v1 · pith:N3GNWU67new · submitted 2011-12-01 · 🧮 math.CO · math.AC

Skeleton Simplicial Evaluation Codes

classification 🧮 math.CO math.AC
keywords subspacearrangementsimplicialarrangementscodecomplexcoordinateevaluation
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.