On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Combinatorics
2020-06-05 v1
Abstract
Minimal codewords have applications in decoding linear codes and in cryptography. We study the number of minimal codewords in binary linear codes that arise by appending a unit matrix to the adjacency matrix of a graph.
Cite
@article{arxiv.2006.02975,
title = {On the number of minimal codewords in codes generated by the adjacency matrix of a graph},
author = {Sascha Kurz},
journal= {arXiv preprint arXiv:2006.02975},
year = {2020}
}
Comments
11 pages