Sciweavers

56 search results - page 8 / 12
» tit 2011
Sort
View
TIT
2011
131views more  TIT 2011»
14 years 10 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
TIT
2011
102views more  TIT 2011»
14 years 10 months ago
Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters
For integer r satisfying 0 ≤ r ≤ p − 2, a sequence family Ωr of polyphase sequences of prime period p, size (p − 2)pr , and maximum correlation at most 2 + (r + 1) √ p...
Kai-Uwe Schmidt
TIT
2011
141views more  TIT 2011»
14 years 10 months ago
Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications
New families of near-complementary sequences are presented for peak power control in multicarrier communications. A framework for near-complementary sequences is given by the expl...
Nam Yul Yu, Guang Gong
TIT
2011
112views more  TIT 2011»
14 years 10 months ago
On the Secure Degrees of Freedom of Relaying With Half-Duplex Feedback
—Secure communication protocols over a single-relay system in the presence of a multiple-antenna eavesdropper are investigated. When there is no direct link between the source an...
Thanh Tùng Kim, H. Vincent Poor
TIT
2011
209views more  TIT 2011»
14 years 10 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...