Skip to main content
SpringerLink
Log in

On Generalized Monomial Codes Defined Over Sets with a Special Vanishing Ideal

  • Published:
Bulletin of the Brazilian Mathematical Society, New Series Aims and scope Submit manuscript

Abstract

In this work we study evaluation codes defined on the points of a subset \(\mathcal {X}\) of an affine space over a finite field, whose vanishing ideal admits a Gröbner basis of a certain type, which occurs for subsets considered in several well-known examples of evaluation codes, like Reed-Solomon codes, Reed-Muller codes and affine cartesian codes. We determine properties of the polynomials in this basis which allow the determination of the footprint of the vanishing ideal and the explicit construction of indicator functions for the points of \(\mathcal {X}\). We then consider generalized monomial evaluation codes and find information on their duals, and the dimension of their hulls. We present several examples of applications of the results we found.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Data availability

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

References

  • Becker, T., Weispfenning, V.: Gröbner Bases - A computational approach to commutative algebra, Berlin, Germany: Springer Verlag, 1998, 2nd. pr

  • Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24, 235–265 (1997)

    Article  MathSciNet  Google Scholar 

  • Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Dissertation an dem Math. Inst. der Universität von Innsbruck (1965)

  • Carvalho, C.: Gröbner bases methods on coding theory. Algebra for secure and reliable communication modeling, 73–86, Contemp. Math., 642, Amer. Math. Soc., Providence, RI, (2015)

  • Carvalho, C., López, H.H., Matthews, G.L.: Decreasing norm-trace codes. To appear in Des. Codes Cryptogr (2023). Available online at https://doi.org/10.1007/s10623-023-01334-1

  • Chen, B., Ling, S., Liu, H.: Hulls of Reed-Solomon Codes via Algebraic Geometry Codes. IEEE Trans. Inform. Theory 69, 1005–1014 (2023)

    Article  ADS  MathSciNet  Google Scholar 

  • Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 3rd edn. Springer, New York (2007)

    Book  Google Scholar 

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

  • Guenda, K., Jitman, S., Gulliver, T.A.: Constructions of good entanglement assisted quantum error correcting codes. Des. Codes Cryptogr. 86, 121–136 (2018)

    Article  MathSciNet  Google Scholar 

  • Janwa, H., Piñero, F.L.: On parameters of subfield subcodes of extended norm-trace codes. Adv. Math. Commun. 11, 379–388 (2017)

    Article  MathSciNet  Google Scholar 

  • Leon, J.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inform. Theory. 28, 496–511 (1982)

    Article  MathSciNet  Google Scholar 

  • López, H.H., Rentería-Márquez, C., Villarreal, R.H.: Affine Cartesian codes. Des. Codes Cryptogr. 71, 5–19 (2014)

    Article  MathSciNet  Google Scholar 

  • López, H.H., Manganiello, F., Matthews, G.L.: Affine Cartesian codes with complementary duals. Finite Fields Appl. 57, 13–28 (2019)

  • López, H.H., Soprunov, I., Villarreal, R.H.: The dual of an evaluation code. arXiv:2012.10016v2 [math.AC] (2023)

  • McGuire, D., Mueller, G.: Some results on linearized trinomials that split completely. Finite fields and their applications: Proceedings of the 14th International Conference on Finite Fields and their Applications, 149–164, De Gruyter Proc. Math., De Gruyter, Berlin 2020

  • Sendrier, N.: Finding the permutation between equivalent linear codes: The support splitting algorithm. IEEE Trans. Inform. Theory 46, 1193–1203 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Partially supported by Fapemig - grant APQ-00864-21.

Author information

Authors and Affiliations

  1. Faculdade de Matemática, Universidade Federal de Uberlândia, Av. J.N. Avila 2121, Uberlândia, 38400-902, MG, Brazil

    Cícero Carvalho

Authors
  1. Cícero Carvalho
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cícero Carvalho.

Ethics declarations

Conflict of interest

The author has no Conflict of interest to declare

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Carvalho, C. On Generalized Monomial Codes Defined Over Sets with a Special Vanishing Ideal. Bull Braz Math Soc, New Series 55, 15 (2024). https://doi.org/10.1007/s00574-024-00389-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00574-024-00389-5

Keywords

Search

Navigation