Signature codes for noisy multiple access adder channel

Vladimir Gritsenko, Grigory Kabatiansky, Vladimir Lebedev, Alexey Maevskiy

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)293-299
Number of pages7
JournalDesigns, Codes, and Cryptography
Volume82
Issue number1-2
DOIs
Publication statusPublished - 1 Jan 2017
Externally publishedYes

Keywords

  • Group testing
  • Multiple access adder channel
  • Non-adaptive search of counterfeit coins
  • Signature codes

Fingerprint

Dive into the research topics of 'Signature codes for noisy multiple access adder channel'. Together they form a unique fingerprint.

Cite this