2,718 research outputs found
Secret Sharing Schemes with a large number of players from Toric Varieties
A general theory for constructing linear secret sharing schemes over a finite
field \Fq from toric varieties is introduced. The number of players can be as
large as for . We present general methods for obtaining
the reconstruction and privacy thresholds as well as conditions for
multiplication on the associated secret sharing schemes.
In particular we apply the method on certain toric surfaces. The main results
are ideal linear secret sharing schemes where the number of players can be as
large as . We determine bounds for the reconstruction and privacy
thresholds and conditions for strong multiplication using the cohomology and
the intersection theory on toric surfaces.Comment: 15 pages, 4 figures. arXiv admin note: text overlap with
arXiv:1203.454
Quantum Codes from Toric Surfaces
A theory for constructing quantum error correcting codes from Toric surfaces
by the Calderbank-Shor-Steane method is presented. In particular we study the
method on toric Hirzebruch surfaces. The results are obtained by constructing a
dualizing differential form for the toric surface and by using the cohomology
and the intersection theory of toric varieties. In earlier work the author
developed methods to construct linear error correcting codes from toric
varieties and derive the code parameters using the cohomology and the
intersection theory on toric varieties. This method is generalized in section
to construct linear codes suitable for constructing quantum codes by the
Calderbank-Shor-Steane method. Essential for the theory is the existence and
the application of a dualizing differential form on the toric surface. A.R.
Calderbank, P.W. Shor and A.M. Steane produced stabilizer codes from linear
codes containing their dual codes. These two constructions are merged to obtain
results for toric surfaces. Similar merging has been done for algebraic curves
with different methods by A. Ashikhmin, S. Litsyn and M.A. Tsfasman.Comment: IEEE copyrigh
Lattice polytopes in coding theory
In this paper we discuss combinatorial questions about lattice polytopes
motivated by recent results on minimum distance estimation for toric codes. We
also prove a new inductive bound for the minimum distance of generalized toric
codes. As an application, we give new formulas for the minimum distance of
generalized toric codes for special lattice point configurations.Comment: 11 pages, 3 figure
On the structure of generalized toric codes
Toric codes are obtained by evaluating rational functions of a nonsingular
toric variety at the algebraic torus. One can extend toric codes to the so
called generalized toric codes. This extension consists on evaluating elements
of an arbitrary polynomial algebra at the algebraic torus instead of a linear
combination of monomials whose exponents are rational points of a convex
polytope. We study their multicyclic and metric structure, and we use them to
express their dual and to estimate their minimum distance
Local Decoders for the 2D and 4D Toric Code
We analyze the performance of decoders for the 2D and 4D toric code which are
local by construction. The 2D decoder is a cellular automaton decoder
formulated by Harrington which explicitly has a finite speed of communication
and computation. For a model of independent and errors and faulty
syndrome measurements with identical probability we report a threshold of
for this Harrington decoder. We implement a decoder for the 4D toric
code which is based on a decoder by Hastings arXiv:1312.2546 . Incorporating a
method for handling faulty syndromes we estimate a threshold of for
the same noise model as in the 2D case. We compare the performance of this
decoder with a decoder based on a 4D version of Toom's cellular automaton rule
as well as the decoding method suggested by Dennis et al.
arXiv:quant-ph/0110143 .Comment: 22 pages, 21 figures; fixed typos, updated Figures 6,7,8,
- …