Coset bounds for algebraic geometric codes

DOI10.1016/J.FFA.2009.11.006zbMATH Open1247.94059arXiv0810.2789OpenAlexW2099920789MaRDI QIDQ623250FDOQ623250

Authors: Seungkook Park, Iwan Duursma 

Publication date: 14 February 2011

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a party A that can recover the secret in an algebraic geometric linear secret sharing scheme with adversary threshold C, and (2) lower bounds for the support A of a codeword in a geometric Goppa code with designed minimum support C. Our bounds include and improve both the order bound and the floor bound. The bounds are illustrated for two-point codes on general Hermitian and Suzuki curves.

Full work available at URL: https://arxiv.org/abs/0810.2789

Recommendations

• Delta sets for divisors supported in two points
• Distance bounds for algebraic geometric codes
• Further improvements on the designed minimum distance of algebraic geometry codes
• The order bound for general algebraic geometric codes
• Algebraic geometry codes: general theory

zbMATH Keywords

algebraic geometric codefloor boundlinear secret sharingorder bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Title not available (Why is that?)
• General secure multi-party computation from any linear secret-sharing scheme
• On the minimum distance of cyclic codes
• The order bound for general algebraic geometric codes
• A generalized floor bound for the minimum distance of geometric Goppa codes
• Decoding algebraic-geometric codes up to the designed minimum distance
• Majority coset decoding
• The complete determination of the minimum distance of two-point codes on a Hermitian curve
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Coset bounds for algebraic geometric codes
• Further improvements on the designed minimum distance of algebraic geometry codes
• On the parameters of algebraic-geometry codes related to Arf semigroups
• On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes

Cited In (16)

• Coset bounds for algebraic geometric codes
• On nested code pairs from the Hermitian curve
• From primary to dual affine variety codes over the Klein quartic
• Uniformity for geometric codes over large extensions of \(\mathbb F_q\)
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
• Hermitian codes from higher degree places
• Secret sharing schemes with strong multiplication and a large number of players from toric varieties
• Classical access structures of ramp secret sharing based on quantum stabilizer codes
• Distance bounds for algebraic geometric codes
• Title not available (Why is that?)
• Delta sets for divisors supported in two points
• Steane-enlargement of quantum codes from the Hermitian function field
• Lower bounds on the minimum distance in Hermitian one-point differential codes
• Sphere-bound-achieving coset codes and multilevel coset codes
• On the evaluation codes given by simple \(\delta \)-sequences
• Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets

This page was built for publication: Coset bounds for algebraic geometric codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623250)