The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.11.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058258197 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56926530 / 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 maximum number of minimal codewords in long codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles in 3-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal vectors in linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rank inequality for finite geometric lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of removable edges in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kuratowski's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition with constraints on the connectivity and minimum degree / rank
 
Normal rank

Latest revision as of 01:07, 10 July 2024

scientific article
Language Label Description Also known as
English
The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
scientific article

    Statements

    The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2015
    0 references
    0 references
    minimal codewords
    0 references
    matroid theory
    0 references
    cycle code of graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references