• DocumentCode
    2256960
  • Title

    An upper bound for extended Kloosterman sums over Galois rings

  • Author

    Shanbhag, Abhijit G. ; Kumar, P. Vijay ; Helleseth, Tor

  • Author_Institution
    Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    1995
  • fDate
    17-22 Sep 1995
  • Firstpage
    88
  • Abstract
    An upper bound for the extended Kloosterman sum over Galois rings is derived. This bound is then used to construct new, efficient sequence families with prime-power phase. These sums lead to new sequence designs for CDMA applications
  • Keywords
    Galois fields; code division multiple access; codes; sequences; CDMA applications; Galois rings; extended Kloosterman sums; prime-power phase; sequence families; upper bound; Additives; Councils; Informatics; Multiaccess communication; Polynomials; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
  • Conference_Location
    Whistler, BC
  • Print_ISBN
    0-7803-2453-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1995.531292
  • Filename
    531292
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2256960