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

DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00004876
URN to cite this document: urn:nbn:de:bvb:703-epub-4876-5

Title data

Kurz, Sascha:
On the number of minimal codewords in codes generated by the adjacency matrix of a graph.
Bayreuth , 2020 . - 11 S.

	Format: PDF Name: graph_minimal_codewords.pdf Version: Published Version Available under License Creative Commons BY 4.0: Attribution
	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.

Further data

Item Type:	Preprint, postprint
Keywords:	minimal codewords; graphs; linear codes
DDC Subjects:	000 Computer Science, information, general works > 004 Computer science 500 Science > 510 Mathematics
Institutions of the University:	Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics Faculties
Language:	English
Originates at UBT:	Yes
URN:	urn:nbn:de:bvb:703-epub-4876-5
Date Deposited:	15 Jun 2020 09:36
Last Modified:	15 Jun 2020 09:36
URI:	https://epub.uni-bayreuth.de/id/eprint/4876

Download Statistics

Download Statistics

Download Statistics

Downloads

Downloads per month over past year