Upper bounds and constructions of complete asynchronous channel hopping systems

DOI10.1007/S12095-018-0295-4zbMath1409.94852OpenAlexW2793955459WikidataQ130118955 ScholiaQ130118955MaRDI QIDQ1733983

Xianqiang Yang

Publication date: 22 March 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-018-0295-4

zbMATH Keywords

projective planedifference setcognitive radio networkblind rendezvoushopping sequence

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Applications of design theory to circuits and networks (94C30) Channel models (including quantum) in information and communication theory (94A40)

Related Items (1)

Multiple factorizations of cyclic groups

Cites Work

• Quorum systems towards an asynchronous communication in cognitive radio networks
• Tiling groups with difference sets
• Asynchronous channel hopping systems from difference sets
• Multiple factorizations of cyclic groups
• Finite geometry and character theory
• Combinatorial problems in finite fields and Sidon sets
• Recent progress in algebraic design theory
• Handbook of Finite Fields
• Cyclotomic integers and finite geometry
• Cayley Graphs of Diameter Two from Difference Sets
• Relative difference sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds and constructions of complete asynchronous channel hopping systems