The covering radius problem for sets of 1-factors of the complete uniform hypergraphs (Q2407022): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1009.0810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multicovering radius problem for some types of discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remoteness of permutation codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering radius for sets of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering radius---Survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random construction for permutation codes and the covering radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multicovering radii of codes / rank
 
Normal rank

Latest revision as of 12:10, 14 July 2024

scientific article
Language Label Description Also known as
English
The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
scientific article

    Statements

    The covering radius problem for sets of 1-factors of the complete uniform hypergraphs (English)
    0 references
    0 references
    0 references
    28 September 2017
    0 references
    covering radius
    0 references
    hypergraphs
    0 references
    probabilistic methods
    0 references
    finite metric spaces
    0 references

    Identifiers