Codes parameterized by the edges of a bipartite graph with a perfect matching
arXiv:2209.12846
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.
11 pages