On the number of minimal codewords in codes generated by the adjacency matrix of a graph

Titelangaben

Kurz, Sascha:
On the number of minimal codewords in codes generated by the adjacency matrix of a graph.
In: Discrete Applied Mathematics. Bd. 309 (2022) . - S. 221-228.
ISSN 1872-6771
DOI: https://doi.org/10.1016/j.dam.2021.12.015

Volltext

Link zum Volltext (externe URL):

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.