Multiple access system for a vector disjunctive channel

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.

   Article  MathSciNet  MATH  Google Scholar 

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].

   MathSciNet  Google Scholar 

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].

   MathSciNet  Google Scholar 

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. 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.

   Article  MATH  Google Scholar 

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].

   MathSciNet  Google Scholar 

7. Zigangirov, K.Sh., Theory of Code Division Multiple Access Communication, Piscataway: Wiley — IEEE Press, 2004.

   Book  Google Scholar 

Download references