Algebraic geometric codes with applications
From MaRDI portal
Publication:1956522
DOI10.1007/s11464-007-0001-xzbMath1197.94227MaRDI QIDQ1956522
Publication date: 22 September 2010
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-007-0001-x
algebraic curve; quantum error-correcting codes; multi-party computation; algebraic geometric (AG) code
94A60: Cryptography
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
81P94: Quantum cryptography (quantum-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Algebraic function fields and codes
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- How to share a secret
- Asymptotic bounds on quantum codes from algebraic geometry codes
- A Finite Gilbert–Varshamov Bound for Pure Stabilizer Quantum Codes
- Excellent Nonlinear Codes From Algebraic Function Fields
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Decoding algebraic-geometric codes up to the designed minimum distance
- Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound
- Some good quantum error-correcting codes from algebraic-geometric codes
- New binary linear codes from algebraic curves
- Quantum codes 6, 2, 3/sub p/ and 7, 3, 3/sub p/ (p ≥ 3) exist
- Linear authentication codes: bounds and constructions
- Low-correlation, large linear span sequences from function fields
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
