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

DOI10.1016/j.dam.2021.12.015zbMath1501.94089arXiv2006.02975OpenAlexW4220884850MaRDI QIDQ2065789

Sascha Kurz

Publication date: 13 January 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.02975

zbMATH Keywords

linear codesgraphsminimal codewords

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• The maximum number of minimal codewords in an \([n,k\)-code]
• The maximum number of minimal codewords in long codes
• Minimal codewords in Reed-Muller codes
• The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes]
• Practical graph isomorphism. II.
• Towards Secure Two-Party Computation from the Wire-Tap Channel
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Decoding linear block codes for minimizing word error rate (Corresp.)
• On the inherent intractability of certain coding problems (Corresp.)
• Minimal vectors in linear codes
• On the Voronoi neighbor ratio for binary linear block codes
• Covering arrays and intersecting codes
• Voronoi regions for binary linear block codes
• On the minimum number of minimal codewords