Signature coding and information transfer for the multiple access adder channel

László Györfi, Bálint Laczay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We deal with the coding problem of the multiple-access adder channel, considering both the identification of the active users and decoding of their messages. We examine the bounds on the minimal length of codes solving these tasks. We examine codes solving both tasks simultaneously, and we give asymptotic upper and lower bounds on the length of the shortest possible code. Our new bounds are quite similar to the bounds known for the identification task only. The difference between the upper and lower bounds is a factor of two.

Original languageEnglish
Title of host publication2004 IEEE Information Theory Workshop - Proceedings, ITW
Pages242-246
Number of pages5
Publication statusPublished - Dec 1 2004
Event2004 IEEE Information Theory Workshop - Proceedings, ITW - San Antonio, TX, United States
Duration: Oct 24 2004Oct 29 2004

Publication series

Name2004 IEEE Information Theory Workshop - Proceedings, ITW

Other

Other2004 IEEE Information Theory Workshop - Proceedings, ITW
CountryUnited States
CitySan Antonio, TX
Period10/24/0410/29/04

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Signature coding and information transfer for the multiple access adder channel'. Together they form a unique fingerprint.

  • Cite this

    Györfi, L., & Laczay, B. (2004). Signature coding and information transfer for the multiple access adder channel. In 2004 IEEE Information Theory Workshop - Proceedings, ITW (pp. 242-246). (2004 IEEE Information Theory Workshop - Proceedings, ITW).