19,065 research outputs found
A new method for constructing small-bias spaces from Hermitian codes
We propose a new method for constructing small-bias spaces through a
combination of Hermitian codes. For a class of parameters our multisets are
much faster to construct than what can be achieved by use of the traditional
algebraic geometric code construction. So, if speed is important, our
construction is competitive with all other known constructions in that region.
And if speed is not a matter of interest the small-bias spaces of the present
paper still perform better than the ones related to norm-trace codes reported
in [12]
Higher Hamming weights for locally recoverable codes on algebraic curves
We study the locally recoverable codes on algebraic curves. In the first part
of this article, we provide a bound of generalized Hamming weight of these
codes. Whereas in the second part, we propose a new family of algebraic
geometric LRC codes, that are LRC codes from Norm-Trace curve. Finally, using
some properties of Hermitian codes, we improve the bounds of distance proposed
in [1] for some Hermitian LRC codes.
[1] A. Barg, I. Tamo, and S. Vlladut. Locally recoverable codes on algebraic
curves. arXiv preprint arXiv:1501.04904, 2015
An Introduction to Algebraic Geometry codes
We present an introduction to the theory of algebraic geometry codes.
Starting from evaluation codes and codes from order and weight functions,
special attention is given to one-point codes and, in particular, to the family
of Castle codes
Abstract algebra, projective geometry and time encoding of quantum information
Algebraic geometrical concepts are playing an increasing role in quantum
applications such as coding, cryptography, tomography and computing. We point
out here the prominent role played by Galois fields viewed as cyclotomic
extensions of the integers modulo a prime characteristic . They can be used
to generate efficient cyclic encoding, for transmitting secrete quantum keys,
for quantum state recovery and for error correction in quantum computing.
Finite projective planes and their generalization are the geometric counterpart
to cyclotomic concepts, their coordinatization involves Galois fields, and they
have been used repetitively for enciphering and coding. Finally the characters
over Galois fields are fundamental for generating complete sets of mutually
unbiased bases, a generic concept of quantum information processing and quantum
entanglement. Gauss sums over Galois fields ensure minimum uncertainty under
such protocols. Some Galois rings which are cyclotomic extensions of the
integers modulo 4 are also becoming fashionable for their role in time encoding
and mutual unbiasedness.Comment: To appear in R. Buccheri, A.C. Elitzur and M. Saniga (eds.),
"Endophysics, Time, Quantum and the Subjective," World Scientific, Singapore.
16 page
On products and powers of linear codes under componentwise multiplication
In this text we develop the formalism of products and powers of linear codes
under componentwise multiplication. As an expanded version of the author's talk
at AGCT-14, focus is put mostly on basic properties and descriptive statements
that could otherwise probably not fit in a regular research paper. On the other
hand, more advanced results and applications are only quickly mentioned with
references to the literature. We also point out a few open problems.
Our presentation alternates between two points of view, which the theory
intertwines in an essential way: that of combinatorial coding, and that of
algebraic geometry.
In appendices that can be read independently, we investigate topics in
multilinear algebra over finite fields, notably we establish a criterion for a
symmetric multilinear map to admit a symmetric algorithm, or equivalently, for
a symmetric tensor to decompose as a sum of elementary symmetric tensors.Comment: 75 pages; expanded version of a talk at AGCT-14 (Luminy), to appear
in vol. 637 of Contemporary Math., AMS, Apr. 2015; v3: minor typos corrected
in the final "open questions" sectio
Toward computing gravitational initial data without elliptic solvers
Two new methods have been proposed for solving the gravitational constraints
without using elliptic solvers by formulating them as either an
algebraic-hyperbolic or parabolic-hyperbolic system. Here, we compare these two
methods and present a unified computational infrastructure for their
implementation as numerical evolution codes. An important potential application
of these methods is the prescription of initial data for the simulation of
black holes. This paper is meant to support progress and activity in that
direction.Comment: Title and presentation change
Subquadratic time encodable codes beating the Gilbert-Varshamov bound
We construct explicit algebraic geometry codes built from the
Garcia-Stichtenoth function field tower beating the Gilbert-Varshamov bound for
alphabet sizes at least 192. Messages are identied with functions in certain
Riemann-Roch spaces associated with divisors supported on multiple places.
Encoding amounts to evaluating these functions at degree one places. By
exploiting algebraic structures particular to the Garcia-Stichtenoth tower, we
devise an intricate deterministic \omega/2 < 1.19 runtime exponent encoding and
1+\omega/2 < 2.19 expected runtime exponent randomized (unique and list)
decoding algorithms. Here \omega < 2.373 is the matrix multiplication exponent.
If \omega = 2, as widely believed, the encoding and decoding runtimes are
respectively nearly linear and nearly quadratic. Prior to this work, encoding
(resp. decoding) time of code families beating the Gilbert-Varshamov bound were
quadratic (resp. cubic) or worse
- …