Advertisement

Problems of Information Transmission

, Volume 48, Issue 3, pp 243–249 | Cite as

Multiple access system for a vector disjunctive channel

  • D. S. Osipov
  • A. A. Frolov
  • V. V. Zyablov
Coding Theory

Abstract

We address the problem of constructing a multiple access system for a disjunctive vector channel, similar to a multiuser channel without intensity information as described in [1]. To solve the problem, a signal-code construction based on nonbinary codes is proposed. For the resulting multiple access system, a lower bound on the relative group rate is derived. The bound coincides asymptotically with an upper bound.

Keywords

Binary Vector Information Transmission Code Division Multiple Access Intensity Information Multiple Access System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chang, S.-C. and Wolf, J.K., On the T -User M-Frequency Noiseless Multiple-Access Channels with and without Intensity Information, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 1, pp. 41–48.MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Wilhelmsson, L. and Zigangirov, K.Sh., On the Asymptotic Capacity of a Multiple-Access Channel, Probl. Peredachi Inf., 1997, vol. 33, no. 1, pp. 12–20 [Probl. Inf. Trans. (Engl. Transl.), 1997, vol. 33, no. 1, pp. 9–16].MathSciNetGoogle Scholar
  3. 3.
    Bassalygo, L.A. and Pinsker, M.S., Evaluation of the Asymptotics of the Summarized Capacity of an M-Frequency T-User Noiseless Multiple-Access Channel, Probl. Peredachi Inf., 2000, vol. 36, no. 2, pp. 3–9 [Probl. Inf. Trans. (Engl. Transl.), 2000, vol. 36, no. 2, pp. 91–97].MathSciNetGoogle Scholar
  4. 4.
    Gober, P. and Han Vinck, A.J., Note on “On the Asymptotic Capacity of a Multiple-Access Channel” by L. Wilhelmsson and K.Sh. Zigangirov, Probl. Peredachi Inf., 2000, vol. 36, no. 1, pp. 21–25 [Probl. Inf. Trans. (Engl. Transl.), 2000, vol. 36, no. 1, pp. 19–22].Google Scholar
  5. 5.
    Han Vinck, A.J. and Keuning, J., On the Capacity of the Asynchronous T -User M-Frequency Noiseless Multiple-Access Channel without Intensity Information, IEEE Trans. Inform. Theory, 1996, vol. 42, no. 6, pp. 2235–2238.CrossRefMATHGoogle Scholar
  6. 6.
    Bassalygo, L.A., A Model of Restricted Asynchronous Multiple Access in the Presence of Errors, Probl. Peredachi Inf., 2009, vol. 45, no. 1, pp. 41–50 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 1, pp. 37–45].MathSciNetGoogle Scholar
  7. 7.
    Zigangirov, K.Sh., Theory of Code Division Multiple Access Communication, Piscataway: Wiley — IEEE Press, 2004.CrossRefGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2012

Authors and Affiliations

  1. 1.Kharkevich Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations