Asynchronous channel hopping systems from difference sets
From MaRDI portal
Publication:517275
DOI10.1007/S10623-016-0221-8zbMath1366.05016OpenAlexW2386190187MaRDI QIDQ517275
Publication date: 23 March 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-016-0221-8
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)
Related Items (2)
Upper bounds and constructions of complete asynchronous channel hopping systems ⋮ Multiple factorizations of cyclic groups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar functions over fields of characteristic two
- Tiling groups with difference sets
- Perfect and almost perfect sequences
- A unifying construction for difference sets
- The Magma algebra system. I: The user language
- Finite geometry and character theory
- On \((2n,2,2n,n)\) relative difference sets
- On \((p^ a,p,p^ a,p^{a-1})\)-relative difference sets
- Cyclic difference sets
- Recent progress in algebraic design theory
- Handbook of Finite Fields
- Sequences and Functions Derived from Projective Planes and Their Difference Sets
- Cyclotomic integers and finite geometry
- Relative difference sets
This page was built for publication: Asynchronous channel hopping systems from difference sets