Upper bounds and constructions of complete asynchronous channel hopping systems

DOI10.1007/S12095-018-0295-4MaRDI QIDQ1733983zbMATH OpenOpenAlexWikidataFDO

Authors 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

blind rendezvouscognitive radio networkdifference sethopping sequenceprojective plane

Mathematics Subject Classification ID

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

Recommendations

• Asynchronous channel hopping systems from difference sets
• Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches
• On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels
• On capacity regions of discrete asynchronous multiple access channels
• Synchronous concurrent broadcasts for intermittent channels with bounded capacities
• The capacity region of the totally asynchronous multiple-access channel
• An Overview of Capacity Results for Synchronization Channels
• Capacity bounds for a channel with synchronization errors
• Asynchronous CDMA Systems With Random Spreading—Part I: Fundamental Limits
• On the Capacity of Channels With Timing Synchronization Errors

Cites work

• Asynchronous channel hopping systems from difference sets
• Cayley graphs of diameter 2 from difference sets
• Combinatorial problems in finite fields and Sidon sets
• Cyclotomic integers and finite geometry
• Finite geometry and character theory
• Handbook of finite fields
• scientific article; zbMATH DE number 3790437 (Why is no real title available?)
• scientific article; zbMATH DE number 3458752 (Why is no real title available?)
• scientific article; zbMATH DE number 1066161 (Why is no real title available?)
• scientific article; zbMATH DE number 1182716 (Why is no real title available?)
• scientific article; zbMATH DE number 204179 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• scientific article; zbMATH DE number 3103352 (Why is no real title available?)
• Multiple factorizations of cyclic groups
• Quorum systems towards an asynchronous communication in cognitive radio networks
• Recent progress in algebraic design theory
• Relative difference sets
• Tiling groups with difference sets

Cited in

(3)

• Asynchronous channel hopping systems from difference sets
• Multiple factorizations of cyclic groups
• Small examples of mosaics of combinatorial designs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733983)