Random multiple access in a vector disjunctive channel

Tsybakov, B.S. and Mikhailov, V.A., Free Synchronous Packet Access in a Broadcast Channel with Feedback, Probl. Peredachi Inf., 1978, vol. 14, no. 4, pp. 32–59 [Probl. Inf. Trans. (Engl. Transl.), 1978, vol. 14, no. 4, pp. 259–280].

Tsybakov, B.S. and Likhanov, N.B., Upper Bound on the Capacity of a Random Multiple-Access System, Probl. Peredachi Inf., 1987, vol. 23, no. 3, pp. 64–78 [Probl. Inf. Trans. (Engl. Transl.), 1987, vol. 23, no. 3, pp. 224–236].

Tsybakov, B.S. and Mikhailov, V.A., Random Multiple Packet Access: Part-and-Try Algorithm, Probl. Peredachi Inf., 1980, vol. 16, no. 4, pp. 65–79 [Probl. Inf. Trans. (Engl. Transl.), 1980, vol. 16, no. 4, pp. 305–317].

Vvedenskaya, N.D. and Pinsker, M.S., Bounds on the Capacity of FCFS Multiple-Access Algorithms, Probl. Peredachi Inf., 1990, vol. 26, no. 1, pp. 58–67 [Probl. Inf. Trans. (Engl. Transl.), 1990, vol. 26, no. 1, pp. 49–56].

Yingqun, Y. and Giannakis, G.B., High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm, IEEE Trans. Inform. Theory, 2007, vol. 53, no. 12, pp. 4628–4639.

Andreev, S.D., Pustovalov, E.V., and Turlikov, A.M., A Tree-like Conflict Resolution Algorithm That Is Stable under Incomplete Interference Damping, Avtomat. i Telemekh., 2009, vol. 70, no. 3, pp. 78–96 [Autom. Remote Control (Engl. Transl.), 2009, vol. 70, no. 3, pp. 417–433].

Van Houdt, B. and Peeters, G.T., FCFS Tree Algorithms with Interference Cancellation and Single Signal Memory Requirements, in Proc. 2008 Int. Conf. on Telecommunications (ICT’08), St. Petersburg, Russia, 2008, pp. 1–6.

Chang, S.C. and Wolf, J.K., On the T -User M-Frequency Noiseless Multiple Access Channel with and without Intensity Information, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 1, pp. 41–48.

Osipov, D.S., Frolov, A.A., and Zyablov, V.V., Multiple Access System for a Vector Disjunctive Channel, Probl. Peredachi Inf., 2012, vol. 48, no. 3, pp. 52–59 [Probl. Inf. Trans. (Engl. Transl.), 2012, vol. 48, no. 3, pp. 243–249].

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

Hammond, J.L., Brown, J.E., and Liu, S.S., Development of a Transmission Error Model and an Error Control Model, Tech. Rep. of Rome Air Development Center, Griffiss Air Force Base, New York, 1975, no. RADC-TR-75-138.

Tsybakov, B.S., Survey of USSR Contributions to Random Multiple-Access Communications, IEEE Trans. Inform. Theory, 1985, vol. 31, no. 2, pp. 143–165.

Capetanakis, J.I., Tree Algorithms for Packet Broadcast Channels, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 5, pp. 505–515.

Molle, M.L. and Polyzos, G.C., Conflict Resolution Algorithms and Their Performance Analysis, Tech. Rep. of Dept. of Computer Science and Engineering, Univ. of California, San Diego, 1993, no. CS93-300.

VII All-Union School on Information Theory and Coding Theory, Probl. Peredachi Inf., 1980, vol. 16, no. 3, p. 111.

D’yachkov, A.G. and Rykov, V.V., On One Application of Codes for a Multiple Access Channel in the ALOHA System, in Proc. VI All-Union School-Seminar on Computer Networks, Moscow-Vinnitsa, 1981, Part 4, pp. 18–24.