<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.</p>
</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.

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

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

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

Publicado en línea: 27 mar 2023

Páginas: 85 - 99

Recibido: 26 sept 2022

Aceptado: 20 dic 2022

DOI: https://doi.org/10.2478/auom-2023-0021

Palabras clave
Parameterized code, Bipartite graph, Perfect matching

© 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.

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

Publicado en línea: 27 mar 2023

Páginas: 85 - 99

Recibido: 26 sept 2022

Aceptado: 20 dic 2022

DOI: https://doi.org/10.2478/auom-2023-0021

Palabras claveParameterized code, Bipartite graph, Perfect matching

© 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.

Palabras clave
Parameterized code, Bipartite graph, Perfect matching