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

Manuel González Sarabia; Rafael H. Villarreal

doi:10.2478/auom-2023-0021

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

Manuel González Sarabia, Rafael H. Villarreal

Unidad Profesional Interdisciplinaria de Ingeniería y Tecnologías Avanzadas (UPIITA)

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	85-99
Number of pages	15
Journal	Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica
Volume	31
Issue number	2
DOIs	https://doi.org/10.2478/auom-2023-0021
State	Published - 1 Mar 2023

Keywords

Bipartite graph
Parameterized code
Perfect matching

Access to Document

10.2478/auom-2023-0021

Cite this

@article{48ed3b46e91242a6a389a652ddf5b99b,

title = "Codes parameterized by the edges of a bipartite graph with a perfect matching",

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.",

keywords = "Bipartite graph, Parameterized code, Perfect matching",

author = "Sarabia, {Manuel Gonz{\'a}lez} and Villarreal, {Rafael H.}",

note = "Publisher Copyright: {\textcopyright} 2023 Manuel Gonz{\'a}lez Sarabia et al., published by Sciendo.",

year = "2023",

month = mar,

day = "1",

doi = "10.2478/auom-2023-0021",

language = "Ingl{\'e}s",

volume = "31",

pages = "85--99",

journal = "Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica",

issn = "1224-1784",

number = "2",

}

TY - JOUR

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

AU - Sarabia, Manuel González

AU - Villarreal, Rafael H.

PY - 2023/3/1

Y1 - 2023/3/1

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

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

KW - Bipartite graph

KW - Parameterized code

KW - Perfect matching

UR - http://www.scopus.com/inward/record.url?scp=85151535471&partnerID=8YFLogxK

U2 - 10.2478/auom-2023-0021

DO - 10.2478/auom-2023-0021

M3 - Artículo

AN - SCOPUS:85151535471

SN - 1224-1784

VL - 31

SP - 85

EP - 99

JO - Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica

JF - Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this