Random Time and Frequency Hopping for Infinite User Population

DOI10.1007/978-1-4615-2694-0_9MaRDI QIDQ4857228zbMATH OpenOpenAlexFDO

Authors Sandor Csibi, László Györfi

Publication date 2 September 1996

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

Full work available at URL https://doi.org/10.1007/978-1-4615-2694-0_9

zbMATH Keywords

decoding error probabilityfrequency hoppingmultiaccess collision channelsReed-Solomon codestime hoppingupper bounds

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Communication theory (94A05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Error probability in coding theory (94B70)

Recommendations

• Spectral Efficiency of Random Time-Hopping CDMA
• Pseudo-chaotic time hopping for UWB impulse radio
• Limiting performance of frequency-hop random access
• Coding and Cryptography
• Random multiple access with known appearance times of successfully transmitted packets
• Code sequences for frequency-hopping multiple-access systems
• Random sign repetition time-hopping UWB with multiuser detection
• Randomized and nonrandomized algorithms of random multiple access
• Sets of Optimal Frequency-Hopping Sequences
• Optimal Frequency-Hopping Sequences With New Parameters

Cited in

(4)

• Limiting performance of frequency-hop random access
• User-irrepressible sequences
• Modulation and coding for the Gaussian collision channel
• Hit statistics in FH-CDMA unslotted packet networks

This page was built for publication: Random Time and Frequency Hopping for Infinite User Population

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