Codes parameterized by the edges of a bipartite graph with a perfect matching
e | 27 mar 2023
INFORMAZIONI SU QUESTO ARTICOLO
Pubblicato online: 27 mar 2023
Pagine: 85 - 99
Ricevuto: 26 set 2022
Accettato: 20 dic 2022
DOI: https://doi.org/10.2478/auom-2023-0021
Parole chiave
© 2023 Manuel González Sarabia et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.