On codes for multiple access adder channel with noise and feedback
Résumé
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.
Domaines
Théorie de l'information [cs.IT]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...