Coding for a multiple access OR channel: A survey

  • Authors:

  • Sándor Gyri

  • Affiliations:

  • Department of Computer Science and Information Theory, Budapest University of Technology and Economics, ö Magyar tudósok körútja 2., H-1117 Budapest, Hungary

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2008

Quantified Score

Hi-index 0.04

Visualization

Abstract

The signature coding for M active users out of T total users over a multiple access OR channel is considered. The mathematical problem is equivalent to the M-cover-free problem of extremal set theory. We survey the upper and lower bounds on the minimal code word length n(T,M), and present some code constructions. According to the current state of the theory, for 1@?M@?T12M^2logMlogT=