English
Related papers

Related papers: Improved bounds on the decoding failure probabilit…

200 papers

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

Physical-layer Network Coding (PNC) can significantly improve the throughput of wireless two way relay channel (TWRC) by allowing the two end nodes to transmit messages to the relay simultaneously. To achieve reliable communication, channel…

Networking and Internet Architecture · Computer Science 2016-11-15 Shengli Zhang , Soung-Chang Liew

We present capacity results of the binary-symmetric parallel-relay network, where there is one source, one destination, and K relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals,…

Information Theory · Computer Science 2015-03-14 Lawrence Ong , Sarah J. Johnson , Christopher M. Kellett

In this paper, we investigate network nest coded modulation schemes for multiple access relay channels. The performance of the distributed systems which are based on distributed convolutional codes with network coded modulation is…

Information Theory · Computer Science 2022-03-16 Zihuai Lin

This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes.…

Information Theory · Computer Science 2016-11-17 Sinda Smirani , Mohamed Kamoun , Mireille Sarkiss , Abdellatif Zaidi , Pierre Duhamel

Bounds on the reliability function for the discrete memoryless relay channel are derived using the method of types. Two achievable error exponents are derived based on partial decode-forward and compress-forward which are well-known…

Information Theory · Computer Science 2016-11-17 Vincent Y. F. Tan

The network communication scenario where one or more receivers request all the information transmitted by different sources is considered. We introduce distributed polynomial-time network codes in the presence of malicious nodes. Our codes…

Networking and Internet Architecture · Computer Science 2010-01-18 Hongyi Yao , Theodoros K. Dikaliotis , Sidharth Jaggi , Tracey Ho

This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error…

Information Theory · Computer Science 2007-07-13 Igal Sason , Idan Goldenberg

This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the…

Networking and Internet Architecture · Computer Science 2015-03-17 Petteri Mannersalo , Georgios S. Paschos , Lazaros Gkatzikis

We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless…

Information Theory · Computer Science 2016-06-01 Lawrence Ong , Roy Timo

Network coding has been widely used as a technology to ensure efficient and reliable communication. The ability to recode packets at the intermediate nodes is a major benefit of network coding implementations. This allows the intermediate…

Networking and Internet Architecture · Computer Science 2023-06-21 Vipindev Adat Vasudevan , Tarun Soni , Muriel Médard

Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…

Information Theory · Computer Science 2018-03-06 Boaz Shuval , Ido Tal

We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the…

Information Theory · Computer Science 2022-12-29 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

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

As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering challenges is the need…

Information Theory · Computer Science 2014-03-31 Fatemeh Hamidi-Sepehr , Jean-Francois Chamberland , Henry D. Pfister

Previous work on cooperative communications has concentrated primarily on the diversity benefits of such techniques. This paper, instead, considers the multiplexing benefits of cooperative communications. First, a new interpretation on the…

Information Theory · Computer Science 2009-03-16 Yijia , Fan , Chao Wang , H. Vincent Poor , John S. Thompson

We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work…

Information Theory · Computer Science 2007-11-27 Andrea Montanari , Ruediger Urbanke

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with…

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

We consider the design of coding schemes for the wireless two-way relaying channel when there is no channel state information at the transmitter. In the spirit of the compute and forward paradigm, we present a multilevel coding scheme that…

Information Theory · Computer Science 2016-11-17 Brett Hern , Krishna Narayanan

A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and…

Information Theory · Computer Science 2015-03-13 Sung Hoon Lim , Young-Han Kim , Abbas El Gamal , Sae-Young Chung
‹ Prev 1 4 5 6 7 8 10 Next ›