3 research outputs found
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
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.Comment: 11 page