Geodesic
On capacity regions of discrete asynchronous multiple access channels
Kybernetika, Tome 50 (2014) no. 6, pp. 1003-1031
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. The main result is the single letter characterization of the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. The main result is the single letter characterization of the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.
DOI : 10.14736/kyb-2014-6-1003
Classification : 94A15, 94A24, 94A40
Keywords: partly asynchronous; delay; multiple-access; rate splitting; successive decoding 
@article{10_14736_kyb_2014_6_1003,
     author = {Farkas, L\'or\'ant and K\'oi, Tam\'as},
     title = {On capacity regions of discrete asynchronous multiple access channels},
     journal = {Kybernetika},
     pages = {1003--1031},
     year = {2014},
     volume = {50},
     number = {6},
     doi = {10.14736/kyb-2014-6-1003},
     mrnumber = {3301783},
     zbl = {06416871},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2014-6-1003/}
}
TY  - JOUR
AU  - Farkas, Lóránt
AU  - Kói, Tamás
TI  - On capacity regions of discrete asynchronous multiple access channels
JO  - Kybernetika
PY  - 2014
SP  - 1003
EP  - 1031
VL  - 50
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2014-6-1003/
DO  - 10.14736/kyb-2014-6-1003
LA  - en
ID  - 10_14736_kyb_2014_6_1003
ER  - 
%0 Journal Article
%A Farkas, Lóránt
%A Kói, Tamás
%T On capacity regions of discrete asynchronous multiple access channels
%J Kybernetika
%D 2014
%P 1003-1031
%V 50
%N 6
%U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2014-6-1003/
%R 10.14736/kyb-2014-6-1003
%G en
%F 10_14736_kyb_2014_6_1003
Farkas, Lóránt; Kói, Tamás. On capacity regions of discrete asynchronous multiple access channels. Kybernetika, Tome 50 (2014) no. 6, pp. 1003-1031. doi: 10.14736/kyb-2014-6-1003

[1] Ahlswede, R.: Multi-way communication channels. In: Proc. 2nd International Symposium on Information Theory, Tsahkadsor, Armenian SSR (1971), Akadémiai Kiadó, Budapest, pp. 23-52. | MR | Zbl

[2] Bierbaum, M., Wallmeier, H. M.: A note on the capacity region of the multi-access channel. IEEE Trans. Inform. Theory 25 (1979), 484. | DOI

[3] Cover, T. M., McEliece, R. J., Posner, E. C.: Asynchronous multiple-acces channel capacity. IEEE Trans. Inform. Theory 27 (1981), 409-413. | DOI | MR

[4] Csiszár, I., Körner, J.: Information theory, Coding theorems for Discrete Memoryless Systems Second edition. Cambridge University Press, Cambridge 2011. | MR

[5] Farkas, L., Kói, T.: Capacity region of discrete asynchronous multiple access channels. Int. Symp. Inform. Theory Proc. (ISIT) 19 (2011), 2273-2277.

[6] Farkas, L., Kói, T.: Capacity regions of partly asynchronous multiple access channels. Int. Symp. Inform. Theory Proc. (ISIT) 20 (2012), 3018-3022.

[7] Gamal, A. El, Kim, Y.-H.: Network Information Theory. Cambridge University Press, Cambridge 2012 | MR | Zbl

[8] Grant, A. J., Rimoldi, B., Urbanke, R. L., Whiting, P. A.: Rate-splitting multiple acces for discrete memoryless channels. IEEE Trans. Inform. Theory 47 (2001), 873-890. | DOI | MR

[9] Gray, R. M.: Sliding-block joint source/noisy-channel coding theorems. IEEE Trans. Inform. Theory 22 (1976), 682-690. | DOI | MR | Zbl

[10] Hanly, S., Whiting, P.: Constraints on capacity in a multi-user channel. Int. Symp. Inform. Theory Proc. (ISIT) 4 (1994), 54.

[11] Hui, J. Y. N., Humblet, P. A.: The capacity region of the totally asynchronous multiple-access channel. IEEE Trans. Inform. Theory 31 (1985), 207-216. | DOI | Zbl

[12] Liao, H.: Multiple Access Channels. Ph.D. Dissertation, Dept. Elec. Eng., Univ. Hawai, Honolulu 1972.

[13] Rimoldi, B.: Generalized time sharing: A low-complexity capacity-achieving multiple-access technique. IEEE Trans. Inform. Theory 47 (2001), 2432-2442. | DOI | MR | Zbl

[14] Tse, D., Hanly, S.: Multi-access fading channels - Part I: Polymatroid structure, optimal resource allocation and throughput capacities. IEEE Trans. Inform. Theory 44 (1998), 2796-2815. | DOI | MR

[15] Poltyrev, G. Sh.: Coding in an asynchronous multiple-access channel. Problemy Peredachi Informatsii 19 (1983), 12-21. | MR | Zbl

[16] Polyanskiy, Y.: On asynchronous capacity and dispersion. In: 46th Annual Conference on Information Sciences and Systems (CISS) (2012), pp. 1-6.

[17] Tchamkerten, A., Chandar, V., Wornell, G. W.: Communication under strong asynchronism. IEEE Trans. Inform. Theory 55 (2009), 4508-4528. | DOI | MR

[18] Verdu, S.: Multiple-access channels with memory with and without frame synchronism. IEEE Trans. Inform. Theory 35 (1989), 605-619. | DOI | MR | Zbl

Cité par Sources :