English
Related papers

Related papers: The Necessity of Relay Selection

200 papers

The multi-carrier multi-access technique is widely adopt in future wireless communication systems, such as IEEE 802.16m and 3GPP LTE-A. The channel resources allocation in multi-carrier multi-access channel, which can greatly improve the…

Information Theory · Computer Science 2013-07-18 Bo Bai , Wei Chen , Khaled B. Letaief , Zhigang Cao

In this study, a novel coding scheme called highdensity coding based on high-density codebooks using a genetic local search algorithm is proposed. The high-density codebook maximizes the energy transfer capability by maximizing the ratio of…

Signal Processing · Electrical Eng. & Systems 2022-03-21 Dongheon Lee , Gyuyeol Kong , Jang-Won Lee , Sooyong Choi

We give a complete determination of the exact optimal worst-case repair bandwidth and repair I/O for linear exact repair of $(n,n-2,2)$ MDS array codes over every finite field $\mathbb{F}_q$ and for every admissible code length $3\le n\le…

Information Theory · Computer Science 2026-05-12 Huawei Wu

This paper investigates array geometry and waveform design for integrated sensing and communications (ISAC) employing sensor selection. We consider ISAC via index modulation, where various subsets of transmit (Tx) sensors are used for both…

Signal Processing · Electrical Eng. & Systems 2024-12-31 Robin Rajamäki , Piya Pal

In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given $p,\epsilon>0$, we study (i) The $p$-bounded constraint: a binary vector of size $m$ is said to be $p$-bounded if its weight is at most…

Information Theory · Computer Science 2022-08-22 Tuan Thanh Nguyen , Kui Cai , Han Mao Kiah , Kees A. Schouhamer Immink , Yeow Meng Chee

We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet, motivated by permutation channels in which ordering is completely lost and errors act solely by deletions of symbols, i.e., by…

Information Theory · Computer Science 2026-01-12 Avraham Kreindel , Isaac Barouch Essayag , Aryeh Lev Zabokritskiy

The minimum storage rack-aware regenerating (MSRR) code is a variation of regenerating codes that achieves the optimal repair bandwidth for a single node failure in the rack-aware model. The authors in~\cite{Chen-Barg2019}…

Information Theory · Computer Science 2021-09-20 Jiaojiao Wang , Dabin Zheng , Shenghua Li

In network communications, information transmission often encounters wiretapping attacks. Secure network coding is introduced to prevent information from being leaked to adversaries. The investigation of performance bounds on the numbers of…

Information Theory · Computer Science 2015-05-07 Xuan Guang , Jiyong Lu , Fang-Wei Fu

The channel feedback overhead for massive MIMO systems with a large number of base station (BS) antennas is very high, since the number of feedback bits of traditional codebooks scales linearly with the number of BS antennas. To reduce the…

Information Theory · Computer Science 2017-01-23 Wenqian Shen , Linglong Dai , Yu Zhang , Zhaocheng Wang

A general class of nonlinear Least Square Error (LSE) precoders in multi-user multiple-input multiple-output systems is analyzed using the replica method from statistical mechanics. A single cell downlink channel with $N$ transmit antennas…

Information Theory · Computer Science 2017-04-28 Mohammad A. Sedaghat , Ali Bereyhi , Ralf R. Müller

An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability…

Information Theory · Computer Science 2019-01-18 Lakshmi Natarajan , Hoang Dau , Prasad Krishnan , V. Lalitha

In this work, we address the question of the largest rate of linear subcodes of Reed-Muller (RM) codes, all of whose codewords respect a runlength-limited (RLL) constraint. Our interest is in the $(d,\infty)$-RLL constraint, which mandates…

Information Theory · Computer Science 2022-08-05 V. Arvind Rameshwar , Navin Kashyap

In modern practical data centers, storage nodes are usually organized into equally sized groups, which is called racks. The cost of cross-rack communication is much more expensive compared with the intra-rack communication cost. The codes…

Information Theory · Computer Science 2019-11-20 Lingfei Jin , Gaojun Luo , Chaoping Xing

A new lower bound on the average reconstruction error variance of multidimensional sampling and reconstruction is presented. It applies to sampling on arbitrary lattices in arbitrary dimensions, assuming a stochastic process with constant,…

Information Theory · Computer Science 2018-06-19 Erik Agrell , Balázs Csébfalvi

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

Network coding and cooperative communication have received considerable attention from the research community recently in order to mitigate the adverse effects of fading in wireless transmissions and at the same time to achieve high…

Information Theory · Computer Science 2010-04-20 Hakan Topakkaya , Zhengdao Wang

In this paper, we investigate the performance of selection cooperation in the presence of imperfect channel estimation. In particular, we consider a cooperative scenario with multiple relays and amplify-and-forward protocol over frequency…

Information Theory · Computer Science 2011-01-05 Mehdi Seyfi , Sami Muhaidat , Jie Liang

We explore the problem of distributed Hypothesis Testing (DHT) against independence, focusing specifically on Binary Symmetric Sources (BSS). Our investigation aims to characterize the optimal quantizer among binary linear codes, with the…

Information Theory · Computer Science 2024-10-23 Fatemeh Khaledian , Reza Asvadi , Elsa Dupraz , Tad Matsumoto

In this paper, we deal with the problem of relay selection in mobile edge computing networks, where a source node transmits a computation-intensive task to a destination via the aid of multiple relay nodes. It differs from the traditional…

Information Theory · Computer Science 2019-02-19 Jie Liang , Zhiyong Chen , Cheng Li , Bin Xia , Ning Liu

Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of…

Information Theory · Computer Science 2014-05-06 Dimitris S. Papailiopoulos , Alexandros G. Dimakis
‹ Prev 1 4 5 6 7 8 10 Next ›