Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

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

Title data

Kurz, Sascha:
On the number of minimal codewords in codes generated by the adjacency matrix of a graph.
Bayreuth , 2020 . - 11 p.
DOI: https://doi.org/10.15495/EPub_UBT_00004876

Official URL: Volltext

Abstract in another language

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
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
Result of work at the UBT: Yes
DDC Subjects: 000 Computer Science, information, general works > 004 Computer science
500 Science > 510 Mathematics
Date Deposited: 20 Jun 2020 21:00
Last Modified: 22 Jun 2020 05:59
URI: https://eref.uni-bayreuth.de/id/eprint/55581