Error-Correcting Codes from Higher-Dimensional Varieties

Authors:
Søren Have Hansen
Affiliations:
Department of Mathematical Sciences, University of Aarhus, DK-8000, Aarhus C, Denmarkf1shave@imf.au.dkf1
Venue:
Finite Fields and Their Applications
Year:
2001

Citing 0
Cited 9

Scroll codes

Designs, Codes and Cryptography
Codes defined by forms of degree 2 on non-degenerate Hermitian varieties in $${\mathbb{P}^{4}(\mathbb{F}_q)}$$

Designs, Codes and Cryptography
Algebraic geometry codes from polyhedral divisors

Journal of Symbolic Computation
On the parameters of r-dimensional toric codes

Finite Fields and Their Applications
Error-correcting codes on projective bundles

Finite Fields and Their Applications
Toric complete intersection codes

Journal of Symbolic Computation
On the evaluation of multivariate polynomials over finite fields

Journal of Symbolic Computation
Evaluation codes from smooth quadric surfaces and twisted Segre varieties

Designs, Codes and Cryptography
A new family of locally correctable codes based on degree-lifted algebraic geometry codes

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we use intersection theory to develop methods for obtaining lower bounds on the parameters of algebraic geometric error-correcting codes constructed from varieties of arbitrary dimension. The methods are sufficiently general to encompass many of the codes previously constructed from higher-dimensional varieties, as well as those coming from curves. And still, the bounds obtained are usually as good as the ones previously known (at least of the same order of magnitude with respect to the size of the ground field). Several examples coming from Deligne-Lusztig varieties, complete intersections of Hermitian hyper-surfaces, and from ruled surfaces (or more generally, projective bundles over a curve) are given.