Sciweavers

495 search results - page 7 / 99
» Capacity of Non-Malleable Codes
Sort
View
TIT
2010
136views Education» more  TIT 2010»
13 years 3 months ago
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within 1 bit/s/Hz. A natural goal is to apply this approach to the Gaussia...
Guy Bresler, Abhay Parekh, David N. C. Tse
TCOM
2010
138views more  TCOM 2010»
13 years 7 months ago
Approaching MIMO capacity using bitwise Markov Chain Monte Carlo detection
—This paper examines near capacity performance of Markov Chain Monte Carlo (MCMC) detectors for multipleinput and multiple-output (MIMO) channels. The proposed MCMC detector (Log...
Rong-Rong Chen, Ronghui Peng, Alexei Ashikhmin, Be...
WD
2010
13 years 3 months ago
Uplink capacity analysis of OFDMA based cellular networks with reuse-1
Abstract--OFDMA based cellular radio networks aim to operate as close as possible to frequency reuse distance of one, where the whole spectrum would be available in every cell. Mod...
Maciej Mühleisen, Daniel Bültmann, Bernh...
TIT
2010
111views Education» more  TIT 2010»
13 years 3 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 10 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra