Skeleton simplicial evaluation codes (Q2249790): Difference between revisions

The authors present and study evaluation codes defined on subspace arrangements. The authors concentrate on subspace arrangements that are coordinate arrangements and binary codes. Hamming codes and punctured Reed-Muller codes are examples of these evaluation codes.

0 references

zbMATH Keywords

subspace arrangements

0 references

linear error-correcting codes

0 references

Stanley-Reisner rings

0 references

simplicial complexes

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Characteristic polynomials of subspace arrangements and finite fields

0 references

Q4324358

0 references

Z<sub>4</sub> -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets

0 references

Q4209232

0 references

Reed-Muller codes on complete intersections.

0 references

On the structure of order domains

0 references

Cayley-Bacharach and evaluation codes on complete intersections

0 references

Q4027640

0 references

Fundamentals of Error-Correcting Codes

0 references

Truncation formulas for invariant polynomials of matroids and geometric lattices

0 references

New codes for the Berlekamp-Massey-Sakata algorithm

0 references

MinT: A Database for Optimal Net Parameters

0 references

Combinatorics and commutative algebra.

0 references

Lower bounds on minimal distance of evaluation codes

0 references

On the De Boer-Pellikaan method for computing minimum distance

0 references

Q3997777

0 references

Identifiers

zbMATH Open document ID

1298.52029

0 references

DOI

10.1007/s10623-012-9793-0

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2249790

@@ Property / cites work @@
+Characteristic polynomials of subspace arrangements and finite fields
+Normal rank
@@ Property / cites work @@
+Q4324358
@@ Property / cites work: Q4324358 / rank @@
+Normal rank
@@ Property / cites work @@
+Z<sub>4</sub> -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
+Normal rank
@@ Property / cites work @@
+Q4209232
@@ Property / cites work: Q4209232 / rank @@
+Normal rank
@@ Property / cites work @@
+Reed-Muller codes on complete intersections.
@@ Property / cites work: Reed-Muller codes on complete intersections. / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of order domains
@@ Property / cites work: On the structure of order domains / rank @@
+Normal rank
@@ Property / cites work @@
+Cayley-Bacharach and evaluation codes on complete intersections
+Normal rank
@@ Property / cites work @@
+Q4027640
@@ Property / cites work: Q4027640 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of Error-Correcting Codes
@@ Property / cites work: Fundamentals of Error-Correcting Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Truncation formulas for invariant polynomials of matroids and geometric lattices
+Normal rank
@@ Property / cites work @@
+New codes for the Berlekamp-Massey-Sakata algorithm
+Normal rank
@@ Property / cites work @@
+MinT: A Database for Optimal Net Parameters
@@ Property / cites work: MinT: A Database for Optimal Net Parameters / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorics and commutative algebra.
@@ Property / cites work: Combinatorics and commutative algebra. / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on minimal distance of evaluation codes
+Normal rank
@@ Property / cites work @@
+On the De Boer-Pellikaan method for computing minimum distance
+Normal rank
@@ Property / cites work @@
+Q3997777
@@ Property / cites work: Q3997777 / rank @@
+Normal rank