# | Title | Journal | Year | Citations |
---|
1 | Compressed sensing | IEEE Transactions on Information Theory | 2006 | 20,437 |
2 | Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information | IEEE Transactions on Information Theory | 2006 | 11,987 |
3 | Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior | IEEE Transactions on Information Theory | 2004 | 10,614 |
4 | Nearest neighbor pattern classification | IEEE Transactions on Information Theory | 1967 | 10,500 |
5 | Least squares quantization in PCM | IEEE Transactions on Information Theory | 1982 | 10,119 |
6 | New directions in cryptography | IEEE Transactions on Information Theory | 1976 | 10,009 |
7 | De-noising by soft-thresholding | IEEE Transactions on Information Theory | 1995 | 7,460 |
8 | Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit | IEEE Transactions on Information Theory | 2007 | 7,390 |
9 | Low-density parity-check codes | IEEE Transactions on Information Theory | 1962 | 6,837 |
10 | The capacity of wireless networks | IEEE Transactions on Information Theory | 2000 | 6,590 |
11 | Network information flow | IEEE Transactions on Information Theory | 2000 | 6,535 |
12 | Space-time codes for high data rate wireless communication: performance criterion and code construction | IEEE Transactions on Information Theory | 1998 | 5,875 |
13 | Space-time block codes from orthogonal designs | IEEE Transactions on Information Theory | 1999 | 5,628 |
14 | Visual pattern recognition by moment invariants | IEEE Transactions on Information Theory | 1962 | 5,242 |
15 | Decoding by Linear Programming | IEEE Transactions on Information Theory | 2005 | 5,199 |
16 | Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? | IEEE Transactions on Information Theory | 2006 | 5,193 |
17 | The wavelet transform, time-frequency localization and signal analysis | IEEE Transactions on Information Theory | 1990 | 5,036 |
18 | Error bounds for convolutional codes and an asymptotically optimum decoding algorithm | IEEE Transactions on Information Theory | 1967 | 4,800 |
19 | A public key cryptosystem and a signature scheme based on discrete logarithms | IEEE Transactions on Information Theory | 1985 | 4,755 |
20 | Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) | IEEE Transactions on Information Theory | 1974 | 4,731 |
21 | Factor graphs and the sum-product algorithm | IEEE Transactions on Information Theory | 2001 | 4,621 |
22 | A universal algorithm for sequential data compression | IEEE Transactions on Information Theory | 1977 | 3,772 |
23 | On the security of public key protocols | IEEE Transactions on Information Theory | 1983 | 3,669 |
24 | Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks | IEEE Transactions on Information Theory | 2003 | 3,431 |
25 | Singularity detection and processing with wavelets | IEEE Transactions on Information Theory | 1992 | 3,334 |
26 | Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels | IEEE Transactions on Information Theory | 2003 | 3,290 |
27 | Capacity theorems for the relay channel | IEEE Transactions on Information Theory | 1979 | 3,261 |
28 | Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels | IEEE Transactions on Information Theory | 2009 | 3,175 |
29 | Channel coding with multilevel/phase signals | IEEE Transactions on Information Theory | 1982 | 3,120 |
30 | Noiseless coding of correlated information sources | IEEE Transactions on Information Theory | 1973 | 3,078 |
31 | Divergence measures based on the Shannon entropy | IEEE Transactions on Information Theory | 1991 | 3,008 |
32 | Writing on dirty paper (Corresp.) | IEEE Transactions on Information Theory | 1983 | 2,996 |
33 | Good error-correcting codes based on very sparse matrices | IEEE Transactions on Information Theory | 1999 | 2,890 |
34 | Broadcast channels with confidential messages | IEEE Transactions on Information Theory | 1978 | 2,794 |
35 | Correction to 'On the Error Probability for a class of Binary Recursive Feedback Strategies' | IEEE Transactions on Information Theory | 1974 | 2,745 |
36 | Entropy-based algorithms for best basis selection | IEEE Transactions on Information Theory | 1992 | 2,702 |
37 | Linear network coding | IEEE Transactions on Information Theory | 2003 | 2,694 |
38 | Design of capacity-approaching irregular low-density parity-check codes | IEEE Transactions on Information Theory | 2001 | 2,578 |
39 | Greed is Good: Algorithmic Results for Sparse Approximation | IEEE Transactions on Information Theory | 2004 | 2,566 |
40 | Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel | IEEE Transactions on Information Theory | 2008 | 2,551 |
41 | Compression of individual sequences via variable-rate coding | IEEE Transactions on Information Theory | 1978 | 2,498 |
42 | Channel Coding Rate in the Finite Blocklength Regime | IEEE Transactions on Information Theory | 2010 | 2,397 |
43 | The rate-distortion function for source coding with side information at the decoder | IEEE Transactions on Information Theory | 1976 | 2,331 |
44 | The capacity of low-density parity-check codes under message-passing decoding | IEEE Transactions on Information Theory | 2001 | 2,297 |
45 | The estimation of the gradient of a density function, with applications in pattern recognition | IEEE Transactions on Information Theory | 1975 | 2,281 |
46 | On the mean accuracy of statistical pattern recognizers | IEEE Transactions on Information Theory | 1968 | 2,260 |
47 | A recursive approach to low complexity codes | IEEE Transactions on Information Theory | 1981 | 2,243 |
48 | Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference | IEEE Transactions on Information Theory | 1972 | 2,076 |
49 | On the Complexity of Finite Sequences | IEEE Transactions on Information Theory | 1976 | 2,064 |
50 | Opportunistic beamforming using dumb antennas | IEEE Transactions on Information Theory | 2002 | 2,060 |