메뉴 건너뛰기
Designs, Codes, and Cryptography
Volumn 41, Issue 2, 2006, Pages 177-184
Combinatorial characterizations of one-coincidence frequency-hopping sequences
Author keywords

Frequency hopping (FH) sequence; One coincidence; Optimum; Perfect Mendelsohn packing
Indexed keywords

COMBINATORIAL MATHEMATICS; OPTIMAL SYSTEMS;
EID: 33750906033     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-006-9007-8     Document Type: Article
Times cited : (19)
References (12)
  • 1
    • 0042779816 scopus 로고    scopus 로고
    • A brief survey of perfect Mendelsohn packings and covering designs
    • Bennett FE (1999) A brief survey of perfect Mendelsohn packings and covering designs. Discrete Appl Math 95:73-81
    • (1999) Discrete Appl Math , vol.95 , pp. 73-81
    • Bennett, F.E.1
  • 2
    • 0035315180 scopus 로고    scopus 로고
    • Recent progress on the existence of perfect Mendelsohn designs
    • Bennett FE (2001) Recent progress on the existence of perfect Mendelsohn designs. J Statist Plann Inference 94:121-138
    • (2001) J Statist Plann Inference , vol.94 , pp. 121-138
    • Bennett, F.E.1
  • 3
    • 15044363942 scopus 로고    scopus 로고
    • Optimal frequency hopping sequences via cyclotomy
    • Chu W, Colbourn CJ (2005) Optimal frequency hopping sequences via cyclotomy. IEEE Trans Inform Theory 51:1139-1141
    • (2005) IEEE Trans Inform Theory , vol.51 , pp. 1139-1141
    • Chu, W.1    Colbourn, C.J.2
  • 5
    • 5144228460 scopus 로고    scopus 로고
    • Optimal frequency hopping sequences a combinatorial approach
    • Fuji-Hara R, Miao Y, Mishima M (2004) Optimal frequency hopping sequences a combinatorial approach. IEEE Trans Inform Theory 50:2408-2420
    • (2004) IEEE Trans Inform Theory , vol.50 , pp. 2408-2420
    • Fuji-Hara, R.1    Miao, Y.2    Mishima, M.3
  • 6
    • 33748436059 scopus 로고    scopus 로고
    • Further combinatorial constructions for optimal frequency-hopping sequences
    • xxxx to appear
    • Ge G, Fuji-Hara R, Miao Y (xxxx) Further combinatorial constructions for optimal frequency-hopping sequences. J Combin Theory Ser A to appear
    • J Combin Theory Ser A
    • Ge, G.1    Fuji-Hara, R.2    Miao, Y.3
  • 7
    • 0346578016 scopus 로고    scopus 로고
    • Mendelsohn designs
    • Colbourn CJ, Dinitz JH (eds), CRC Press, Boca Raton
    • Mendelsohn E (1996) Mendelsohn designs. In: Colbourn CJ, Dinitz JH (eds), The CRC handbook of combinatorial designs. CRC Press, Boca Raton, pp 388-393
    • (1996) The CRC Handbook of Combinatorial Designs , pp. 388-393
    • Mendelsohn, E.1
  • 8
    • 0002988680 scopus 로고
    • Perfect cyclic designs
    • Mendelsohn NS (1977) Perfect cyclic designs. Discrete Math 20:63-68
    • (1977) Discrete Math , vol.20 , pp. 63-68
    • Mendelsohn, N.S.1
  • 9
    • 84939734310 scopus 로고
    • Some combinatorial aspects of spread spectrum communication systems
    • Skwirzynski JK Alphen ann den Rijn (eds), Sitjhoff and Noordhoff, The Netherlands
    • McEliece RJ (1981) Some combinatorial aspects of spread spectrum communication systems. In: Skwirzynski JK Alphen ann den Rijn (eds), New concepts in multi-user communication. Sitjhoff and Noordhoff, The Netherlands, pp 83-103
    • (1981) New Concepts in Multi-user Communication , pp. 83-103
    • McEliece, R.J.1
  • 10
    • 0014972878 scopus 로고
    • K-th order near-orthogonal codes
    • Reed IS, Stewart RM (1971) K-th order near-orthogonal codes. IEEE Trans IT 15:116-117
    • (1971) IEEE Trans IT , vol.15 , pp. 116-117
    • Reed, I.S.1    Stewart, R.M.2
  • 11
    • 0021574004 scopus 로고
    • A survey of one-coincidence sequences for frequency-hopped spread-spectrum systems
    • Sharr AA, Davies PA (1984) A survey of one-coincidence sequences for frequency-hopped spread-spectrum systems. IEE Proc Part F 131:719-724
    • (1984) IEE Proc Part F , vol.131 , pp. 719-724
    • Sharr, A.A.1    Davies, P.A.2
  • 12
    • 0019595373 scopus 로고
    • Time frequency hop signals, Part I: Coding based upon the theory of linear congruences
    • Titlebaum EL (1981) Time frequency hop signals, Part I: coding based upon the theory of linear congruences. IEEE Trans AES-17:490-493
    • (1981) IEEE Trans AES-17 , pp. 490-493
    • Titlebaum, E.L.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.