Skip to main content
SpringerLink
Log in

Signature codes for noisy multiple access adder channel

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gyorfi L., Gyori S., Laczay B., Ruszinko M.: Lectures on multiple access channels. http://www.szit.bme.hu/~gyori/AFOSR-05/book.pdf.

  2. Gritsenko V., Kabatiansky G., Lebedev V., Maevskiy A.: Oncodes for multiple access adder channel with noise and feedback. In: Proceedings of the Ninth International Workshop on Coding and Cryptography (WCC-2015), Paris (2015).

  3. Erdos P., Renyi A.: On two problems of information theory. Publ. Math. Inst. Hung. Acad. Sci. 8, 241–254 (1963).

  4. Lindstrom B.: On a combinatorial detection problem, I. Publ. Math. Inst. Hung. Acad. Sci. 9, 195–207 (1964).

  5. Cantor D., Mills W.: Determining a subset from a certain combinatorial properties. Can. J. Math. 18, 42–48 (1966).

  6. Chang S.C., Weldon E.J.: Coding for \(T\)-user multiple access channels. IEEE Trans. Inf. Theory 25(6), 684–691 (1979).

  7. Harary F., Meter R.: On the metric dimension of a graph. Ars Comb. 2, 191–195 (1976).

  8. Slatter P.: Leaves on trees. Cong. Numer. 14, 549–599 (1975).

  9. Kabatianski G., Lebedev V., Thorpe J.: The Mastermind game andthe rigidity of the Hamming space. In: Proceedings on IEEE International Symposium on Information Theory, Sorrento (2000).

  10. Lindstrom B.: On \(B_{2}\)-sequences of vectors. J. Number Theory 4, 261–265 (1972).

  11. Cohen G., Litsyn S., Zemor G.: Binary B2-sequences: a new upper bound. J. Comb. Theory Ser. A 94(1), 152155 (2001).

  12. Gargano L., Montuori V., Setaro G., Vacaro U.: An improved algorithm for quantative group testing. Discret. Appl. Math. 36, 299306 (1992).

  13. MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).

  14. Dyachkov A.A., Rykov V.V.: On a coding model for a multiple-access adder channel. Probl. Inf. Trans. 17(2), 94–104 (1981).

  15. Poltyrev G.S.: Improved upper bound on the probability of decoding error for codes of complex structure. Probl. Inf. Trans. 23(4), 251–262 (1987).

  16. Cheng J., Watanabe Y.: A multiuser \(k\)-ary codes for the noisy multiple-access adder channel. IEEE Trans. Inf. Theory 47(6), 2603–2607 (2001).

  17. Khachatryan G.G.: \(\sigma \)-decodable code construiction for a \(T\)-user adder channel. Probl. Inf. Trans. 24(2), 159–163 (1988).

  18. Malyutov M.: Search for sparse active inputs: a review. Inf. Theory Comb. Search Theory 7777, 609–647 (2014).

  19. Bshouty N.H., Mazzawi H.: Algorithms for the coin weighing problem with the presence of noise. Electron. Colloq. Comput. Complex. Rep. 18, 124 (2011).

  20. Donoho D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006).

  21. Candes E.J., Tao T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52(4), 5406–5425 (2006).

  22. Vladuts S.G., Kabatiansky G.A., Lomakov V.V.: On error-correction under distortions in channel and syndrom. Probl. Inf. Trans. 52(2), 132–138 (2015).

  23. Ulam S.M.: Adventures of Mathematician. Scribner’s, New York (1976).

  24. Pelc A.: Solution of Ulam’s problem on searching with a lie. J. Comb. Theory Ser. A 44, 129–140 (1987).

  25. Yekhanin S., Dumer I.: Long nonbinary codes exceeding the Gilbert Varshamov bound for any fixed distance. IEEE Trans. Inf. Theory 50(10), 2357–2362 (2004).

Download references

Acknowledgments

The research was carried out at the IITP RAS and supported by the Russian Science Foundation (project 14-50-00150).

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems, RAS, Moscow, Russia

    Vladimir Gritsenko, Grigory Kabatiansky, Vladimir Lebedev & Alexey Maevskiy

Authors
  1. Vladimir Gritsenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grigory Kabatiansky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vladimir Lebedev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexey Maevskiy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Grigory Kabatiansky.

Additional information

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gritsenko, V., Kabatiansky, G., Lebedev, V. et al. Signature codes for noisy multiple access adder channel. Des. Codes Cryptogr. 82, 293–299 (2017). https://doi.org/10.1007/s10623-016-0228-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-016-0228-1

Keywords

Mathematics Subject Classification

Search

Navigation