|
|||||
|
|
Signature codes for noisy multiple access adder channel |
|
| Authors: | Vladimir Gritsenko Grigory Kabatiansky Vladimir Lebedev Alexey Maevskiy |
| Affiliation: | 1.Institute for Information Transmission Problems,RAS,Moscow,Russia |
| Abstract: | We prove new lower bounds on the rate of codes for noisy multiple access adder channel and discuss its application to the well-known coin weighing problem in the case when some measurements are incorrect. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |