Coding for a multiple access OR channel: A survey |
| |
Authors: | Sndor Gyri |
| |
Institution: | aDepartment of Computer Science and Information Theory, Budapest University of Technology and Economics, ö Magyar tudósok körútja 2., H-1117 Budapest, Hungary |
| |
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 1MTso there is a huge gap between the upper and lower bounds. Moreover, there is no known construction approaching the upper bound. |
| |
Keywords: | Multiple access OR channel Minimum code length Bounds Code constructions |
本文献已被 ScienceDirect 等数据库收录! |
|