REVIEW
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
classification
math.CO
keywords
codescodewordsmatrixminimaladjacencygraphlinearnumber
read the original 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.
Discussion (0). Continue with ORCID to comment.