Multiple Access Channels

T. Ericson, L. Györfi (1988) "Superimposed codes in Rn" IEEE Trans. on Information Theory, IT-34, pp. 877- 880 PDF

Nguyen Quang A, L. Györfi, J. L. Massey (1992) "Constructions of binary constant-weight cyclic codes and cyclically permutable codes", IEEE Trans. Information Theory, 38, pp. 940-949. PDF

L. Györfi, I. Vajda (1993) "Constructions of protocol sequences for multiple access collision channel" IEEE Trans. Information Theory, 39, pp. 1762-1765. PDF

L. Györfi, S. Gyõri (2005) "Analysis of collision channel with asynchronous access", IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, Special Issue on Information Theory and its Applications, E88-A, pp. 2878-2884.

L. Györfi, S. Gyõri (2005) "Analysis of tree algorithm for collision resolution", in Proceedings of the 2005 International Conference on the Analysis of Algorithms, pp. 355--362, Barcelona, Spain. PDF

L. Györfi, S. Gyõri (2007) "Coding for multiple access collision channel without feedback," in Multiple Access Channels: Theory and Practice, E. Biglieri, L. Györfi, (Eds.), IOS Press, pp. 299-326.

L. Györfi, S. Gyõri, J. L. Massey (2007) "Principles of stability analysis for random accessing with feedback," in Multiple Access Channels: Theory and Practice, E. Biglieri, L. Györfi, (Eds.), IOS Press, pp. 214-249.