preprint
وصول مفتوح
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Research footprint
At a glance
- الاستشهادات
- 1
- المراجع
- 15
- Comments
- 0
Paper overview
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.
Record transparency
Publication details
- DOI
- 10.15495/epub_ubt_00004876
- OpenAlex
- W3033946558
- Document type
- preprint
- Language
- EN
- Source
- ERef Bayreuth (University of Bayreuth)
- Last metadata update
Comments
تسجيل الدخول للانضمام إلى النقاش.