首页|On the number of minimal codewords in codes generated by the adjacency matrix of a graph
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
? 2021Minimal 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.
GraphsLinear codesMinimal codewords
Kurz S.
展开 >
Fakult?t für Mathematik Physik und Informatik Universit?t Bayreuth
NSTL
Elsevier
