Combinatorial characterizations of one-coincidence frequency-hopping sequences (Q851786): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10623-006-9007-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020090470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A brief survey of perfect Mendelsohn packing and covering designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent progress on the existence of perfect Mendelsohn designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Frequency-Hopping Sequences Via Cyclotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Frequency Hopping Sequences: A Combinatorial Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further combinatorial constructions for optimal frequency-hopping sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect cyclic designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: kth-Order Near-Orthogonal Codes (Corresp.) / rank
 
Normal rank

Latest revision as of 10:36, 25 June 2024

scientific article
Language Label Description Also known as
English
Combinatorial characterizations of one-coincidence frequency-hopping sequences
scientific article

    Statements

    Combinatorial characterizations of one-coincidence frequency-hopping sequences (English)
    0 references
    0 references
    0 references
    0 references
    22 November 2006
    0 references
    0 references
    Frequency-hopping (FH) sequence
    0 references
    One-coincidence
    0 references
    Optimum
    0 references
    Perfect Mendelsohn packing
    0 references
    0 references