Coset bounds for algebraic geometric codes

DOI10.1016/J.FFA.2009.11.006MaRDI QIDQ623250zbMATHOpenAlexFDO

Authors Seungkook Park, Iwan Duursma

Publication date 14 February 2011

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

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

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)

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.

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

Cites work

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

Cited in

(16)

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

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)