English
Related papers

Related papers: Variable Length Coding over the Two-User Multiple-…

200 papers

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

We derive the capacity region of arbitrarily varying multiple-access channels with conferencing encoders for both deterministic and random coding. For a complete description it is sufficient that one conferencing capacity is positive. We…

Information Theory · Computer Science 2012-11-21 Moritz Wiese , Holger Boche

The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…

Information Theory · Computer Science 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the…

Information Theory · Computer Science 2014-02-10 Ramji Venkataramanan , S. Sandeep Pradhan

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of…

Information Theory · Computer Science 2014-11-18 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

This paper presents generalized channel coding theorems for a time-slotted distributed communication system where a transmitter-receiver pair is communicating in parallel with other transmitters. Assume that the channel code of each…

Information Theory · Computer Science 2016-11-15 Jie Luo

We consider the problem of polar coding for transmission over $m$-user multiple access channels. In the proposed scheme, all users encode their messages using a polar encoder, while a multi-user successive cancellation decoder is deployed…

Information Theory · Computer Science 2016-11-17 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

In network communication, the source often transmits messages at several different information rates within a session. How to deal with information transmission and network error correction simultaneously under different rates is introduced…

Information Theory · Computer Science 2014-03-04 Xuan Guang , Fang-Wei Fu , Zhen Zhang

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…

Information Theory · Computer Science 2018-07-02 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

We consider achieving the rates in the capacity region of a multi-level 3-receiver broadcast channel, in which the second receiver is degraded with respect to the first receiver, with degraded message sets. We propose a two-level chaining…

Information Theory · Computer Science 2020-10-15 Karthik Nagarjuna Tunuguntla , Paul H. Siegel

This paper proposes an encoding/decoding framework for achieving the optimal channel capacities of the two-user broadcast channel where each user (receiver) has the message targeted for the other user (receiver) as side information. Since…

Information Theory · Computer Science 2016-05-02 Taotao Wang , Soung Chang Liew , Long Shi

A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel coding error exponent for multiple access channels in the…

Information Theory · Computer Science 2013-09-19 Lóránt Farkas , Tamás Kói

We study variable-length feedback (VLF) codes under a strict delay constraint to maximize their average transmission rate (ATR) in a discrete memoryless channel (DMC) while considering periodic decoding attempts. We first derive a lower…

Information Theory · Computer Science 2015-02-25 Seong Hwan Kim , Dan Keun Sung , Tho Le-Ngoc

In this paper, a two-user discrete memoryless multiple-access channel (DM-MAC) with correlated channel states, each known at one of the encoders is considered, in which each encoder transmits independent messages and tries to cooperate with…

Information Theory · Computer Science 2011-02-08 Mahdi Zamanighomi , Mohammad Javad Emadi , Farhad Shirani Chaharsooghi , Mohammad Reza Aref

Polar codes are introduced for discrete memoryless broadcast channels. For $m$-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from $m$ independent messages to one codeword while…

Information Theory · Computer Science 2015-04-15 Naveen Goela , Emmanuel Abbe , Michael Gastpar

A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show…

Information Theory · Computer Science 2015-08-14 Bin Li , David Tse , Kai Chen , Hui Shen

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network…

Networking and Internet Architecture · Computer Science 2016-11-18 MinJi Kim , Daniel Lucani , Xiaomeng Shi , Fang Zhao , Muriel Medard

In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide multirate packet delivery outside of what is given by the network min-cut. This is achieved by using a deterministic non-block-based network…

Information Theory · Computer Science 2014-01-06 Amy Fu , Parastoo Sadeghi , Muriel Medard

With the phenomenal growth of the Internet of Things (IoT), Ultra Reliable Low Latency Communications (URLLC) has potentially been the enabler to guarantee the stringent requirements on latency and reliability. However, how to achieve low…

Information Theory · Computer Science 2019-03-15 Xiaoyu Zhao , Wei Chen