Papers
Topics
Authors
Recent
Search
2000 character limit reached

The edge code of hypergraphs

Published 2 Apr 2024 in math.AC, cs.IT, math.CO, and math.IT | (2404.02301v1)

Abstract: Given a hypergraph $\mathcal{H}$, we introduce a new class of evaluation toric codes called edge codes derived from $\mathcal{H}$. We analyze these codes, focusing on determining their basic parameters. We provide estimations for the minimum distance, particularly in scenarios involving $d$-uniform clutters. Additionally, we demonstrate that these codes exhibit self-orthogonality. Furthermore, we compute the minimum distances of edge codes for all graphs with five vertices.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. Relative hulls and quantum codes, 2023.
  2. Martin Aigner. Combinatorial theory. Classics in Mathematics. Springer-Verlag, Berlin, 1997. Reprint of the 1979 original.
  3. Coding theory package for Macaulay2. J. Softw. Algebra Geom., 11(1):113–122, 2021.
  4. Maximum number of common zeros of homogeneous polynomials over finite fields. Proc. Amer. Math. Soc., 146(4):1451–1468, 2018.
  5. A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields. Mosc. Math. J., 22(4):565–593, 2022.
  6. On codes from hypergraphs. European Journal of Combinatorics, 25(3):339 – 354, 2004. Cited by: 21.
  7. Gröbner bases, volume 141 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1993. A computational approach to commutative algebra, In cooperation with Heinz Kredel.
  8. Number of solutions of systems of homogeneous polynomial equations over finite fields. Proc. Amer. Math. Soc., 145(2):525–541, 2017.
  9. Olav Geil. Evaluation codes from an affine variety code perspective. In Advances in algebraic geometry codes, volume 5 of Ser. Coding Theory Cryptol., pages 153–180. World Sci. Publ., Hackensack, NJ, 2008.
  10. Locally recoverable J𝐽Jitalic_J-affine variety codes. Finite Fields Appl., 64:101661, 22, 2020.
  11. On the minimum distance, minimum weight codewords, and the dimension of projective Reed-Muller codes. Adv. Math. Commun., 18(2):360–382, 2024.
  12. Macaulay2, a software system for research in algebraic geometry. Available at http://www2.macaulay2.com.
  13. Algebraic geometry codes. In Handbook of coding theory, Vol. I, II, pages 871–961. North-Holland, Amsterdam, 1998.
  14. Relative generalized hamming weights of evaluation codes. São Paulo Journal of Mathematical Sciences, 17(1):188–207, 2023.
  15. Evaluation codes and their basic parameters. Des. Codes Cryptogr., 89(2):269–300, 2021.
  16. Computational commutative algebra. 2. Springer-Verlag, Berlin, 2005.
  17. Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes. Des. Codes Cryptogr., 88(8):1673–1685, 2020.
  18. Affine Cartesian codes. Des. Codes Cryptogr., 71(1):5–19, 2014.
  19. The dual of an evaluation code. Designs, Codes and Cryptography, 89:1367 – 1403, 2020.
  20. Hideyuki Matsumura. Commutative ring theory, volume 8 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 1989. Translated from the Japanese by M. Reid.
  21. Minimum distance functions of complete intersections. J. Algebra Appl., 17(11):1850204, 22, 2018.
  22. Linear codes over signed graphs. Des. Codes Cryptogr., 88(2):273–296, 2020.
  23. The theory of error-correcting codes. I, volume Vol. 16 of North-Holland Mathematical Library. North-Holland Publishing Co., Amsterdam-New York-Oxford, 1977.
  24. Parameterized codes over graphs. São Paulo J. Math. Sci., 17(1):306–319, 2023.
  25. Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields. Finite Fields Appl., 17(1):81–104, 2011.
  26. Bernd Sturmfels. Gröbner bases and convex polytopes, volume 8 of University Lecture Series. American Mathematical Society, Providence, RI, 1996.
  27. Rafael H. Villarreal. Monomial algebras. Monographs and Research Notes in Mathematics. CRC Press, Boca Raton, FL, second edition, 2015.
  28. G. Zemor. On expander codes. IEEE Transactions on Information Theory, 47(2):835–837, 2001.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.