On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4220884850 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2006.02975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi regions for binary linear block codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Voronoi neighbor ratio for binary linear block codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of minimal codewords in an \([n,k]\)-code / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of minimal codewords in long codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal vectors in linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4655217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Secure Two-Party Computation from the Wire-Tap Channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum number of minimal codewords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding linear block codes for minimizing word error rate (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal codewords in Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering arrays and intersecting codes / rank
 
Normal rank

Latest revision as of 16:51, 27 July 2024

scientific article
Language Label Description Also known as
English
On the number of minimal codewords in codes generated by the adjacency matrix of a graph
scientific article

    Statements

    On the number of minimal codewords in codes generated by the adjacency matrix of a graph (English)
    0 references
    0 references
    13 January 2022
    0 references
    minimal codewords
    0 references
    graphs
    0 references
    linear codes
    0 references
    0 references
    0 references

    Identifiers