Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algebraic Coding

Algebraic Coding 1991: Algebraic Coding pp 151–158Cite as

Decoding for multiple-access channels

  • Conference paper
  • First Online:

  • 169 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 573))

Abstract

We discuss some results in coding and decoding for multiple-access channels. A new approach to choosing codes and users' energies for that channel is described. For the case when a bit error probability and a decoding complexity are fixed we construct a region of achievable code rates.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.Mathys. “A class of codes for a T active users out of N multiple-access communication system”, IEEE, Trans. Inform. Theory, vol.36, no.6, Nov.1990.

    Google Scholar 

  2. R.Lupas and S.Verdu. “Linear multiuser detectors for synchronous code-division multiple-access channels”, IEEE, Trans. Inform. Theory., vol.35, no.1, pp. 123–136, Jan. 1989.

    Google Scholar 

  3. S.Verdu. “Minimum probability of error for asynchronous Gaussian multiple-access channels”, IEEE Trans. Inform. Theory, vol.IT-32, no.1, pp.85–96, Jan.1986.

    Article  Google Scholar 

  4. S.C.Chang, E.J.Weldon,Jr. “Coding for T-user multiple-access channels”, IEEE Trans. Inform. Theory, vol. IT-25, no.6, p.684–691, Nov.1979.

    Google Scholar 

  5. S.C.Chang. “Further results on coding for T-user multiple-access channels”, IEEE Trans. Inform. Theory, vol. IT-30, no.2, pp.411–415, Mar. 1984.

    Google Scholar 

  6. I.E.Bocharova, F.A.Taubin.“ Generalized correlation metric for decoding in a multiple-access channel”, Problems Info. Trans., vol.26, no.2, pp.38–44, 1990.

    Google Scholar 

  7. I.E.Bocharova. “Generating functions for a class of high rate convolutional codes,” II International Workshop “Algebraic and combinatorial coding theory,” 16–22 September, 1990, pp.38–41.

    Google Scholar 

  8. I.E.Bocharova. “Almost orthogonal codes for orthogonal signals,” Fifth Joint Soviet-Swedish International Workshop on Information theory, “Convolutional codes; multi-user communication,” 13–19 January, 1991, pp.25–28.

    Google Scholar 

  9. I.E.Bocharova, B.D.Kudryashov “Convolutional codes for data transmission using orthogonal signals, ” Proc. International Symposium “Satellite communication: Present and Future,” October 1–5, 1990, pp.b.12.1–b.12.10.

    Google Scholar 

  10. A.N.Trofimov, F.A.Taubin “Bound on decoding error probability for channel with multiple access and interference,” Problems Info. Trans., vol.22, no.3, pp.3–15, 1986.

    Google Scholar 

  11. G.C.Clark,Jr. and J.Cain “Error-correction coding for digital communications,” Plenum Press, New York, 1981.

    Google Scholar 

  12. A.J.Viterbi, J.K. Omura “Principles of digital communications and coding,” New York McGraw-Hill Book company, 1979.

    Google Scholar 

  13. A.J. Viterbi, I. M. Jacobs “Advances in coding and modulation for non-coherent channels affected by fading, partial band and multiple-access interference,” Advances in communication systems, vol.4, New York: Academic, pp.279–308, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leningrad Aircraft Equipment Institute, Hertsen str. 67, 190000, Leningrad, USSR

    Irina E. Bocharova

Authors
  1. Irina E. Bocharova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Antoine Lobstein Gilles Zémor Simon Litsyn

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bocharova, I.E. (1992). Decoding for multiple-access channels. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034352

Download citation

  • DOI: https://doi.org/10.1007/BFb0034352

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55130-0

  • Online ISBN: 978-3-540-46739-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation