English
Related papers

Related papers: On Repetition Protocols and Power Control for Mult…

200 papers

A scenario involving a source, a channel, and a destination, where the destination is interested in {\em both} reliably reconstructing the message transmitted by the source and estimating with a fidelity criterion the state of the channel,…

Information Theory · Computer Science 2011-08-30 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…

Information Theory · Computer Science 2009-03-26 Daniel E. Lucani , Muriel Médard , Milica Stojanovic

In this work, we analyze the throughput of random access multi-user relay-assisted millimeter-wave wireless networks, in which both the destination and the relay have multipacket reception capability. We consider a full-duplex network…

Networking and Internet Architecture · Computer Science 2018-10-08 Cristian Tatino , Nikolaos Pappas , Ilaria Malanchini , Lutz Ewe , Di Yuan

Grant-free protocols exploiting compressed sensing (CS) multi-user detection (MUD) are appealing for solving the random access problem in massive machine-type communications (mMTC) with sporadic device activity. Such protocols would greatly…

Information Theory · Computer Science 2022-05-03 Onel L. A. López , Glauber Brante , Richard D. Souza , Markku Juntti , Matti Latva-aho

This paper considers the problem of reliable communication over discrete-time channels whose impulse responses have length $L$ and exactly $S\leq L$ non-zero coefficients, and whose support and coefficients remain fixed over blocks of $N>L$…

Information Theory · Computer Science 2011-06-29 Arun Pachai Kannu , Philip Schniter

In this paper, we investigate the necessity of finite blocklength codes in distributed transmission of independent message sets over channels with feedback. Previously, it was shown that finite effective length codes are necessary in…

Information Theory · Computer Science 2018-01-17 Mohsen Heidari , Farhad Shirani , S. Sandeep Pradhan

We consider transmission of a continuous amplitude source over an L-block Rayleigh fading $M_t \times M_r$ MIMO channel when the channel state information is only available at the receiver. Since the channel is not ergodic, Shannon's…

Information Theory · Computer Science 2007-11-09 Deniz Gunduz , Elza Erkip

This paper investigates the maximum coding rate at which data can be transmitted over a noncoherent, multiple-input, multiple-output (MIMO) Rayleigh block-fading channel using an error-correcting code of a given blocklength with a…

Information Theory · Computer Science 2025-11-19 Chao Qi , Tobias Koch

This paper investigates variable-length stop-feedback codes for memoryless channels in point-to-point, multiple access, and random access communication scenarios. The proposed codes employ $L$ decoding times $n_1, n_2, \dots, n_L$ for the…

Information Theory · Computer Science 2023-12-12 Recep Can Yavas , Victoria Kostina , Michelle Effros

A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step. The final decision of the message is obtained by applying a…

Information Theory · Computer Science 2019-01-17 Mustafa Cemil Coşkun , Gianluigi Liva , Johan Östman , Giuseppe Durisi

Successive relaying can improve the transmission rate by allowing the source and relays to transmit messages simultaneously, but it may cause severe inter-relay interference (IRI). IRI cancellation schemes have been proposed to mitigate…

Information Theory · Computer Science 2022-10-27 Lingrui Zhang , Yuxing Han , Qiong Wang , Wei Chen

We investigate the performance of multihop-intervehicular communication systems with regenerative and nonregenerative relaying. We consider the so-called "n*Rayleigh distribution" as an adequate multipath fading channel model for…

Information Theory · Computer Science 2016-09-02 Yahia Alghorani , Georges Kaddoum , Sami Muhaidat , Samuel Pierre , Naofal Al-Dhahir

Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication…

Information Theory · Computer Science 2017-02-01 Shihao Yan , Biao He , Yirui Cong , Xiangyun Zhou

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary…

Information Theory · Computer Science 2016-11-15 Badri N. Vellambi , Nima Torabkhani , Faramarz Fekri

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…

Information Theory · Computer Science 2017-12-19 Johan Östman , Giuseppe Durisi , Erik G. Ström , Mustafa C. Coşkun , Gianluigi Liva

We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute…

Information Theory · Computer Science 2007-07-13 Siddharth Ray , Muriel Medard , Lizhong Zheng

In this paper, the throughput of relay networks with multiple source-destination pairs under queueing constraints has been investigated for both variable-rate and fixed-rate schemes. When channel side information (CSI) is available at the…

Information Theory · Computer Science 2015-10-08 Yi Li , M. Cenk Gursoy , Senem Velipasalar

Suppression of the transient energy growth in subcritical plane Poiseuille flow via feedback control is addressed. It is assumed that the time derivative of any of the velocity components can be imposed at the walls as control input, and…

Fluid Dynamics · Physics 2015-05-27 F. Martinelli , M. Quadrio , J. McKernan , J. F. Whidborne

Interference in wireless networks is one of the key capacity-limiting factors. Recently developed interference-embracing techniques show promising performance on turning collisions into useful transmissions. However, the…

Information Theory · Computer Science 2016-11-15 Jalaluddin Qureshi , Jianfei Cai , Chuan Heng Foh