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.
Bayreuth , 2020 . - 11 S.

Volltext

	Format: PDF Name: graph_minimal_codewords.pdf Version: Veröffentlichte Version Verfügbar mit der Lizenz Creative Commons BY 4.0: Namensnennung
	Download (251kB)

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.