{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:30:08Z","timestamp":1760243408320,"version":"build-2065373602"},"reference-count":17,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T00:00:00Z","timestamp":1361145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, we study a new bus communication model, where two transmitters wish to send their corresponding private messages and a common message to a destination, while they also wish to send the common message to another receiver connected to the same wire. From an information-theoretical point of view, we first study a general case of this new model (with discrete memoryless channels). The capacity region composed of all achievable (R0,R1,R2) triples is determined for this general model, where R1 and R2 are the transmission rates of the private messages and R0 is the transmission rate of the common message. Then, the result is further explained via the Gaussian example. Finally, we give the capacity region for the new bus communication model with additive Gaussian noises and attenuation factors. This new bus communication model captures various communication scenarios, such as the bus systems in vehicles, and the bus type of communication channel in power line communication (PLC) networks.<\/jats:p>","DOI":"10.3390\/e15020678","type":"journal-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T11:11:16Z","timestamp":1361272276000},"page":"678-697","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Capacity Region of a New Bus Communication Model"],"prefix":"10.3390","volume":"15","author":[{"given":"Bin","family":"Dai","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Southwest JiaoTong University, Northbound Section Second Ring Road 111, Chengdu, 610031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J.","family":"Vinck","sequence":"additional","affiliation":[{"name":"Institute for Experimental Mathematics, Duisburg-Essen University, Ellernstr.29, Essen, 45326, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering Department, Shanghai Jiao Tong University, Dongchuan road 800, Shanghai, 200240, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuojun","family":"Zhuang","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering Department, Shanghai Jiao Tong University, Dongchuan road 800, Shanghai, 200240, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2013,2,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1109\/JSAC.2006.874419","article-title":"Distributed space-time block coding for multihop transmission in power line communication networks","volume":"24","author":"Lampe","year":"2006","journal-title":"IEEE J. Select. Areas Commun."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/MCOM.2010.5439083","article-title":"Power line communications for large-scale control and automation systems","volume":"48","author":"Bumiller","year":"2010","journal-title":"IEEE Commun. Mag."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.aeue.2011.01.011","article-title":"On cooperative coding for narrow band PLC networks","volume":"8","author":"Lampe","year":"2011","journal-title":"Int. J. Electron. Commun. (AE\u00dc)"},{"key":"ref_4","first-page":"12","article-title":"Potential performance of PLC systems composed of several communication links","volume":"10","author":"Balakirsky","year":"2005","journal-title":"Intl. Symp. Power Line Commun. Appl. Vancouver"},{"key":"ref_5","first-page":"27","article-title":"Vehicle applications of controller area network","volume":"7","author":"Johansson","year":"2003","journal-title":"Tech. Rep."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1972.1054727","article-title":"Broadcast channels","volume":"18","author":"Cover","year":"1972","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TIT.1977.1055655","article-title":"General broadcast channels with degraded message sets","volume":"23","author":"Marton","year":"1977","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","first-page":"3","article-title":"Capacity and coding for degraded broadcast channels","volume":"10","author":"Gallager","year":"1974","journal-title":"Probl. Inf. Transm."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/TIT.1974.1055184","article-title":"A simple converse for broadcast channels with additive white Gaussian noise","volume":"20","author":"Bergmans","year":"1974","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TIT.1973.1054980","article-title":"Random coding theorem for broadcast channels with degraded components","volume":"19","author":"Bergmans","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1109\/PROC.1980.11897","article-title":"Multiple user information theory","volume":"68","author":"Cover","year":"1980","journal-title":"Proc. IEEE"},{"key":"ref_12","unstructured":"Ahlswede, R. (day, January \/hlconference). Multiway Communication Channels. Proceedings of the 2nd International Symposium Information Theory, Tsahkadsor, Armenia."},{"key":"ref_13","unstructured":"Liao, H.H.J. (1972). Multiple access channels. [Ph.D. Thesis, University of Hawaii]."},{"key":"ref_14","unstructured":"Csisza\u00b4r, I., and K\u00f6rner, J. (1981). Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic."},{"key":"ref_15","unstructured":"El Gamal, A., and Kim, Y. Lecture notes on network information theory. Available online: http:\/\/arxiv.org\/abs\/1001.3404."},{"key":"ref_16","unstructured":"Yeung, R.W. (1981). Information Theory and Network Coding, Springer."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/TIT.2007.915978","article-title":"Multiple-access channels with confidential messages","volume":"54","author":"Liang","year":"2008","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/15\/2\/678\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:44:59Z","timestamp":1760219099000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/15\/2\/678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,18]]},"references-count":17,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,2]]}},"alternative-id":["e15020678"],"URL":"https:\/\/doi.org\/10.3390\/e15020678","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2013,2,18]]}}}