• DocumentCode
    2052033
  • Title

    Generalized binary Udaya-Siddiqi sequences

  • Author

    Tang, Xiaohu ; Udaya, Parampalli ; Fan, Pingzhi

  • Author_Institution
    Inst. of Mobile Commun., Jiao Tong Univ., Chengdu, China
  • fYear
    2004
  • fDate
    27 June-2 July 2004
  • Firstpage
    84
  • Abstract
    This paper presents the generalized Udaya Sidiqi sequences which are the interleaved version of Gold like binary sequences of period satisfying the Welch bound maximum out of phase correlations. The sequences have large linear complexity and low correlations and are useful in code division multiple access (CDMA) communication systems and cryptography. A direct method to compute the correlation using the trace sequence representation and a sequence from a quadratic form are presented.
  • Keywords
    binary sequences; code division multiple access; cryptography; interleaved codes; CDMA; Gold like binary sequence; Welch bound; code division multiple access communication system; cryptography; generalized binary Udaya-Siddiqi sequence; maximum out of phase correlation; quadratic form sequence; sequence complexity; trace sequence representation; Australia Council; Binary sequences; Communication systems; Computer science; Cryptography; Gold; Mobile communication; Multiaccess communication; Polynomials; Software engineering;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
  • Print_ISBN
    0-7803-8280-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2004.1365123
  • Filename
    1365123