nach oben

Designs, Codes and Cryptography

Erschienen in:

01.12.2016

Near weights on higher dimensional varieties

verfasst von: Cícero Carvalho, Rafael Peixoto, Fernando Torres

Erschienen in: Designs, Codes and Cryptography | Ausgabe 3/2016

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

We generalize the concept of near weight stated in Carvalho et al. (IEEE Trans Inf Theory 53(5):1919–1924, 2007) in the sense that we consider maps to arbitrary well-ordered semigroups instead of the nonnegative integers. This concept can be used as a tool to study AG codes based on more than one point via elementary methods only, as well as to construct codes from higher dimensional varieties.

Vorheriger Artikel Suzuki-invariant codes from the Suzuki curve

Nächster Artikel Veronese subspace codes

Andersen H.E., Geil, O.: Evaluation codes from order domain theory. Finite Fields Appl. 14(1), 92–123 (2008).

Beelen P., Ruano D.: The order bound for toric codes. In: Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes. Lecture Notes in Computer Science, vol. 5527, pp. 1–10. Springer, Berlin (2009).

Bourbaki N.: Commutative Algebra. Addison-Wesley, Reading (1972).

Carvalho C., Silva E.: On algebras admitting a complete set of near weights, evaluation codes, and Goppa codes. Des. Codes Cryptogr. 53(2), 99–100 (2009).

Carvalho C., Munuera C., Silva E., Torres F.: Nears orders and codes. IEEE Trans. Inf. Theory 53(5), 1919–1924 (2007).

Cox D., Little J., O’Shea D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry, 2nd edn, Springer, Berlin (1996).

Eisenbud D.: Commutative Algebra with a View Toward Algebraic Geometry. Graduate Text in Mathematics. Springer, Berlin (1995).

Fitzgerald J., Lax R.: Decoding affine variety codes using Gröbner bases. Des. Codes Cryptogr. 13, 147–158 (1998).

Geil O.: Algebraic geometry codes from order domains. In: Gröbner Bases, Coding, and Cryptography. Springer, Berlin, pp. 121-141 (2009).

10.

Geil O., Pellikaan R.: On the structure of order domains. Finite Fields Appl. 8, 369–396 (2002).

11.

Goppa V.D.: Codes associated with divisors. Probl. Inf. Transm. 13, 22–26 (1977).

12.

Goppa V.D.: Geometry and Codes. Mathematics and Its Applications, vol. 24. Kluwer, Dordrecht (1991).

13.

Høholdt T., van Lint J.H., Pellikaan R.: Algebraic geometry codes. In: Pless V., Huffman W.C. (eds.), Handbook of Coding Theory, pp. 871–961, Elsevier, New York (1998).

14.

Homma M., Kim S.J.: Toward the determination of the minimum distance of two-point codes on a Hermitian curve. Des. Codes Cryptogr. 37, 111–132 (2005).

15.

Homma M., Kim S.J.: The complete determination of the minimum distance of two-point codes on a Hermitian curve. Des. Codes Cryptogr. 40, 5–24 (2006).

16.

Homma M., Kim S.J.: The two-point codes on a Hermitian curve with the designed minimum distance. Des. Codes Cryptogr. 38, 55–81 (2006).

17.

Homma M., Kim S.J.: The two-point codes with the designed distance on a Hermitian curve in even characteristic. Des. Codes Cryptogr. 39, 375–386 (2006).

18.

Little J.: The ubiquity of order domains for the construction of error control codes. Adv. Math. Commun. 1(1), 151–171 (2007).

19.

Matsumoto R.: Miura’s generalization of one-point AG codes is equivalent to Hoholdt, van Lint and Pellikaan’s generalization. IEICE Trans. Fundam. E82-A(10), 2007–2010 (1999).

20.

Park S.: Minimum distance of Hermitian two-point codes. Des. Codes Cryptogr. 57, 195–213 (2010).

21.

Munuera C., Torres F.: The structure of algebras admitting well agreeing near weights. J. Pure Appl. Algebra 212(4), 910–918 (2008).

22.

Peixoto R.: Funções pesos fracos sobre variedades algébricas, Ph.D. Thesis, Unicamp, Campinas (2011).

23.

Serre J.P.: Rational Points on Curves over Finite Fields. Notes by Fernando Q. Gouvéa of Lectures at Harvard University (1985).

24.

Shiffels G.: Orderings and algorithms in commutative algebra. Africa Math. Ser. 3(2), 79–101 (1983).

25.

Silva E.: Funções orders fracas e a distância mínima dos códigos geométricos de Goppa, Ph.D. Thesis, Unicamp, Campinas (2004).

26.

Sturmfels B.: Gröbner Bases and Convex Polytopes. University Lecture Series, vol. 8. American Mathematical Society, Providence (1995).

27.

Tsfasman M.A., Vladut S.G., Zink T.: Modular curves, Shimura curves and Goppa codes better than Varshamov–Gilbert bound. Math. Nachr. 109, 21–28 (1982).

28.

Vaquié M.: Valuations and Local Uniformization, Singularity Theory and Its Applications. Advanced Studies in Pure Math, vol. 43, pp. 477–527. Mathematical Society, Tokyo (2006).

29.

Zariski O., Samuel P.: Commutative Algebra. Graduate Texts in Mathematics, vol. II. Springer, New York (1975).

Titel: Near weights on higher dimensional varieties
verfasst von: Cícero Carvalho
Rafael Peixoto
Fernando Torres
Publikationsdatum: 01.12.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 3/2016
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-015-0165-4

Springer Professional

Near weights on higher dimensional varieties

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 3/2016

Complementary information set codes over GF(p)

New criterion for diffusion property and applications to improved GFS and EGFN

Veronese subspace codes

Suzuki-invariant codes from the Suzuki curve

Index bounds for character sums of polynomials over finite fields

Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using -method

Premium Partner