On codes for multiple access adder channel with noise and feedback
Abstract
We prove a better than previously known lower bound on the rate of codes for multiple access adder channel with noise and discuss its application to well-known coin weighing problem with not exact measurements.
Domains
Information Theory [cs.IT]
Origin : Files produced by the author(s)
Loading...