Coset bounds for algebraic geometric codes

Finite Fields and their Applications

Volumn 16, Issue 1, 2010, Pages 36-55

  Duursma, Iwan M ^a   Park, Seungkook ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF CINCINNATI   (United States)

Author keywords

Algebraic geometric code; Floor bound; Linear secret sharing; Order bound

Indexed keywords

ALGEBRAIC GEOMETRIC CODE; ALGEBRAIC GEOMETRIC CODES; MINIMUM DISTANCE; SECRET SHARING; SECRET SHARING SCHEMES;

FLOORS;

ALGEBRA;

EID: 74749083594     PISSN: 10715797     EISSN: 10902465     Source Type: Journal    
DOI: 10.1016/j.ffa.2009.11.006     Document Type: Article

References (14)

1. Homma M., and Kim S.J. The complete determination of the minimum distance of two-point codes on a Hermitian curve. Des. Codes Cryptogr. 40 1 (2006) 5-24
2. Chen H., and Cramer R. Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. Advances in Cryptology-CRYPTO 2006. Lecture Notes in Comput. Sci. vol. 4117 (2006), Springer, Berlin 521-536
3. Beelen P. The order bound for general algebraic geometric codes. Finite Fields Appl. 13 3 (2007) 665-680
4. Lundell B., and McCullough J. A generalized floor bound for the minimum distance of geometric Goppa codes. J. Pure Appl. Algebra 207 1 (2006) 155-164
5. Güneri C., Stichtenoth H., and Taskin I. Further improvements on the designed minimum distance of algebraic geometry codes. J. Pure Appl. Algebra 213 1 (2009) 87-97
6. Seungkook Park, Applications of algebraic curves to cryptography, Dissertation, University of Illinois, Urbana, 2007
7. Cramer R., Damgård I., and Maurer U. General secure multi-party computation from any linear secret-sharing scheme. Advances in Cryptology-EUROCRYPT 2000. Bruges. Lecture Notes in Comput. Sci. vol. 1807 (2000), Springer, Berlin 316-334
8. Cramer R., Daza V., Gracia I., Urroz J.J., Leander G., Martí-Farré J., and Padró C. On codes, matroids and secure multi-party computation from linear secret sharing schemes. Advances in Cryptology-CRYPTO 2005. Lecture Notes in Comput. Sci. vol. 3621 (2005), Springer, Berlin 327-343
9. Duursma I.M., and Park S. Coset bounds for algebraic geometric codes (2008). arXiv:0810.2789
10. van Lint J.H., and Wilson R.M. On the minimum distance of cyclic codes. IEEE Trans. Inform. Theory 32 1 (1986) 23-40
11. Feng G.L., and Rao T.R.N. Decoding algebraic-geometric codes up to the designed minimum distance. IEEE Trans. Inform. Theory 39 1 (1993) 37-45
12. Campillo A., Farrán J.I., and Munuera C. On the parameters of algebraic-geometry codes related to Arf semigroups. IEEE Trans. Inform. Theory 46 7 (2000) 2634-2638
13. Iwan M. Duursma, Decoding codes from curves and cyclic codes, Dissertation, Technische Universiteit Eindhoven, Eindhoven, 1993
14. Duursma I.M. Majority coset decoding. IEEE Trans. Inform. Theory 39 3 (1993) 1067-1070