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

Small polygons and toric codes

We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a [36,19,12]-code over F_7 whose minimum distance 12 exceeds that of all previously known codes.Comment: 9 pages, 4 tables, 3 figure

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 $(q-1)^r-1$ for $r\geq 1$. 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 $(q-1)^2-1$. 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

Secret Sharing Schemes with Strong Multiplication and a Large Number of Players from Toric Varieties

This article consider Massey's construction for constructing linear secret sharing schemes from toric varieties over a finite field Fq with q elements. The number of players can be as large as (q − 1) r − 1 for r ≥ 1. The schemes have strong multiplication, such schemes can be utilized in the domain of multiparty computation. We present general methods to obtain 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 (q − 1) 2 − 1, we determine bounds for the reconstruction and privacy thresholds and conditions for strong multiplication using the cohomology and the intersection theory on toric surfaces