English
Related papers

Related papers: Physical-layer Network Coding: A Random Coding Err…

200 papers

This work investigates the maximum broadcast throughput and its achievability in multi-hop wireless networks with half-duplex node constraint. We allow the use of physical-layer network coding (PNC). Although the use of PNC for unicast has…

Information Theory · Computer Science 2013-08-06 Shen Feng , Soung C. Liew

This paper is about deriving lower bounds on the error exponents for the two-user interference channel under the random coding regime for several ensembles. Specifically, we first analyze the standard random coding ensemble, where the…

Information Theory · Computer Science 2017-06-22 Wasim Huleihel , Neri Merhav

Recently, network error correction coding (NEC) has been studied extensively. Several bounds in classical coding theory have been extended to network error correction coding, especially the Singleton bound. In this paper, following the…

Information Theory · Computer Science 2010-11-08 Xuan Guang , Fang-Wei Fu , Zhen Zhang

This paper investigates the decoding process of asynchronous convolutional-coded physical-layer network coding (PNC) systems. Specifically, we put forth a layered decoding framework for convolutional-coded PNC consisting of three layers:…

Information Theory · Computer Science 2013-12-06 Qing Yang , Soung Chang Liew

It has recently been recognized that the wireless networks represent a fertile ground for devising communication modes based on network coding. A particularly suitable application of the network coding arises for the two--way relay…

Information Theory · Computer Science 2007-07-13 Petar Popovski , Hiroyuki Yomo

The two-phase MIMO NC (network coding) scheme can be used to boost the throughput in a two-way relay channel in which nodes are equipped with multiple antennas. The obvious strategy is for the relay node to extract the individual packets…

Networking and Internet Architecture · Computer Science 2010-01-18 Shengli Zhang , Soung-Chang Liew

Sparse random linear network coding (SRLNC) used as a class of erasure codes to ensure the reliability of multicast communications has been widely investigated. However, an exact expression for the decoding success probability of SRLNC is…

Information Theory · Computer Science 2021-08-27 WenLin Chen , Fang Lu , Yan Dong

This paper studies random-coding error exponents of randomised list decoding, in which the decoder randomly selects $L$ messages with probabilities proportional to the decoding metric of the codewords. The exponents (or bounds) are given…

Information Theory · Computer Science 2026-01-15 Henrique K. Miyamoto , Sheng Yang

We present a novel cross layer approach to random access (RA) that combines physical-layer network coding (PLNC) with multiuser detection (MUD). PLNC and MUD are applied jointly at the physical level in order to extract any linear…

Networking and Internet Architecture · Computer Science 2014-06-19 Giuseppe Cocco , Stephan Pfletschinger , Monica Navarro

Physical-layer Network Coding (PNC) makes use of the additive nature of the electromagnetic (EM) waves to apply network coding arithmetic at the physical layer. With PNC,the destructive effect of interference in wireless networks is…

Networking and Internet Architecture · Computer Science 2010-01-05 Shengli Zhang , Soung-Chang Liew , Hui Wang

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

In the literature there exists analytical expressions for the probability of a receiver decoding a transmitted source message that has been encoded using random linear network coding. In this work, we look into the probability that the…

Information Theory · Computer Science 2022-03-08 Jessica Claridge , Ioannis Chatzigeorgiou

Differential linear network coding (DLNC) is a precoding scheme for information transmission over random linear networks. By using differential encoding and decoding, the conventional approach of lifting, required for inherent channel…

Information Theory · Computer Science 2015-01-29 Sven Puchinger , Michael Cyran , Robert F. H. Fischer , Martin Bossert , Johannes B. Huber

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

The security level of the achievability scheme for Wyner's wiretap channel model is examined from the perspective of the probability of correct decoding, $P_c$, at the wiretap channel decoder. In particular, for finite-alphabet memoryless…

Information Theory · Computer Science 2016-11-17 Neri Merhav

In two-way OFDM relay, carrier frequency offsets (CFOs) between relay and terminal nodes introduce severe intercarrier interference (ICI) which degrades the performance of traditional physical-layer network coding (PLNC). Moreover,…

Information Theory · Computer Science 2012-04-13 Xiaochen Xia , Kui Xu , Youyun Xu

This paper investigates various subtleties of applying linear physical-layer network coding (PNC) with q-level pulse amplitude modulation (q-PAM) in two-way relay channels (TWRC). A critical issue is how the PNC system performs when the…

Information Theory · Computer Science 2016-11-18 Long Shi , Soung Chang Liew , Lu Lu

Physical-layer Network Coding (PNC) can significantly improve the throughput of two-way relay channels. An interesting variant of PNC is Analog Network Coding (ANC). Almost all ANC schemes proposed to date, however, operate in a symbol by…

Information Theory · Computer Science 2011-10-17 Shengli Zhang , Soung-Chang Liew , Qingfeng Zhou , Lu Lu , Hui Wang

Here we write in a unified fashion (using "R(P, Q, D)") the random coding exponents in channel coding and lossy source coding. We derive their explicit forms and show, that, for a given random codebook distribution Q, the channel decoding…

Information Theory · Computer Science 2017-10-31 Sergey Tridenski , Ram Zamir

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang