- Record: found
- Abstract: found
- Article: found
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Preprint
04 June 2020
Read this article at
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
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.