Optimum PN Sequences for CDMA Systems

DOI10.1007/978-1-4615-2251-5_4zbMath1415.94019OpenAlexW2095675264MaRDI QIDQ5227619

Dilip V. Sarwate

Publication date: 7 August 2019

Published in: Code Division Multiple Access Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4615-2251-5_4

zbMATH Keywords

cyclic codecyclic shiftprimitive elementCDMA systemSolomon code

Mathematics Subject Classification ID

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

Related Items (2)

Disjoint difference families and their applications ⋮ Improved singleton bound on frequency hopping sequences and optimal constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Code sequences for frequency-hopping multiple-access systems
• On cyclic MDS codes of length q over GF(q) (Corresp.)
• Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks
• Bayesian methods for erasure insertion in frequency-hop communication systems with partial-band interference
• On the nonperiodic cyclic equivalence classes of Reed-Solomon codes
• Families of sequences with optimal Hamming-correlation properties
• kth-Order Near-Orthogonal Codes (Corresp.)

This page was built for publication: Optimum PN Sequences for CDMA Systems