Chaotic Sequences for Secure CDMA

Simple item page
dc.creatorSuneel, Madhekar
dc.date2006-02-09
dc.date.accessioned2026-07-07T07:03:55Z
dc.date.available2026-07-07T07:03:55Z
dc.descriptionOne family each of repetitive and non-repetitive spreading sequences for secure Direct Sequence Spread Spectrum communication are obtained from the logistic map. The repetitive sequences are perfectly balanced and are found to have sufficient linear complexity. Applicability of both the families to CDMA communication is studied by examining their cross-correlation performance. The cross-correlation is found to be comparable to and only rarely worse than that of Gold sequences.
dc.description4 pages, PDF format, Presented at the 3rd National Conference on Nonlinear Systems and Dynamics (NCNSD-2006), Ramanujan Institute for Advanced Study in Mathematics, Chennai, 6-8 February 2006
dc.identifierhttps://arxiv.org/abs/nlin/0602018
dc.identifierhttp://arxiv.org/abs/nlin/0602018
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109163
dc.subjectChaotic Dynamics
dc.titleChaotic Sequences for Secure CDMA
dc.typetext

Files

Collections

arXiv