Code sequences for frequency-hopping multiple-access systems

DOI10.1109/26.469446zbMATH Open0978.94501OpenAlexW2128851999MaRDI QIDQ2726182

István Vajda

Publication date: 12 July 2001

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/26.469446

zbMATH Keywords

Reed-Solomon codesconstructioncyclic concatenationslow frequency-hopping multiple-access channels

Mathematics Subject Classification ID

Cyclic codes (94B15) Communication theory (94A05)

Related Items (6)

Random Time and Frequency Hopping for Infinite User Population ⋮ Title not available (Why is that?) ⋮ Low-Correlation, High-Nonlinearity Sequences for Multiple-Code CDMA ⋮ A new family of one-coincidence sets of sequences with dispersed elements for frequency hopping CDMA systems ⋮ Generation and characterization of orthogonal FH sequences for the cognitive network ⋮ Optimum PN Sequences for CDMA Systems

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Multi channel frequency hopping spread spectrum signaling using code \(M\)-ary frequency shift keying 👍 👎
• Large families of sequences for CDMA, frequency hopping, and UWB 👍 👎
• Frequency Hopping Sequences With Optimal Partial Autocorrelation Properties 👍 👎
• Sets of Optimal Frequency-Hopping Sequences 👍 👎
• One-coincidence sequences with specified distance between adjacent symbols for frequency-hopping multiple access 👍 👎
• The capacities of frequency-hopped code-division multiple-access channels 👍 👎
• Multiuser demodulation and iterative decoding for frequency-hopped networks 👍 👎

This page was built for publication: Code sequences for frequency-hopping multiple-access systems

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