Codes parameterized by the edges of a bipartite graph with a perfect matching
Manuel Gonzalez Sarabia, Rafael H. Villarreal
TL;DR
This paper investigates the properties of certain evaluation codes constructed from bipartite graphs with perfect matchings, aiming to understand their parameters and potential applications.
Contribution
It introduces a new class of codes parameterized by bipartite graph edges with perfect matchings and analyzes their main characteristics.
Findings
Characterization of code parameters
Insights into code performance based on graph structure
Potential applications in coding theory
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · DNA and Biological Computing