Back to Search
Start Over
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
- Publication Year :
- 2020
-
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.<br />Comment: 11 pages
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2006.02975
- Document Type :
- Working Paper