Abstract | ||
---|---|---|
Combinatorial characterizations of one-coincidence frequency-hopping (FH) sequences are provided in terms of perfect Mendelsohn packings. As a consequence, results on perfect Mendelsohn packings can be immediately applied to one-coincidence FH sequences. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/s10623-006-9007-8 | Des. Codes Cryptography |
Keywords | DocType | Volume |
Frequency-hopping (FH) sequence,One-coincidence,Optimum,Perfect Mendelsohn packing,94A05,05B30 | Journal | 41 |
Issue | ISSN | Citations |
2 | 0925-1022 | 10 |
PageRank | References | Authors |
0.68 | 7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zhenfu Cao | 1 | 2650 | 177.89 |
Gennian Ge | 2 | 904 | 95.51 |
Ying Miao | 3 | 491 | 43.85 |