Codes parameterized by the edges of a bipartite graph with a perfect matching

Sarabia, Manuel González; Villarreal, Rafael H.

doi:10.2478/auom-2023-0021

Abstract

In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.

References

Beelen P., Datta M., Generalized Hamming weights of a ne Cartesian codes, Finite Fields App. 51 (2018) 130–145.
Search in Google Scholar Back to article
Duursma I., Rentería C., and Tapia-Recillas H., Reed–Muller codes on Complete Intersections, Appl. Algebra Engrg. Comm. Comput. 11 (2001) 455-462.
Search in Google Scholar Back to article
Datta M., Relative generalized Hamming weights of a ne Cartesian codes, Des. Codes Cryptogr. 88 (2020) 1273–1284.
Search in Google Scholar Back to article
González–Sarabia M., Rentería C., and Hernández de la Torre M., Minimum distance and second generalized Hamming weight of two particular linear codes, Congr. Numer. 161 (2003) 105–116.
Search in Google Scholar Back to article
González–Sarabia M., Rentería C., Evaluation Codes Associated to Complete Bipartite Graphs, Int. J. Algebra 2 (2008) 163-170.
Search in Google Scholar Back to article
González–Sarabia Manuel, Nava Lara Joel, Rentería Márquez Carlos, and Sarmiento Rosales Eliseo, Parameterized Codes over cycles, An. Stiint. Univ. Ovidius Constanta Ser. Mat. 21 (3) (2013) 241–255.
Search in Google Scholar Back to article
González–Sarabia Manuel, Rentería Márquez Carlos, and Sarmiento Ro-sales Eliseo, Parameterized Codes over some Embedded Sets and their Applications to Complete Graphs, Math. Commun. 18 (2013) 337–391.
Search in Google Scholar Back to article
González–Sarabia Manuel, and Sarmiento R. Eliseo, Parameterized codes associated to the edges of some subgraphs of a simple graph, Appl. Algebra Engrg. Comm. Comput. 26 (2015) 493–505.
Search in Google Scholar Back to article
González–Sarabia M., and Rentería C., Generalized Hamming weights and some parameterized codes, Discrete Math. 339 (2016), 813–821.
Search in Google Scholar Back to article
López H., Rentería M. C., and Villarreal R. H., A ne cartesian codes, Des. Codes Cryptogr. 71 (2014) 5–19.
Search in Google Scholar Back to article
Neves J., Vaz Pinto M., Villarreal R.H., Vanishing ideals over graphs and even cycles, Comm. Algebra 43:3 (2015) 1050–1075.
Search in Google Scholar Back to article
Neves Jorge and Vaz Pinto Maria, Vanishing ideals over complete multi-partite graphs, J. Pure Appl. Algebra 218 (6) (2014) 1084–1094.
Search in Google Scholar Back to article
Rentería C., Simis A., and Villarreal R.H., Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields, Finite Fields Appl. 17 (2011) 81–104.
Search in Google Scholar Back to article
Sarmiento E., Vaz Pinto M., and R. H. Villarreal, The minimum distance of parameterized codes on projective tori, Appl. Algebra Engrg. Comm. Comput. 22 (4) (2011) 249–264
Search in Google Scholar Back to article

Codes parameterized by the edges of a bipartite graph with a perfect matching

Abstract

Paradigm

My account