83 research outputs found
(2,1)-separating systems beyond the probabilistic bound
Building on previous results of Xing, we give new lower bounds on the rate of
intersecting codes over large alphabets. The proof is constructive, and uses
algebraic geometry, although nothing beyond the basic theory of linear systems
on curves. Then, using these new bounds within a concatenation argument, we
construct binary (2,1)-separating systems of asymptotic rate exceeding the one
given by the probabilistic method, which was the best lower bound available up
to now. This answers (negatively) the question of whether this probabilistic
bound was exact, which has remained open for more than 30 years. (By the way,
we also give a formulation of the separation property in terms of metric
convexity, which may be an inspirational source for new research problems.)Comment: Version 7 is a shortened version, so that numbering should match with
the journal version (to appear soon). Material on convexity and separation in
discrete and continuous spaces has been removed. Readers interested in this
material should consult version 6 instea
On asymptotically good ramp secret sharing schemes
Asymptotically good sequences of linear ramp secret sharing schemes have been
intensively studied by Cramer et al. in terms of sequences of pairs of nested
algebraic geometric codes. In those works the focus is on full privacy and full
reconstruction. In this paper we analyze additional parameters describing the
asymptotic behavior of partial information leakage and possibly also partial
reconstruction giving a more complete picture of the access structure for
sequences of linear ramp secret sharing schemes. Our study involves a detailed
treatment of the (relative) generalized Hamming weights of the considered
codes
On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
We give some general results concerning the computation of the generalized
Feng-Rao numbers of numerical semigroups. In the case of a numerical semigroup
generated by an interval, a formula for the Feng-Rao number is
obtained.Comment: 23 pages, 6 figure
Applications of Algebraic Coding Theory to Cryptography
Whether it is online commerce, international relations, or simply through email communication, the encryption and decryption of data is essential to the inner workings of everyday life. To encrypt and decrypt efficiently, it is important that there is some structure behind the process rather than just a random procedure. The purpose of this research is to analyze different encryption schemes and their structure, with a focus on schemes that apply algebraic coding theory to cryptography. Cryptosystems based in algebraic coding theory are particularly important to the future of cryptography, as they are resistant to attacks by quantum computers, unlike many currently employed cryptosystems. Specifically, we examine the McEliece cryptosystem and its variations, in particular the use of Reed-Solomon codes. The goal is to understand the algebraic structure underlying the McEliece cryptosystem as well as to understand its shortcomings and variations that may strengthen it. The current results show that the original Goppa codes that are used in the McEliece systems are stronger and more secure than the proposed Reed-Solomon code alternative
Asymptotically good binary linear codes with asymptotically good self-intersection spans
If C is a binary linear code, let C^2 be the linear code spanned by
intersections of pairs of codewords of C. We construct an asymptotically good
family of binary linear codes such that, for C ranging in this family, the C^2
also form an asymptotically good family. For this we use algebraic-geometry
codes, concatenation, and a fair amount of bilinear algebra.
More precisely, the two main ingredients used in our construction are, first,
a description of the symmetric square of an odd degree extension field in terms
only of field operations of small degree, and second, a recent result of
Garcia-Stichtenoth-Bassa-Beelen on the number of points of curves on such an
odd degree extension field.Comment: 18 pages; v2->v3: expanded introduction and bibliography + various
minor change
- …