Generalized graph codes and thier minimum distances
Combinatorics
2025-01-27 v2 Information Theory
math.IT
Abstract
Graph code is a linear code obtained from linear codes and a certain bipartite graph G. In this paper, I propose an expansion of the definition of graph code to general -partite, and give its lower bound of minimum distance. I also give an example of generalized graph code and calculate its parameters .
Keywords
Cite
@article{arxiv.2501.13462,
title = {Generalized graph codes and thier minimum distances},
author = {Naoki Fujii},
journal= {arXiv preprint arXiv:2501.13462},
year = {2025}
}