3.7k citations
- University of California San DiegoUS25 papers
- The University of Texas at AustinUS14 papers
- Qualcomm (United Kingdom)GB11 papers
- University of California, IrvineUS10 papers
- University of California, Los AngelesUS10 papers
- École Polytechnique Fédérale de LausanneCH9 papers
- Market MattersUS9 papers
- Princeton UniversityUS9 papers
- University of California, BerkeleyUS9 papers
- University of TorontoCA9 papers
- Texas A&M UniversityUS8 papers
- University of Illinois Urbana-ChampaignUS8 papers
15 papers · 1 filter
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
Junsheng Han, Paul H. Siegel, Ron M. Roth
For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smaller…
Low SNR Capacity of Noncoherent Fading Channels
Vignesh Sethuraman, Ligong Wang, Bruce Hajek +1
Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmit…
Opportunistic Relaying in Wireless Networks
Shengshan Cui, Alexander M. Haimovich, Oren Somekh +1
Relay networks having source-to-destination pairs and half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup…
On Precision - Redundancy Relation in the Design of Source Coding Algorithms
Yuriy Reznik
We study the effects of finite-precision representation of source's probabilities on the efficiency of classic source coding algorithms, such as Shannon, Gilbert-Moore, or arithmet…
Graph-Based Decoding in the Presence of ISI
Mohammad H. Taghavi, Paul H. Siegel
We propose an approximation of maximum-likelihood detection in ISI channels based on linear programming or message passing. We convert the detection problem into a binary decoding…
Location-Aided Fast Distributed Consensus in Wireless Networks
Wenjun Li, Yanbing Zhang, Huaiyu Dai
Existing works on distributed consensus explore linear iterations based on reversible Markov chains, which contribute to the slow convergence of the algorithms. It has been observe…