Coset bounds for algebraic geometric codes

[1]  Gretchen L. Matthews,et al.  On the floor and the ceiling of a divisor , 2006, Finite Fields Their Appl..

[2]  Gretchen L. Matthews.  Weierstrass Pairs and Minimum Distance of Goppa Codes , 2001, Des. Codes Cryptogr..

[3]  Gretchen L. Matthews.  Codes from the Suzuki function field , 2004, IEEE Transactions on Information Theory.

[4]  Carlos Munuera,et al.  On the parameters of algebraic-geometry codes related to Arf semigroups , 1999, IEEE Trans. Inf. Theory.

[5]  Cícero Carvalho,et al.  On Goppa Codes and Weierstrass Gaps at Several Points , 2005, Des. Codes Cryptogr..

[6]  Jason McCullough,et al.  A GENERALIZED FLOOR BOUND FOR THE MINIMUM DISTANCE OF GEOMETRIC GOPPA CODES AND ITS APPLICATION TO TWO-POINT CODES , 2004, math/0408341.

[7]  Iwan Duursma,et al.  Algebraic geometry codes: general theory , 2008 .

[8]  Iwan M. Duursma,et al.  Majority coset decoding , 1993, IEEE Trans. Inf. Theory.

[9]  Yuan Zhou.  Introduction to Coding Theory , 2010 .

[10]  Peter Beelen,et al.  The order bound for general algebraic geometric codes , 2007, Finite Fields Their Appl..

[11]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

[12]  Maria Bras-Amorós,et al.  On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes , 2006, IEEE Transactions on Information Theory.

[13]  Leyla Isik.  On the minimum distance of cyclic codes , 2011 .

[14]  Ueli Maurer,et al.  General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.

[15]  Seon Jeong Kim.  On the index of the Weierstrass semigroup of a pair of points on a curve , 1994 .

[16]  Oliver Pretzel,et al.  Codes and Algebraic Curves , 1998 .

[17]  V. D. Goppa.  Codes on Algebraic Curves , 1981 .

[18]  Carles Padró,et al.  On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes , 2005, IEEE Transactions on Information Theory.

[19]  Carlos Munuera,et al.  Near Orders and Codes , 2007, IEEE Transactions on Information Theory.

[20]  T. R. N. Rao,et al.  Decoding algebraic-geometric codes up to the designed minimum distance , 1993, IEEE Trans. Inf. Theory.

[21]  Richard M. Wilson,et al.  On the minimum distance of cyclic codes , 1986, IEEE Trans. Inf. Theory.

[22]  Hao Chen,et al.  Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.

[23]  R. F. Lax,et al.  Consecutive Weierstrass gaps and minimum distance of Goppa codes , 1993 .

[24]  M. Tsfasman,et al.  Algebraic Geometric Codes: Basic Notions , 2007 .

[25]  Henning Stichtenoth,et al.  Further improvements on the designed minimum distance of algebraic geometry codes , 2009 .

[26]  Maria Bras-Amorós,et al.  Acute semigroups, the order bound on the minimum distance, and the Feng-Rao improvements , 2004, IEEE Transactions on Information Theory.

[27]  Iwan M. Duursma,et al.  Decoding codes from curves and cyclic codes , 1993 .

[28]  Cem Güneri.  Algebraic geometric codes: basic notions , 2008 .

[29]  Ruud Pellikaan,et al.  The minimum distance of codes in an array coming from telescopic semigroups , 1995, IEEE Trans. Inf. Theory.

[30]  Henning Stichtenoth,et al.  Group codes on certain algebraic curves with many rational points , 1990, Applicable Algebra in Engineering, Communication and Computing.

[31]  Masaaki Homma,et al.  The Complete Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve , 2006, Des. Codes Cryptogr..

[32]  Seung Kook Park.  Applications of Algebraic Curves to Cryptography , 2007 .

[33]  Michael E. O'Sullivan.  New Codes for the Berlekamp-Massey-Sakata Algorithm , 2001 .

[34]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[35]  Peter Beelen,et al.  A generalization of the Weierstrass semigroup , 2006 .