• DocumentCode
    3619879
  • Title

    Signature coding for OR channel with asynchronous access

  • Author

    S. Gyori

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Theor., Budapest Univ. of Technol. & Econ., Hungary
  • fYear
    2005
  • fDate
    6/27/1905 12:00:00 AM
  • Firstpage
    2040
  • Lastpage
    2044
  • Abstract
    Signature coding for multiple access OR channel is considered. We prove that in block asynchronous case the upper bound on the minimum code length asymptotically is the same as in the case of synchronous access
  • Keywords
    "Upper bound","Envelope detectors","Decoding","Viterbi algorithm","Demodulation","Communication systems","Time sharing computer systems","Government"
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
  • ISSN
    2157-8095
  • Print_ISBN
    0-7803-9151-9
  • Electronic_ISBN
    2157-8117
  • Type

    conf

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