Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24265504

New Constructions for Optimal Sets of Frequency-Hopping Sequences

Author
ZHENGCHUN ZHOU1 2 ; XIAOHU TANG2 ; DAIYUAN PENG2 ; PARAMPALLI, Udaya3
[1] School of Mathematics, Southwest Jiaotong University, Chengdu, 610031, China
[2] Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, 610031, China
[3] Department of Computer Science and Software Engineering, University of Melbourne, VIC 3010, Australia
Source

IEEE transactions on information theory. 2011, Vol 57, Num 6, pp 3831-3840, 10 p ; ref : 31 ref

CODEN
IETTAW
ISSN
0018-9448
Scientific domain
Telecommunications
Publisher
Institute of Electrical and Electronics Engineers, New York, NY
Publication country
United States
Document type
Article
Language
English
Author keyword
Frequency-hopping sequence (FHS) Hamming correlation cyclotomy d-form function frequency-hopping spread spectrum
Keyword (fr)
Communication saut fréquence Complexité linéaire Distance Hamming Spectre fréquence Spectre étalé Séquence m
Keyword (en)
Frequency hop communication Linear complexity Hamming distance Frequency spectrum Spread spectrum M-sequences
Keyword (es)
Complejidad lineal Distancia Hamming Espectro frecuencia Espectro ensanchado
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A03 Information theory

Discipline
Telecommunications and information theory
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
24265504

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web