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

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

Bibliographic Details
Main Authors: Sarabia Manuel González, Villarreal Rafael H.
Format: Article
Language:English
Published: Sciendo 2023-03-01
Series:Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
Subjects:
Online Access:https://doi.org/10.2478/auom-2023-0021