English
Related papers

Related papers: Capacity Analysis of Linear Operator Channels over…

200 papers

Linear operator broadcast channel (LOBC) models the scenario of multi-rate packet broadcasting over a network, when random network coding is applied. This paper presents the framework of algebraic coding for LOBCs and provides a…

Information Theory · Computer Science 2011-10-19 Yimin Pang , Thomas Honold

It is known that the Shannon capacity of the q-ary symmetric channel (qSC) is the same as the list-decoding capacity of an adversarial channel, raising the question of whether there is a formal (and black-box) connection between the two. We…

Information Theory · Computer Science 2024-10-29 Francisco Pernice , Oscar Sprumont , Mary Wootters

In this work, the delay limited capacity (DLC) of orthogonal frequency division multiplexing (OFDM) systems is investigated. The analysis is organized into two parts. In the first part, the impact of system parameters on the OFDM DLC is…

Information Theory · Computer Science 2007-07-13 Gerhard Wunder , Thomas Michel

We study a fading linear finite-field relay network having multiple source-destination pairs. Because of the interference created by different unicast sessions, the problem of finding its capacity region is in general difficult. We observe…

Information Theory · Computer Science 2009-05-12 Sang-Woon Jeon , Sae-Young Chung

In this paper, we consider the finite-state multiple access channel (MAC) with partially cooperative encoders and delayed channel state information (CSI). Here partial cooperation refers to the communication between the encoders via…

Information Theory · Computer Science 2016-11-17 Ziv Goldfeld , Haim H. Permuter , Benjamin M. Zaidel

Ad hoc networking specific challenges foster a strong research effort on efficient protocols design. Routing protocols based on a self-organized structure have been studied principally for the robustness and the scalability they provide. On…

Networking and Internet Architecture · Computer Science 2016-08-16 Hervé Rivano , Fabrice Theoleyre , Fabrice Valois

The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…

Information Theory · Computer Science 2012-10-26 Feng Xue

We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…

Information Theory · Computer Science 2022-05-31 Allison Beemer , Altan Berdan Kilic , Alberto Ravagnani

Constellation shaping is a practical and effective technique to improve the performance and the rate adaptivity of optical communication systems. In principle, it could also be used to mitigate the impact of nonlinear effects, possibly…

Information Theory · Computer Science 2022-06-08 Marco Secondini , Stella Civelli , Enrico Forestieri , Lareb Zar Khan

Random Linear Network Coding (RLNC) has emerged as a powerful tool for robust high-throughput multicast. Projection analysis - a recently introduced technique - shows that the distributed packetized RLNC protocol achieves (order) optimal…

Information Theory · Computer Science 2011-02-17 Bernhard Haeupler , Muriel Médard

Capacity analysis for channels with side information at the receiver has been an active area of interest. This problem is well investigated for the case of finite alphabet channels. However, the results are not easily generalizable to the…

Information Theory · Computer Science 2016-11-18 Majid Fozunbal , Steven W. McLaughlin , Ronald W. Schafer

A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The…

Information Theory · Computer Science 2010-01-22 Hamidreza Ebrahimzadeh Saffar , Patrick Mitran

Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finite rings, more efficient physical-layer network coding…

Information Theory · Computer Science 2016-11-15 Chen Feng , Roberto W. Nóbrega , Frank R. Kschischang , Danilo Silva

Physical-layer network coding (PNC) is a communications paradigm that exploits overlapped transmissions to boost the throughput of wireless relay networks. A high point of PNC research was a theoretical proof that PNC that makes use of…

Networking and Internet Architecture · Computer Science 2017-08-23 Yihua Tan , Soung Chang Liew , Tao Huang

Achievability and converse results for the lossy transmission of correlated sources over Shannon's two-way channels (TWCs) are presented. A joint source-channel coding theorem for independent sources and TWCs for which adaptation cannot…

Information Theory · Computer Science 2018-05-08 Jian-Jia Weng , Fady Alajaji , Tamás Linder

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region…

Information Theory · Computer Science 2010-09-17 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

To better understand the wireless network design with a large number of hops, we investigate a line network formed by general discrete memoryless channels (DMCs), which may not be identical. Our focus lies on Generalized Batched Network…

Information Theory · Computer Science 2023-12-21 Jie Wang , Shenghao Yang , Yanyan Dong , Yiheng Zhang

In this paper, we characterize the information-theoretic capacity scaling of wireless ad hoc networks with $n$ randomly distributed nodes. By using an exact channel model from Maxwell's equations, we successfully resolve the conflict in the…

Information Theory · Computer Science 2011-10-19 Si-Hyeon Lee , Sae-Young Chung

We address the problem of optimizing the throughput of network coded traffic in mobile networks operating in challenging environments where connectivity is intermittent and locally available memory space is limited. Random linear network…

Information Theory · Computer Science 2011-04-19 Gabriel Popa

We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason