Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations
Tables:
DMCA
Structured Codes in Information Theory: MIMO and Network Applications (2012)
Cached
Download Links
[www.eecs.berkeley.edu]
Save to List
Add to Collection
Correct Errors
Monitor Changes
by Jiening Zhan
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
2915
Capacity of Multi-Antenna Gaussian Channels
- Telatar - 1999
1960
Network information flow
- Ahlswede, Cai, et al. - 2000
1261
Noiseless coding of correlated information sources
- Slepian, Wolf - 1973
1164
Diversity and Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels
- Zheng, Tse - 2003
1012
Linear network coding
- Li, Yeung, et al. - 2003
856
An Algebraic Approach to Network Coding
- Koetter, Médard - 2003
736
Cooperative strategies and capacity theorems for relay networks
- Kramer, Gastpar, et al. - 2005
641
VBLAST: an architecture for realizing very high data rates over the richscattering wireless channel
- Wolniansky, Foschini, et al. - 1998
585
Design of capacity-approaching irregular low-density parity-check codes
- Richardson, Shokrollahi, et al. - 2001
508
How much training is needed in multiple-antenna wireless links
- Hassibi, Hochwald - 2003
494
A mathematical theory of communication, The Bell System
- Shannon - 1948
447
Gaussian interference channel capacity to within one bit
- Etkin, Tse, et al. - 2008
417
Capacity limits of MIMO channels,”
- Goldsmith, Jafar, et al. - 2003
343
Nested linear/lattice codes for structured multiterminal binning
- Zamir, Shamai, et al. - 2002
339
achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
- Vishwanath, Jindal, et al. - 2003
331
Closest point search in lattices
- Agrell, Eriksson, et al. - 2002
292
Wireless Network Information Flow: A deterministic approach,” Information Theory
- Avestimehr, Diggavi, et al. - 2011
272
Communication on the grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel,” Information Theory
- Zheng, Tse - 2002
271
On maximum likelihood detection and the search for the closest lattice point
- Damen, Gamal, et al. - 2003
254
The impact of antenna diversity on the capacity of wireless communication systems
- Winters, Salz, et al. - 1994
240
for Information Technology—Telecommunications and Information Exchange between Systems—Local and Metropolitan Area Networks—Specic Requirements Part 15.4
- Standard
208
Interference alignment, and the degrees of freedom of the K user interference channel
- Cadambe, Jafar - 2009
173
Elements of Information Theory, 2nd Edition
- Cover, Thomas - 2006
158
Compute-and-forward: Harnessing interference through structured codes
- Nazer, Gastpar - 2011
155
On the complexity of sphere decoding in digital communications
- Jaldén, Ottersten
145
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels,” Information Theory
- Lapidoth, Moser - 2003
137
Computation over multiple-access channels
- Nazer, Gastpar - 2007
134
On the sphere-decoding algorithm i. expected complexity
- Hassibi, Vikalo - 2005
133
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
- Bresler, Parekh, et al. - 2010
126
Lattices which are good for (almost) everything
- Erez, Litsyn, et al. - 2003
118
Lattice coding and decoding achieve the optimal diversity-vs-multiplexing tradeoff of MIMO channels
- Gamal, Caire, et al. - 2004
114
Achieving 1 log(1 + SNR) on the AWGN channel with lattice encoding and decoding
- Erez, Zamir - 2004
109
Lattice-reduction-aided detectors for MIMO communication systems
- Yao, Wornell - 2002
103
Optimum decision feedback multiuser equalization and successive decoding achieves the total capacity of the gaussian multiple-access channel
- Varanasi, Guess - 1997
102
Capacity and lattice strategies for cancelling known interference
- Erez, Shamai
96
Capacity of the Gaussian twoway relay channel to within 1/2 bit
- Nam, Chung, et al. - 2010
95
Ergodic interference alignment
- Nazer, Gastpar, et al.
93
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal
- Lagarias, Lenstra, et al. - 1990
72
Metric Diophantine approximations on manifolds. Camb.Univ.Press
- Bernik - 1999
68
Sum rate characterization of joint multiple cell-site processing
- Somekh, Zaidel, et al. - 2007
58
Lattice strategies for the dirty multiple access channel
- Philosof, Zamir, et al. - 2011
58
Interference alignment with limited feedback
- Thukral, Bölcskei - 2009
53
Reliable physical layer network coding
- Nazer, Gastpar - 2011
52
The case for structured random codes in network capacity theorems
- Nazer, Gastpar - 2008
47
Capacity of noncoherent time-selective rayleigh-fading channels,” Information Theory
- Liang, Veeravalli - 2004
47
Uplink macro diversity of limited backhaul cellular network
- Sanderovich, Somekh, et al.
46
interference alignment with real numbers
- Motahari, Gharan, et al. - 2009
44
Lattice codes can achieve capacity on the AWGN channel
- Urbanke, Rimoldi - 1998
42
LLL reduction achieves the receive diversity in MIMO decoding
- Taherzadeh, Mobasher, et al. - 2007
41
Lattices are everywhere
- Zamir - 2009
40
A universal lattice decoder for fading channels
- Viterbo, Boutros - 1999
39
Some optimal codes have structure
- Buda - 1989
33
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs and system models
- Jalden, Elia - 2010
32
Environmental issues for MIMO capacity
- Bliss, Forsythe, et al. - 2002
31
Asymptotic performance of linear receivers in MIMO fading channels
- Kumar, Caire, et al. - 2009
25
Communication over MIMO broadcast channels using lattice-basis reduction
- Taherzadeh, Mobasher, et al. - 2007
24
Beyond the butterfly - a graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions
- Wang, Shroff - 2007
21
How to encode the modulo-two sum of binary sources (Corresp
- Körner, Marton - 1979
19
Distributed MIMO receiver – achievable rates and upper bounds
- Sanderovich, Shamai, et al. - 2009
18
Network coding for computing: Cut-set bounds
- Appuswamy, Franceschetti, et al. - 2011
18
The degrees of freedom of compute-and-forward
- Niesen, Whiting - 2012
14
Computation alignment: Capacity approximation without noise accumulation
- Niesen, Nazer, et al.
12
On distributed compression of linear functions
- Wagner - 2011
11
Multi-User Diversity vs. Accurate Channel State Information
- Ravindran, Jindal - 2009
10
Group Codes do not Achieve Shannon’s Channel Capacity for General Discrete
- Ahlswede - 1971
10
Network codes as codes on graphs
- Koetter, Effros, et al. - 2004
10
Algebraic network coding approach to deterministic wireless relay networks
- Kim, Medard
10
Structured superposition for backhaul constrained cellular uplink
- Nazer, Sanderovich, et al.
9
Practical code design for compute-and-forward
- Ordentlich, Zhan, et al.
8
Communicating the sum of sources in a 3sources/3-terminals network; revisited
- Langberg, Ramamoorthy - 2010
7
Gamal, “Distributed lossy averaging
- Su, El - 2010
7
Broadcasting with degraded message sets: A deterministic approach
- Prabhakaran, Diggavi, et al. - 2007
7
The degrees of freedom of isotropic mimo interference channels withoutstateinformationatthetransmitters,” Information Theory
- Zhu, Guo - 2012
4
Interference neutralization in distributed lossy source coding
- Maddah-Ali, Tse - 2010
4
Successive minima and best simultaneous Diophantine approximations
- Aliev, Henk - 2006
3
Communicating the sum of sources over a network,” arXiv:1001.5319
- Ramamoorthy, Langberg - 2010
3
M.Franceschetti, “Computing linear functions by linear coding over networks,” Submitted to
- Appuswamy - 2011
3
Communicating linear functions of correlated Gaussian sources over a MAC
- Soundararajan, Vishwanath - 2012
3
An algebraic mincut-maxflow theorem
- Park, Sahai
2
Corrected proof of de Buda’s theorem [lattice channel codes
- Linder, Schlegel, et al. - 1993
2
Integer-forcing architectures for mimo: Distributed implementation and sic integer-forcing architectures for MIMO: Distributed implementation and
- Ordentlich, Erez, et al. - 2010
2
Uplink macro diversity of limited backhaul cellular network
- Poor, Steinberg - 2009
1
Writing ondirty paper
- Costa - 1983
1
Aclose-to-capacitydirty papercoding scheme
- tenBrink - 2005
1
Jointlygaussian sources and reconstruction of a linear function
- Pradhan
1
Joint physical layer coding and network coding for bidirectional relaying
- Sprintson - 2010
1
ToolsandApplications to Two-User Gaussian Channels,” ArXiv e-prints
- Yener - 2009
1
communicationsinafadingenvironment when using multiple antennas
- Gans - 1998
1
An Introduction to DiophantineApproximations
- Cassels - 1957
1
Onthedualityofgaussianmultiple-access and broadcast channels
- Jindal, Goldsmith - 2004
1
Multiuser MIMO Achievable RateswithDownlinkTraining andChannel StateFeedback,” ArXiv e-prints
- Caire, Jindal, et al. - 2007
1
Metric Diophantine Approximation on Manifolds
- Lang - 1995