Acknowledgment for Support.

The interference channel is a model for a wireless network where several source-destination pairs compete for the same resources. When the sources transmit simultaneously the destinations experience unwanted interference. Determining how to optimally manage the interference is a long standing open problem in network information theory. In this talk we review one emerging interference management technique: cooperation. Cooperation can occur among source nodes only (Source Cooperation or Generalized Feedback), or among destination nodes only (Destination Cooperation), or among all nodes (General Cooperation). For the special case of Gaussian noise channels, we compare the different forms of cooperation in terms of symmetric generalized degrees of freedom. When known, we also discuss capacity results to within a constant number of bits.

[1]  P. Ney.  DEVIATIONS FOR RANDOM WALK ON R d , 2016 .

[2]  Kong Bo,et al.  The Depth Spectrum for (1 - u) -Constacyclic Codes over Fp + uFp + ...u(k-1) Fp , 2016 .

[3]  Sebastian Fischer,et al.  Exploring Artificial Intelligence In The New Millennium , 2016 .

[4]  Yasushige Watase,et al.  Introduction to Diophantine Approximation , 2015, Formaliz. Math..

[5]  Jonathan Scarlett,et al.  On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding , 2013, IEEE Transactions on Information Theory.

[6]  Tsachy Weissman,et al.  Compression for Quadratic Similarity Queries , 2013, IEEE Transactions on Information Theory.

[7]  Tara Javidi,et al.  Extrinsic Jensen–Shannon Divergence: Applications to Variable-Length Coding , 2013, IEEE Transactions on Information Theory.

[8]  Shlomo Shamai,et al.  Comparison of the Achievable Rates in OFDM and Single Carrier Modulation with I.I.D. Inputs , 2013, IEEE Transactions on Information Theory.

[9]  Vincent Yan Fu Tan,et al.  Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information , 2013, IEEE Transactions on Information Theory.

[10]  Uri Erez,et al.  Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap , 2013, 2013 IEEE Information Theory Workshop (ITW).

[11]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[12]  Farrokh Etezadi,et al.  Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels , 2014, IEEE Transactions on Information Theory.

[13]  Troels Pedersen,et al.  Analysis of Stochastic Radio Channels With Temporal Birth-Death Dynamics: A Marked Spatial Point Process Perspective , 2014, IEEE Transactions on Antennas and Propagation.

[14]  Idoia Ochoa,et al.  Compression Schemes for Similarity Queries , 2014, 2014 Data Compression Conference.

[15]  Abbas El Gamal,et al.  An efficient feedback coding scheme with low error probability for discrete memoryless channels , 2013, 2014 IEEE International Symposium on Information Theory.

[16]  Christian Senger.  Prefactor Reduction of the Guruswami–Sudan Interpolation Step , 2014, IEEE Transactions on Information Theory.

[17]  Li Peng,et al.  Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections , 2013, IEEE Transactions on Information Theory.

[18]  Haim H. Permuter,et al.  Capacity of a POST Channel With and Without Feedback , 2014, IEEE Transactions on Information Theory.

[19]  Neri Merhav,et al.  Analysis of Mismatched Estimation Errors Using Gradients of Partition Functions , 2013, IEEE Transactions on Information Theory.

[20]  Albert Guillén i Fàbregas,et al.  Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations , 2013, IEEE Transactions on Information Theory.

[21]  Tobias Koch,et al.  A Rate-Splitting Approach to Fading Channels With Imperfect Channel-State Information , 2013, IEEE Transactions on Information Theory.

[22]  Amir Salman Avestimehr,et al.  Capacity Results for Binary Fading Interference Channels With Delayed CSIT , 2013, IEEE Transactions on Information Theory.

[23]  Syed Ali Jafar,et al.  Topological Interference Management Through Index Coding , 2013, IEEE Transactions on Information Theory.

[24]  Cong Ling,et al.  Semantically Secure Lattice Codes for the Gaussian Wiretap Channel , 2012, IEEE Transactions on Information Theory.

[25]  Haim H. Permuter,et al.  Capacity and Coding for the Ising Channel With Feedback , 2012, IEEE Transactions on Information Theory.

[26]  Tsachy Weissman,et al.  Multiterminal Source Coding Under Logarithmic Loss , 2011, IEEE Transactions on Information Theory.

[27]  Deniz Gündüz,et al.  Identification and Lossy Reconstruction in Noisy Databases , 2014, IEEE Transactions on Information Theory.

[28]  Martin Bossert,et al.  Improved Decoding of Partial Unit Memory Codes Using List Decoding of Reed--Solomon Codes , 2014 .

[29]  Tsachy Weissman,et al.  The Minimal Compression Rate for Similarity Identification , 2013, ArXiv.

[30]  Gernot Kubin,et al.  Information Loss and Anti-Aliasing Filters in Multirate Systems , 2013, ArXiv.

[31]  Matthieu R. Bloch,et al.  Coding for Secrecy: An Overview of Error-Control Coding Techniques for Physical-Layer Security , 2013, IEEE Signal Processing Magazine.

[32]  Zhong Zheng,et al.  On the Ergodic Mutual Information of Multiple Cluster Scattering MIMO Channels , 2013, IEEE Communications Letters.

[33]  Paul W. Cuff,et al.  The likelihood encoder for source coding , 2013, 2013 IEEE Information Theory Workshop (ITW).

[34]  Gernot Akemann,et al.  Products of rectangular random matrices: singular values and progressive scattering. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Youlong Wu,et al.  Any positive feedback rate increases the capacity of strictly less-noisy broadcast channels , 2013, 2013 IEEE Information Theory Workshop (ITW).

[36]  Cong Ling,et al.  Achieving the AWGN channel capacity with lattice Gaussian coding , 2013, 2013 IEEE International Symposium on Information Theory.

[37]  Maxim Raginsky,et al.  Logarithmic Sobolev inequalities and strong data processing theorems for discrete channels , 2013, 2013 IEEE International Symposium on Information Theory.

[38]  Frans M. J. Willems,et al.  Fundamental limits of identification: Identification rate, search and memory complexity trade-off , 2013, 2013 IEEE International Symposium on Information Theory.

[39]  Tsachy Weissman,et al.  Compression for exact match identification , 2013, 2013 IEEE International Symposium on Information Theory.

[40]  Shlomo Shamai,et al.  On the Synergistic Benefits of Alternating CSIT for the MISO Broadcast Channel , 2013, IEEE Transactions on Information Theory.

[41]  Frédérique E. Oggier,et al.  Coding Techniques for Repairability in Networked Distributed Storage Systems , 2013, Found. Trends Commun. Inf. Theory.

[42]  Amanda de Paula,et al.  Comparison of OFDM and SC-DFE Capacities Without Channel Knowledge at the Transmitter , 2013, ArXiv.

[43]  Vincent Yan Fu Tan,et al.  ε-Capacities and Second-Order Coding Rates for Channels with General State , 2013, ArXiv.

[44]  Yi Hong,et al.  Practical Secrecy using Artificial Noise , 2013, IEEE Communications Letters.

[45]  Ayfer Özgür,et al.  Improved capacity approximations for Gaussian relay networks , 2013, 2013 IEEE Information Theory Workshop (ITW).

[46]  Venkat Anantharam,et al.  On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover , 2013, ArXiv.

[47]  Gernot Kubin,et al.  On the Rate of Information Loss in Memoryless Systems , 2013, ArXiv.

[48]  Lu Wei,et al.  Singular value correlation functions for products of Wishart random matrices , 2013, ArXiv.

[49]  Tsachy Weissman,et al.  Quadratic Similarity Queries on Compressed Data , 2013, 2013 Data Compression Conference.

[50]  Fredrik Rusek,et al.  Faster-Than-Nyquist Signaling , 2013, Proceedings of the IEEE.

[51]  Andreas Schenk,et al.  Noncoherent Detection in Massive MIMO Systems , 2013, WSA.

[52]  Amin Gohari,et al.  A technique for deriving one-shot achievability results in network information theory , 2013, 2013 IEEE International Symposium on Information Theory.

[53]  Raef Bassily,et al.  Deaf Cooperation and Relay Selection Strategies for Secure Communication in Multiple Relay Networks , 2013, IEEE Transactions on Signal Processing.

[54]  Hua Sun,et al.  Topological interference management with alternating connectivity , 2013, 2013 IEEE International Symposium on Information Theory.

[55]  Jungwon Lee,et al.  On the construction and decoding of concatenated polar codes , 2013, 2013 IEEE International Symposium on Information Theory.

[56]  Henk D. L. Hollmann.  Storage codes — Coding rate and repair locality , 2013, 2013 International Conference on Computing, Networking and Communications (ICNC).

[57]  Neri Merhav.  Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics , 2013, IEEE Transactions on Information Theory.

[58]  Shuai Zhang,et al.  Controlling the Error Floor in LDPC Decoding , 2012, IEEE Transactions on Communications.

[59]  Paul W. Cuff,et al.  Distributed Channel Synthesis , 2012, IEEE Transactions on Information Theory.

[60]  Akbar M. Sayeed,et al.  Delay-Doppler channel estimation with almost linear complexity: To Solomon Golomb for the occasion of his 80 birthday mazel tov , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[61]  Andreas Schenk,et al.  Reduced complexity super-trellis decoding for convolutionally encoded transmission over ISI-channels , 2012, 2013 International Conference on Computing, Networking and Communications (ICNC).

[62]  Erik G. Larsson,et al.  Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays , 2012, IEEE Signal Process. Mag..

[63]  Roope Vehkalahti,et al.  Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra , 2011, IEEE Transactions on Information Theory.

[64]  Frédérique E. Oggier,et al.  An Error Probability Approach to MIMO Wiretap Channels , 2011, IEEE Transactions on Communications.

[65]  Sennur Ulukus,et al.  Multi-Receiver Wiretap Channel With Public and Confidential Messages , 2013, IEEE Transactions on Information Theory.

[66]  Soung Chang Liew,et al.  Physical-layer network coding: Tutorial, survey, and beyond , 2011, Phys. Commun..

[67]  Ramji Venkataramanan,et al.  An Achievable Rate Region for the Broadcast Channel With Feedback , 2013, IEEE Transactions on Information Theory.

[68]  Michele A. Wigger,et al.  On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback , 2010, IEEE Transactions on Information Theory.

[69]  Xiugang Wu,et al.  On the Optimal Compressions in the Compress-and-Forward Relay Schemes , 2010, IEEE Transactions on Information Theory.

[70]  Frank R. Kschischang,et al.  An Algebraic Approach to Physical-Layer Network Coding , 2010, IEEE Transactions on Information Theory.

[71]  Carles Padró,et al.  Information Theoretic Security , 2013, Lecture Notes in Computer Science.

[72]  Idoia Ochoa,et al.  Efficient similarity queries via lossy compression , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[73]  Xudong Wang,et al.  Cross-layer Scheduling in Multi-user System with Delay and Secrecy Constraints , 2012, ArXiv.

[74]  Christina Fragouli,et al.  Optimizing Quantize-Map-and-Forward relaying for Gaussian diamond networks , 2012, 2012 IEEE Information Theory Workshop.

[75]  Alexander Vardy,et al.  Semantic Security for the Wiretap Channel , 2012, CRYPTO.

[76]  Andreas Schenk,et al.  Matched Decoding for Punctured Convolutional Encoded Transmission Over ISI-Channels , 2012, ArXiv.

[77]  Ayfer Özgür,et al.  Achieving the capacity of the N-relay Gaussian diamond network within logn bits , 2012, 2012 IEEE Information Theory Workshop.

[78]  Vincent C. Gaudet,et al.  Switching Activity Minimization in Iterative LDPC Decoders , 2012, J. Signal Process. Syst..

[79]  A. Lee Swindlehurst,et al.  Outage performance for amplify-and-forward channels with an unauthenticated relay , 2012, 2012 IEEE International Conference on Communications (ICC).

[80]  Shlomo Shamai,et al.  Retrospective Interference Alignment Over Interference Networks , 2012, IEEE Journal of Selected Topics in Signal Processing.

[81]  Gernot Kubin,et al.  Signal Enhancement as Minimization of Relevant Information Loss , 2012, ArXiv.

[82]  Tsachy Weissman,et al.  The porosity of additive noise sequences , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[83]  Abbas El Gamal,et al.  Three-Receiver Broadcast Channels With Common and Confidential Messages , 2012, IEEE Transactions on Information Theory.

[84]  Thomas A. Courtade.  Information masking and amplification: The source coding setting , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[85]  Farrokh Etezadi,et al.  Prospicient Real-Time Coding of Markov Sources over Burst Erasure Channels: Lossless Case , 2012, 2012 Data Compression Conference.

[86]  Gernot Kubin,et al.  Relative information loss in the PCA , 2012, 2012 IEEE Information Theory Workshop.

[87]  Xinbing Wang,et al.  Impact of secrecy on capacity in large-scale wireless networks , 2012, 2012 Proceedings IEEE INFOCOM.

[88]  Meir Feder,et al.  Communication over Individual Channels -- a general framework , 2012, ArXiv.

[89]  Syed Ali Jafar,et al.  Optimal Use of Current and Outdated Channel State Information: Degrees of Freedom of the MISO BC with Mixed CSIT , 2012, IEEE Communications Letters.

[90]  David Gesbert,et al.  Degrees of Freedom of Time Correlated MISO Broadcast Channel With Delayed CSIT , 2012, IEEE Transactions on Information Theory.

[91]  Moe Z. Win,et al.  Secure Communication in Stochastic Wireless Networks—Part II: Maximum Rate and Collusion , 2012, IEEE Transactions on Information Forensics and Security.

[92]  Patrick Solé,et al.  Cyclic codes over $M_2(\F_2)$ , 2012, ArXiv.

[93]  Vincent Y. F. Tan,et al.  On the dispersions of three network information theory problems , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[94]  Joakim Jaldén,et al.  Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel , 2011, IEEE Transactions on Information Theory.

[95]  Alexandros G. Dimakis,et al.  LDPC Codes for Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[96]  Daniela Tuninetti,et al.  Inner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results , 2010, IEEE Transactions on Information Theory.

[97]  Mohammad Ali Maddah-Ali,et al.  Completely Stale Transmitter Channel State Information is Still Very Useful , 2010, IEEE Transactions on Information Theory.

[98]  Massimo Franceschetti,et al.  LQG Control Approach to Gaussian Broadcast Channels With Feedback , 2010, IEEE Transactions on Information Theory.

[99]  Onur Ozan Koyluoglu,et al.  On Secrecy Capacity Scaling in Wireless Networks , 2012, IEEE Transactions on Information Theory.

[100]  Sanjeev Arora,et al.  Message-Passing Algorithms and Improved LP Decoding , 2009, IEEE Transactions on Information Theory.

[101]  Mokshay M. Madiman,et al.  Entropy and set cardinality inequalities for partition‐determined functions , 2008, Random Struct. Algorithms.

[102]  Farrokh Etezadi,et al.  Real-Time Coding of Markov Sources over Erasure Channels , 2012 .

[103]  Jean-Claude Belfiore.  Lattice codes for the compute-and-forward protocol: The flatness factor , 2011, 2011 IEEE Information Theory Workshop.

[104]  Aydin Sezgin,et al.  Secrecy in broadcast channels with receiver side information , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[105]  Andreas Schenk,et al.  Design rules for bit-interleaved coded impulse-radio ultra-wideband modulation with autocorrelation-based detection , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[106]  Michael Gastpar,et al.  New achievable rates for the Gaussian broadcast channel with feedback , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[107]  Frank R. Kschischang,et al.  A Simplified Successive-Cancellation Decoder for Polar Codes , 2011, IEEE Communications Letters.

[108]  Ranjan K. Mallik,et al.  Distribution of Inner Product of Complex Gaussian Random Vectors and its Applications , 2011, IEEE Transactions on Communications.

[109]  Stark C. Draper,et al.  On reliability of content identification from databases based on noisy queries , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[110]  Eli Haim,et al.  Improving the MAC error exponent using distributed structure , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[111]  Alexandros G. Dimakis,et al.  Explicit matrices for sparse approximation , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[112]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[113]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .

[114]  Aaron B. Wagner,et al.  Refinement of the sphere packing bound for symmetric channels , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[115]  Gernot Kubin,et al.  On the Information Loss in Memoryless Systems: The Multivariate Case , 2011, ArXiv.

[116]  Urs Niesen,et al.  Computation Alignment: Capacity Approximation Without Noise Accumulation , 2011, IEEE Transactions on Information Theory.

[117]  G. Lauer.  Some optimal partial-unit-memory codes , 2011 .

[118]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[119]  Zhen Zhang,et al.  Rate Distortion Theory for Causal Video Coding: Characterization, Computation Algorithm, and Comparison , 2011, IEEE Transactions on Information Theory.

[120]  Daniela Tuninetti,et al.  New Inner and Outer Bounds for the Memoryless Cognitive Interference Channel and Some New Capacity Results , 2011, IEEE Transactions on Information Theory.

[121]  Gernot Kubin,et al.  Some results on the information loss in dynamical systems , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[122]  C. M. Folkman,et al.  Sketched oxide single-electron transistor. , 2011, Nature nanotechnology.

[123]  Vahid Tarokh,et al.  Spectral Distribution of Random Matrices From Binary Linear Block Codes , 2011, IEEE Transactions on Information Theory.

[124]  Matthieu R. Bloch,et al.  Wireless Secrecy Regions With Friendly Jamming , 2011, IEEE Transactions on Information Forensics and Security.

[125]  Brendan D. McKay,et al.  Subgraphs of random graphs with specified degrees , 2011 .

[126]  Ram Zamir,et al.  A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n , 2011, ArXiv.

[127]  Kin K. Leung,et al.  Opportunistic Relaying for Secrecy Communications: Cooperative Jamming vs. Relay Chatting , 2011, IEEE Transactions on Wireless Communications.

[128]  Emmanuel Abbe,et al.  Randomness and dependencies extraction via polarization , 2011, 2011 Information Theory and Applications Workshop.

[129]  Mikael Skoglund,et al.  Outage performances for amplify-and-forward, decode-and-forward and cooperative jamming strategies for the wiretap channel , 2011, 2011 IEEE Wireless Communications and Networking Conference.

[130]  Gerhard Kramer,et al.  Short-message quantize-forward network coding , 2011, 2011 8th International Workshop on Multi-Carrier Systems & Solutions.

[131]  Gernot Kubin,et al.  Information loss in static nonlinearities , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[132]  Masahito Hayashi,et al.  Secure Multiplex Network Coding , 2011, 2011 International Symposium on Networking Coding.

[133]  Johannes B. Huber,et al.  Reduced-complexity collaborative decoding of interleaved Reed-Solomon and Gabidulin codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[134]  Anne-Marie Kermarrec,et al.  Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes , 2011, 2011 International Symposium on Networking Coding.

[135]  Kenneth W. Shum.  Cooperative Regenerating Codes for Distributed Storage Systems , 2011, 2011 IEEE International Conference on Communications (ICC).

[136]  Michael Gastpar,et al.  Reliable Physical Layer Network Coding , 2011, Proceedings of the IEEE.

[137]  Masahito Hayashi,et al.  Secure multiplex coding with a common message , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[138]  Heide Gluesing-Luerssen,et al.  Characteristic Generators and Dualization for Tail-Biting Trellises , 2011, IEEE Transactions on Information Theory.

[139]  Andreas Schenk,et al.  Decision-Feedback Differential Detection in Impulse-Radio Ultra-Wideband Systems , 2011, IEEE Transactions on Communications.

[140]  Urs Niesen,et al.  The Degrees of Freedom of Compute-and-Forward , 2011, IEEE Transactions on Information Theory.

[141]  Haim H. Permuter,et al.  To feed or not to feed back , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[142]  Mikael Skoglund,et al.  Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[143]  Krishna R. Narayanan,et al.  Multilevel coding schemes for compute-and-forward , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[144]  Andrew Thangaraj,et al.  Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes , 2010, IEEE Transactions on Information Forensics and Security.

[145]  Frédérique Oggier,et al.  Self-repairing homomorphic codes for distributed storage systems , 2010, 2011 Proceedings IEEE INFOCOM.

[146]  Daniela Tuninetti,et al.  Interference Channel With Generalized Feedback (a.k.a. With Source Cooperation): Part I: Achievable Region , 2010, IEEE Transactions on Information Theory.

[147]  Alexander Vardy,et al.  The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes , 2011, IEEE Transactions on Information Theory.

[148]  David Tse,et al.  Interference mitigation through limited transmitter cooperation , 2010, 2010 IEEE International Symposium on Information Theory.

[149]  Neri Merhav.  Rate–Distortion Function via Minimum Mean Square Error Estimation , 2011, IEEE Transactions on Information Theory.

[150]  Shlomo Shamai,et al.  Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error , 2010, IEEE Transactions on Information Theory.

[151]  Heide Gluesing-Luerssen,et al.  Linear Tail-Biting Trellises: Characteristic Generators and the BCJR-Construction , 2010, IEEE Transactions on Information Theory.

[152]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

[153]  Alexander Vardy,et al.  Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes , 2010, IEEE Transactions on Information Theory.

[154]  Byung-Jae Kwak,et al.  LDPC Codes for the Gaussian Wiretap Channel , 2009, IEEE Transactions on Information Forensics and Security.

[155]  Neri Merhav.  Optimum Estimation via Gradients of Partition Functions and Information Measures: A Statistical-Mechanical Perspective , 2011, IEEE Transactions on Information Theory.

[156]  David Tse,et al.  Interference Mitigation Through Limited Receiver Cooperation , 2009, IEEE Transactions on Information Theory.

[157]  Meir Feder,et al.  Optimal Feedback Communication Via Posterior Matching , 2009, IEEE Transactions on Information Theory.

[158]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[159]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

[160]  Nicolas Macris,et al.  Decay of Correlations for Sparse Graph Error Correcting Codes , 2011, SIAM J. Discret. Math..

[161]  Sergey Loyka,et al.  From Multi-Keyholes to Measure of Correlation and Power Imbalance in MIMO Channels: Outage Capacity Analysis , 2008, IEEE Transactions on Information Theory.

[162]  Uri Erez,et al.  Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.

[163]  Prakash Ishwar,et al.  On Delayed Sequential Coding of Correlated Sources , 2011, IEEE Transactions on Information Theory.

[164]  Jean-Claude Belfiore,et al.  Diversity-Multiplexing Tradeoff of Double Scattering MIMO Channels , 2006, IEEE Transactions on Information Theory.

[165]  Amanda de Paula,et al.  A comparison between OFDM and single-carrier with cyclic prefix using channel coding and frequency-selective block fading channels , 2011 .

[166]  Tsachy Weissman,et al.  Pointwise Relations between Information and Estimation , 2011, ArXiv.

[167]  Ram Zamir.  Can Structure Beat Random ?-The Story of Lattice Codes , 2011 .

[168]  M. R. Leadbetter.  Poisson Processes , 2011, International Encyclopedia of Statistical Science.

[169]  Sergey Loyka,et al.  On Outage Probability and Diversity-Multiplexing Tradeoff in MIMO Relay Channels , 2011, IEEE Transactions on Communications.

[170]  Haim H. Permuter,et al.  Extension of the Blahut-Arimoto algorithm for maximizing directed information , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[171]  Shlomo Shamai,et al.  On the dirty paper channel with fading dirt , 2010, 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel.

[172]  Meir Feder,et al.  Universal Communication over Modulo-additive Channels with an Individual Noise Sequence , 2010, ArXiv.

[173]  Neri Merhav,et al.  Statistical Physics and Information Theory , 2010, Found. Trends Commun. Inf. Theory.

[174]  Yvo Desmedt,et al.  General Perfectly Secure Message Transmission Using Linear Codes , 2010, ASIACRYPT.

[175]  Frans M. J. Willems,et al.  Fundamental limits for biometric identification with a database containing protected templates , 2010, 2010 International Symposium On Information Theory & Its Applications.

[176]  Frans M. J. Willems,et al.  Identification and secret-key binding in binary-symmetric template-protected biometric systems , 2010, 2010 IEEE International Workshop on Information Forensics and Security.

[177]  Bernd Girod,et al.  Forward Error Protection for low-delay packet video , 2010, 2010 18th International Packet Video Workshop.

[178]  Yasutada Oohama.  Gaussian Zig-Zag Source Coding Problem , 2010, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[179]  Thomas L. Marzetta,et al.  Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas , 2010, IEEE Transactions on Wireless Communications.

[180]  Johannes B. Huber,et al.  Improving successive cancellation decoding of polar codes by usage of inner block codes , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[181]  Masahito Hayashi,et al.  Strong security and separated code constructions for the broadcast channels with confidential messages , 2010, ArXiv.

[182]  Nan Liu,et al.  Wiretap channel with shared key , 2010, 2010 IEEE Information Theory Workshop.

[183]  Frans M. J. Willems,et al.  Identification and secret-key generation in biometric systems with protected templates , 2010, MM&Sec '10.

[184]  Tsachy Weissman,et al.  The Relationship Between Causal and Noncausal Mismatched Estimation in Continuous-Time AWGN Channels , 2010, IEEE Transactions on Information Theory.

[185]  Paul W. Cuff.  Using a secret key to foil an eavesdropper , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[186]  Paul W. Cuff.  A Framework for Partial Secrecy , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[187]  Toshiyuki Tanaka,et al.  Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes , 2010, 2010 IEEE Information Theory Workshop.

[188]  Mikael Skoglund,et al.  Nested Polar Codes for Wiretap and Relay Channels , 2010, IEEE Communications Letters.

[189]  Aaron B. Wagner,et al.  Moderate deviation analysis of channel coding: Discrete memoryless case , 2010, 2010 IEEE International Symposium on Information Theory.

[190]  Emre Telatar,et al.  Polar codes for q-ary source coding , 2010, 2010 IEEE International Symposium on Information Theory.

[191]  Mokshay M. Madiman,et al.  The entropies of the sum and the difference of two IID random variables are not too different , 2010, 2010 IEEE International Symposium on Information Theory.

[192]  Christian Senger,et al.  A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codes , 2010, 2010 IEEE International Symposium on Information Theory.

[193]  A. Robert Calderbank,et al.  Why Gabor frames? Two fundamental measures of coherence and their role in model selection , 2010, Journal of Communications and Networks.

[194]  Andreas Schenk,et al.  Soft-output sphere decoder for multiple-symbol differential detection of impulse-radio ultra-wideband , 2010, 2010 IEEE International Symposium on Information Theory.

[195]  Suhas N. Diggavi,et al.  Approximately achieving Gaussian relay network capacity with lattice codes , 2010, 2010 IEEE International Symposium on Information Theory.

[196]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[197]  Marco Baldi,et al.  Non-systematic codes for physical layer security , 2010, 2010 IEEE Information Theory Workshop.

[198]  P. Vary,et al.  Semi-analytical solution for rate distortion function and OPTA for sources with arbitrary distribution , 2010, 2010 International ITG Conference on Source and Channel Coding (SCC).

[199]  Martin Bossert,et al.  On the equivalence of Sudan-decoding and decoding via virtual extension to an interleaved Reed-Solomon code , 2010, 2010 International ITG Conference on Source and Channel Coding (SCC).

[200]  Jose C. Principe,et al.  Information Theoretic Learning - Renyi's Entropy and Kernel Perspectives , 2010, Information Theoretic Learning.

[201]  Michael Gastpar,et al.  Integer-forcing linear receivers , 2010, 2010 IEEE International Symposium on Information Theory.

[202]  Gregory W. Wornell,et al.  Causal Transmission of Colored Source Frames over a Packet Erasure Channel , 2010, 2010 Data Compression Conference.

[203]  Wei Yu,et al.  On the symmetric capacity of the K-user symmetric cyclic Gaussian interference channel , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[204]  Helmut Bölcskei,et al.  Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding , 2010, IEEE Transactions on Information Theory.

[205]  Zhu Han,et al.  Improving Wireless Physical Layer Security via Cooperating Relays , 2010, IEEE Transactions on Signal Processing.

[206]  Emre Telatar,et al.  Polar Codes for the m-User MAC , 2010 .

[207]  Wei Yu,et al.  Design of irregular LDPC codes with optimized performance-complexity tradeoff , 2010, IEEE Transactions on Communications.

[208]  Michael Huber.  Combinatorial bounds and characterizations of splitting authentication codes , 2010, Cryptography and Communications.

[209]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

[210]  Erdal Arikan,et al.  Source polarization , 2010, 2010 IEEE International Symposium on Information Theory.

[211]  Mayank Bakshi,et al.  Concatenated Polar codes , 2010, 2010 IEEE International Symposium on Information Theory.

[212]  A. Robert Calderbank,et al.  Construction of a Large Class of Deterministic Sensing Matrices That Satisfy a Statistical Isometry Property , 2009, IEEE Journal of Selected Topics in Signal Processing.

[213]  Haim H. Permuter,et al.  Coordination Capacity , 2009, IEEE Transactions on Information Theory.

[214]  Jian-Kang Zhang,et al.  Novel Rotated Quasi-Orthogonal Space-Time Block Codes With the Fixed Nearest Neighbor Number , 2009, IEEE Signal Processing Letters.

[215]  Sergio Verdú,et al.  Mismatched Estimation and Relative Entropy , 2009, IEEE Transactions on Information Theory.

[216]  Terence Tao,et al.  Sumset and Inverse Sumset Theory for Shannon Entropy , 2009, Combinatorics, Probability and Computing.

[217]  Rüdiger L. Urbanke,et al.  Polar Codes are Optimal for Lossy Source Coding , 2009, IEEE Transactions on Information Theory.

[218]  Shlomo Shamai,et al.  Statistical Physics of Signal Estimation in Gaussian Noise: Theory and Examples of Phase Transitions , 2008, IEEE Transactions on Information Theory.

[219]  Alexander Sprintson,et al.  Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.

[220]  Ezio Biglieri,et al.  Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[221]  Martin Bossert,et al.  Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis , 2010, IEEE Transactions on Information Theory.

[222]  Young-Han Kim,et al.  Feedback Capacity of Stationary Gaussian Channels , 2006, 2006 IEEE International Symposium on Information Theory.

[223]  T. Ho,et al.  On Linear Network Coding , 2010 .

[224]  Nevio Benvenuto,et al.  Single Carrier Modulation With Nonlinear Frequency Domain Equalization: An Idea Whose Time Has Come—Again , 2010, Proceedings of the IEEE.

[225]  Alexandros G. Dimakis,et al.  Channel Coding LP Decoding and Compressed Sensing LP Decoding: Further Connections ∗ , 2010 .

[226]  Frans M. J. Willems,et al.  Biometric Systems: Privacy and Secrecy Aspects , 2009, IEEE Transactions on Information Forensics and Security.

[227]  Alexandros G. Dimakis,et al.  LP decoding meets LP decoding: A connection between channel coding and compressed sensing , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[228]  A. Robert Calderbank,et al.  Efficient and Robust Compressed Sensing Using Optimized Expander Graphs , 2009, IEEE Transactions on Information Theory.

[229]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[230]  J. Romme,et al.  Noncoherent ultra-wideband systems , 2009, IEEE Signal Processing Magazine.

[231]  Frans M. J. Willems,et al.  Searching methods for biometric identification systems: Fundamental limits , 2009, 2009 IEEE International Symposium on Information Theory.

[232]  Todd P. Coleman,et al.  A stochastic control viewpoint on ‘Posterior Matching’-style feedback communication schemes , 2009, 2009 IEEE International Symposium on Information Theory.

[233]  Leandros Tassiulas,et al.  Broadcast erasure channel with feedback - Capacity and algorithms , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[234]  Moe Z. Win,et al.  Wireless physical-layer security: The case of colluding eavesdroppers , 2009, 2009 IEEE International Symposium on Information Theory.

[235]  Ram Zamir,et al.  On the Loss of Single-Letter Characterization: The Dirty Multiple Access Channel , 2009, IEEE Transactions on Information Theory.

[236]  Johannes B. Huber,et al.  LDPC codes and convolutional codes with equal structural delay: a comparison , 2009, IEEE Transactions on Communications.

[237]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[238]  J. Boutros.  Diversity and coding gain evolution in graph codes , 2009, 2009 Information Theory and Applications Workshop.

[239]  Norman C. Beaulieu,et al.  On the ergodic capacity of multi-hop wireless relaying systems , 2009, IEEE Transactions on Wireless Communications.

[240]  Shlomo Shamai,et al.  Compound Wiretap Channels , 2009, EURASIP J. Wirel. Commun. Netw..

[241]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit , 2009, ArXiv.

[242]  Lutz H.-J. Lampe,et al.  Decision-Feedback Subset Multiple-Symbol Differential Detection for Unitary Space-Time Modulation , 2009, IEEE Transactions on Vehicular Technology.

[243]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[244]  Rüdiger L. Urbanke,et al.  Polar codes: Characterization of exponent, bounds, and constructions , 2009, 2009 IEEE International Symposium on Information Theory.

[245]  Imre Z. Ruzsa.  Sumsets and entropy , 2009, Random Struct. Algorithms.

[246]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[247]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

[248]  Olgica Milenkovic,et al.  Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.

[249]  Masahito Hayashi,et al.  Information Spectrum Approach to Second-Order Coding Rate in Channel Coding , 2008, IEEE Transactions on Information Theory.

[250]  Igal Sason,et al.  Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel , 2007, IEEE Transactions on Information Theory.

[251]  Igal Sason,et al.  On Universal Properties of Capacity-Approaching LDPC Code Ensembles , 2007, IEEE Transactions on Information Theory.

[252]  S. Sandeep Pradhan,et al.  Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function , 2007, IEEE Transactions on Information Theory.

[253]  Sekhar Tatikonda,et al.  The Capacity of Channels With Feedback , 2006, IEEE Transactions on Information Theory.

[254]  Ertem Tuncel.  Capacity/Storage Tradeoff in High-Dimensional Identification Systems , 2006, IEEE Transactions on Information Theory.

[255]  Dimitri P. Bertsekas,et al.  Neuro-Dynamic Programming , 2009, Encyclopedia of Optimization.

[256]  Michael I. Jordan,et al.  Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..

[257]  M. Loncar,et al.  On the asymptotic performance of low-complexity decoded LDPC codes with constituent hamming codes , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[258]  G. Ferrari,et al.  On information theoretic aspects of single- and multi-carrier communications , 2008, 2008 Information Theory and Applications Workshop.

[259]  A. Dasgupta.  Asymptotic Theory of Statistics and Probability , 2008 .

[260]  Shamgar Gurevich,et al.  The Finite Harmonic Oscillator and Its Applications to Sequences, Communication, and Radar , 2008, IEEE Transactions on Information Theory.

[261]  Mehul Motani,et al.  On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.

[262]  Rohit Negi,et al.  Guaranteeing Secrecy using Artificial Noise , 2008, IEEE Transactions on Wireless Communications.

[263]  Vahid Tarokh,et al.  A Frame Construction and a Universal Distortion Bound for Sparse Representations , 2008, IEEE Transactions on Signal Processing.

[264]  Vincenzo Lottici,et al.  Multiple symbol differential detection for UWB communications , 2008, IEEE Transactions on Wireless Communications.

[265]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[266]  Ram Zamir,et al.  Entropy Amplification Property and the Loss for Writing on Dirty Paper , 2008, IEEE Transactions on Information Theory.

[267]  A. Lapidoth,et al.  On the entropy of the sum and of the difference of independent random variables , 2008, 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel.

[268]  Helmut Bölcskei,et al.  Soft-output sphere decoding: algorithms and VLSI implementation , 2008, IEEE Journal on Selected Areas in Communications.

[269]  D. Stoyan,et al.  Statistical Analysis and Modelling of Spatial Point Patterns , 2008 .

[270]  Neri Merhav,et al.  Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators , 2007, IEEE Transactions on Information Theory.

[271]  Yi Jiang,et al.  The generalized triangular decomposition , 2007, Math. Comput..

[272]  Suhas N. Diggavi,et al.  Side-Information Scalable Source Coding , 2007, IEEE Transactions on Information Theory.

[273]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[274]  Roy D. Yates,et al.  Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions , 2007, IEEE Transactions on Information Theory.

[275]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[276]  Hesham El Gamal,et al.  The Relay–Eavesdropper Channel: Cooperation for Secrecy , 2006, IEEE Transactions on Information Theory.

[277]  Haim H. Permuter,et al.  Capacity of the Trapdoor Channel With Feedback , 2006, IEEE Transactions on Information Theory.

[278]  Igal Sason,et al.  An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels , 2006, IEEE Transactions on Information Theory.

[279]  Pramod Viswanath,et al.  Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem , 2005, IEEE Transactions on Information Theory.

[280]  Joseph A. O'Sullivan,et al.  Achievable Rates for Pattern Recognition , 2005, IEEE Transactions on Information Theory.

[281]  Strong Secrecy for Wireless Channels , 2008 .

[282]  Sergey Loyka,et al.  Finite-SNR Diversity-Multiplexing Tradeoff via Asymptotic Analysis of Large MIMO Systems , 2010, IEEE Transactions on Information Theory.

[283]  Christina Fragouli,et al.  On Capacity of Line Networks , 2007, IEEE Transactions on Information Theory.

[284]  G.J.M. Janssen,et al.  Performance Analysis of UWB Autocorrelation Receivers Over Nakagami-Fading Channels , 2007, IEEE Journal of Selected Topics in Signal Processing.

[285]  Lizhong Zheng,et al.  Amplify-and-Forward in Wireless Relay Networks: Rate, Diversity, and Network Size , 2007, IEEE Transactions on Information Theory.

[286]  C. Schlegel,et al.  LDPC Decoder Message Formatting Based on Activity Factor Minimization Using Differential Density Evolution , 2007, 2007 IEEE Information Theory Workshop.

[287]  S. Shamai,et al.  Capacity for Classes of Broadcast Channels with Receiver Side Information , 2007, 2007 IEEE Information Theory Workshop.

[288]  Weiyu Xu,et al.  Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.

[289]  David Tse,et al.  Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels , 2007, IEEE Transactions on Information Forensics and Security.

[290]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[291]  Ronald A. DeVore,et al.  Deterministic constructions of compressed sensing matrices , 2007, J. Complex..

[292]  Minghua Chen,et al.  Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[293]  Amin Shokrollahi,et al.  Raptor codes , 2011, IEEE Transactions on Information Theory.

[294]  Andrea Montanari,et al.  Asymptotic Rate versus Design Rate , 2007, 2007 IEEE International Symposium on Information Theory.

[295]  Yasutada Oohama,et al.  Capacity Theorems for Relay Channels with Confidential Messages , 2007, 2007 IEEE International Symposium on Information Theory.

[296]  Yi Jiang,et al.  Diversity-Multiplexing Tradeoff of MIMO Systems with Antenna Selection , 2007, 2007 IEEE International Symposium on Information Theory.

[297]  Larry J. Greenstein,et al.  Fingerprints in the Ether: Using the Physical Layer for Wireless Authentication , 2007, 2007 IEEE International Conference on Communications.

[298]  P. Vijay Kumar,et al.  Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels , 2007, ArXiv.

[299]  Riccardo Zecchina,et al.  Encoding for the Blackwell Channel with Reinforced Belief Propagation , 2007, 2007 IEEE International Symposium on Information Theory.

[300]  John S. Thompson,et al.  MIMO Configurations for Relay Channels: Theory and Practice , 2007, IEEE Transactions on Wireless Communications.

[301]  Soung Chang Liew,et al.  > Replace This Line with Your Paper Identification Number (double-click Here to Edit) < 1 , 2022 .

[302]  Yejun He,et al.  Performance Evaluation of Adaptive Two-Dimensional Turbo Product Codes Composed of Hamming Codes , 2007, 2007 IEEE International Conference on Integration Technology.

[303]  Serap A. Savari,et al.  Communicating Probability Distributions , 2007, IEEE Transactions on Information Theory.

[304]  Igal Sason,et al.  Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications , 2007, IEEE Transactions on Information Theory.

[305]  Y.-H. Kim,et al.  A Coding Theorem for a Class of Stationary Channels with Feedback , 2007, 2007 IEEE International Symposium on Information Theory.

[306]  A. Robert Calderbank,et al.  Applications of LDPC Codes to the Wiretap Channel , 2004, IEEE Transactions on Information Theory.

[307]  Desmond P. Taylor,et al.  A Statistical Model for Indoor Multipath Propagation , 2007 .

[308]  Massimo Franceschetti,et al.  SPECIAL ISSUE ON MODELS, THEORY, AND CODES FOR RELAYING AND COOPERATION IN COMMUNICATION NETWORKS , 2007 .

[309]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[310]  Johannes B. Huber,et al.  Information Combining , 2006, Found. Trends Commun. Inf. Theory.

[311]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[312]  Vinod M. Prabhakaran,et al.  Syndrome-Based Robust Video Transmission Over Networks with Bursty Losses , 2006, 2006 International Conference on Image Processing.

[313]  Johannes A. Buchmann,et al.  Perspectives for cryptographic long-term security , 2006, CACM.

[314]  Shlomo Shamai,et al.  The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel , 2006, IEEE Transactions on Information Theory.

[315]  Andrea J. Goldsmith,et al.  Finite State Channels With Time-Invariant Deterministic Feedback , 2006, IEEE Transactions on Information Theory.

[316]  Nan Guo,et al.  Improved autocorrelation demodulation receivers based on multiple-symbol detection for UWB communications , 2006, IEEE Transactions on Wireless Communications.

[317]  Georg Schmidt,et al.  Multi-Sequence Linear Shift-Register Synthesis: The Varying Length Case , 2006, 2006 IEEE International Symposium on Information Theory.

[318]  Miguel R. D. Rodrigues,et al.  Secrecy Capacity of Wireless Channels , 2006, 2006 IEEE International Symposium on Information Theory.

[319]  J. Nicholas Laneman,et al.  Modulation and demodulation for cooperative diversity in wireless systems , 2006, IEEE Transactions on Wireless Communications.

[320]  Piotr Sniady,et al.  Second order freeness and fluctuations of random matrices. III: Higher order freeness and free cumulants , 2006, Documenta Mathematica.

[321]  Tie Liu,et al.  An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems , 2006, IEEE Transactions on Information Theory.

[322]  Anders Høst-Madsen,et al.  Capacity bounds for Cooperative diversity , 2006, IEEE Transactions on Information Theory.

[323]  Lutz H.-J. Lampe,et al.  "Turbo DPSK" using soft multiple-symbol differential sphere decoding , 2006, IEEE Transactions on Information Theory.

[324]  Michael Chertkov,et al.  Loop series for discrete statistical models on graphs , 2006, ArXiv.

[325]  Ralf Koetter,et al.  On the Block Error Probability of LP Decoding of LDPC Codes , 2006, ArXiv.

[326]  Aggelos Bletsas,et al.  A simple Cooperative diversity method based on network path selection , 2005, IEEE Journal on Selected Areas in Communications.

[327]  E. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[328]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[329]  Zixiang Xiong,et al.  On dualities in multiterminal coding problems , 2006, IEEE Transactions on Information Theory.

[330]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[331]  A. Robert Calderbank,et al.  The Finite Heisenberg-Weyl Groups in Radar and Communications , 2006, EURASIP J. Adv. Signal Process..

[332]  Golan Yona,et al.  BIOZON: a system for unification, management and analysis of heterogeneous biological data , 2006, BMC Bioinformatics.

[333]  Hirosuke Yamamoto,et al.  How to attain the ordinary channel capacity securely in wiretap channels , 2005, IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005..

[334]  C. Chong,et al.  A modified S-V clustering channel model for the UWB indoor residential environment , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[335]  Muriel Médard,et al.  Interference management via capacity-achieving codes for the deterministic broadcast channel , 2005, IEEE Information Theory Workshop, 2005..

[336]  Muriel Médard,et al.  Rate-splitting for the deterministic broadcast channel , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[337]  Wei Yu,et al.  Coding for the blackwell channel: a survey propagation approach , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[338]  Meir Feder,et al.  Communicating using feedback over a binary channel with arbitrary noise sequence , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[339]  Gil I. Shamir,et al.  Non-systematic low-density parity-check codes for nonuniform sources , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[340]  R. Negi,et al.  Secret communication in presence of colluding eavesdroppers , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[341]  Simon Litsyn,et al.  Lattices which are good for (almost) everything , 2005, IEEE Transactions on Information Theory.

[342]  Guang Gong,et al.  Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar , 2005 .

[343]  Oded Regev,et al.  On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.

[344]  Ralf R. Müller,et al.  MIMO channel modeling and the principle of maximum entropy , 2005, IEEE Transactions on Information Theory.

[345]  A. Lee Swindlehurst,et al.  A vector-perturbation technique for near-capacity multiantenna multiuser communication-part II: perturbation , 2005, IEEE Transactions on Communications.

[346]  Gennian Ge,et al.  Combinatorial Constructions for Optimal Splitting Authentication Codes , 2005, SIAM J. Discret. Math..

[347]  Antonia Maria Tulino,et al.  Asymptotic outage capacity of multiantenna channels , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[348]  Hong Shen,et al.  A relation between the Characteristic Generators of a linear code and its dual , 2005, IEEE Transactions on Information Theory.

[349]  Martin J. Wainwright,et al.  Using linear programming to Decode Binary linear codes , 2005, IEEE Transactions on Information Theory.

[350]  Toby Berger,et al.  The capacity of finite-State Markov Channels With feedback , 2005, IEEE Transactions on Information Theory.

[351]  Shlomo Shamai,et al.  Mutual information and minimum mean-square error in Gaussian channels , 2004, IEEE Transactions on Information Theory.

[352]  Ezio Biglieri,et al.  Coding for Wireless Channels , 2005 .

[353]  Douglas R. Stinson,et al.  The combinatorics of authentication and secrecy codes , 2005, Journal of Cryptology.

[354]  Wei Wu,et al.  Gaussian interference networks with feedback: Duality, sum capacity and dynamic team problems , 2005 .

[355]  A. Nori.  Unifying Views Of Tail-Biting Trellises For Linear Block Codes , 2005 .

[356]  Andrea Ridolfi.  Power spectra of random spikes and related complex signals , 2005 .

[357]  Mahesh K. Varanasi,et al.  An information-theoretic framework for deriving canonical decision-feedback receivers in Gaussian channels , 2005, IEEE Transactions on Information Theory.

[358]  Marc P. C. Fossorier,et al.  Sphere-packing bounds revisited for moderate block lengths , 2004, IEEE Transactions on Information Theory.

[359]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

[360]  Halim Yanikomeroglu,et al.  Multihop diversity in wireless relaying channels , 2004, IEEE Transactions on Communications.

[361]  Daniele Micciancio,et al.  Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[362]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.

[363]  Nicola Elia,et al.  When bode meets shannon: control-oriented feedback communication schemes , 2004, IEEE Transactions on Automatic Control.

[364]  Rüdiger L. Urbanke,et al.  Capacity-achieving ensembles for the binary erasure channel with bounded complexity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[365]  G. David Forney,et al.  Shannon meets Wiener II: On MMSE estimation in successive decoding schemes , 2004, ArXiv.

[366]  Camilla Hollanti,et al.  Four antenna space-time lattice constellations from division algebras , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[367]  Neri Merhav,et al.  On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[368]  Amin Shokrollahi,et al.  Probabilistic decoding of interleaved RS-codes on the q-ary symmetric channel , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[369]  Neri Merhav,et al.  On successive refinement for the Wyner-Ziv problem , 2004, IEEE Transactions on Information Theory.

[370]  Narendra Ahuja,et al.  Wyner-Ziv coding of video: an error-resilient compression framework , 2004, IEEE Transactions on Multimedia.

[371]  Kaoru Kurosawa,et al.  New combinatorial designs and their applications to authentication codes and secret sharing schemes , 2004, Discret. Math..

[372]  H.-A. Loeliger,et al.  An introduction to factor graphs , 2004, IEEE Signal Process. Mag..

[373]  Giuseppe Caire,et al.  Design methods for irregular repeat-accumulate codes , 2003, IEEE Transactions on Information Theory.

[374]  Kenneth Rose,et al.  Rate-distortion approach to databases: storage and content-based retrieval , 2002, IEEE Transactions on Information Theory.

[375]  Gustavus J. Simmons,et al.  A cartesian product construction for unconditionally secure authentication codes that permit arbitration , 1990, Journal of Cryptology.

[376]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .

[377]  Marijke De Soete,et al.  New bounds and constructions for authentication/secrecy codes with splitting , 2004, Journal of Cryptology.

[378]  Victor Yu. Krachkovsky.  Reed-Solomon codes for correcting phased error bursts , 2003, IEEE Trans. Inf. Theory.

[379]  Stephan ten Brink,et al.  Design of repeat-accumulate codes for iterative detection and decoding , 2003, IEEE Trans. Signal Process..

[380]  James A. Hutchby,et al.  Limits to binary logic switch scaling - a gedanken model , 2003, Proc. IEEE.

[381]  Aris L. Moustakas,et al.  MIMO capacity through correlated channels in the presence of correlated interferers and noise: a (not so) large N analysis , 2003, IEEE Trans. Inf. Theory.

[382]  Hyundong Shin,et al.  Capacity of multiple-antenna fading channels: spatial fading correlation, double scattering, and keyhole , 2003, IEEE Trans. Inf. Theory.

[383]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

[384]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[385]  J. Møller,et al.  Statistical Inference and Simulation for Spatial Point Processes , 2003 .

[386]  Ton Kalker,et al.  On the capacity of a biometrical identification system , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[387]  Alexander Vardy,et al.  Efficient interpolation and factorization in algebraic soft-decision decoding of reed-solonion codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[388]  Cindy C. Parman,et al.  To code, or not to code? , 2003, The Journal of oncology management : the official journal of the American College of Oncology Administrators.

[389]  David Tse,et al.  Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality , 2003, IEEE Trans. Inf. Theory.

[390]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[391]  Constantinos B. Papadias,et al.  Analysis and performance of some basic space-time architectures , 2003, IEEE J. Sel. Areas Commun..

[392]  Sampo Niskanen,et al.  Cliquer user's guide, version 1.0 , 2003 .

[393]  Nadav Shulman,et al.  Communication over an unknown channel via common broadcasting , 2003 .

[394]  Jon Feldman,et al.  Decoding error-correcting codes via linear programming , 2003 .

[395]  P. Vontobel,et al.  Graph-covers and iterative decoding of nite length codes , 2003 .

[396]  Helmut Bölcskei,et al.  Outdoor MIMO wireless channels: models and performance prediction , 2002, IEEE Trans. Commun..

[397]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[398]  Thomas Zwick,et al.  A stochastic multipath channel model including path directions for indoor environments , 2002, IEEE J. Sel. Areas Commun..

[399]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[400]  Sekhar Tatikonda,et al.  Loopy Belief Propogation and Gibbs Measures , 2002, UAI.

[401]  Gerhard Kramer,et al.  Feedback strategies for white Gaussian interference networks , 2002, IEEE Trans. Inf. Theory.

[402]  Neri Merhav,et al.  Universal composite hypothesis testing: A competitive minimax approach , 2002, IEEE Trans. Inf. Theory.

[403]  Reinaldo A. Valenzuela,et al.  Keyholes, correlations, and capacities of multielement transmit and receive antennas , 2002, IEEE Trans. Wirel. Commun..

[404]  R. Koetter,et al.  The structure of tail-biting trellises: minimality and basic principles , 2002, Proceedings IEEE International Symposium on Information Theory,.

[405]  Natalia A. Schmid,et al.  Large deviations performance analysis for biomet-rics recognition , 2002 .

[406]  Alexander Vardy,et al.  On the Theory of Linear Trellises , 2002 .

[407]  Ralf R. Müller,et al.  A random matrix model of communication via antenna arrays , 2002, IEEE Trans. Inf. Theory.

[408]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.

[409]  R. Muller,et al.  Confirmation of random matrix model for the antenna array channel by indoor measurements , 2001, IEEE Antennas and Propagation Society International Symposium. 2001 Digest. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.01CH37229).

[410]  G. Wornell,et al.  The duality between information embedding and source coding with side information and some applications , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[411]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[412]  T. Honold,et al.  Characterization of finite Frobenius rings , 2001 .

[413]  Avideh Zakhor,et al.  Video multicast using layered FEC and scalable compression , 2001, IEEE Trans. Circuits Syst. Video Technol..

[414]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[415]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[416]  R. Koetter,et al.  On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles , 2001 .

[417]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[418]  A. Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[419]  Marcus Greferath,et al.  Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem , 2000, J. Comb. Theory A.

[420]  Jeffrey A. Davis,et al.  The fundamental limit on binary switching energy for terascale integration (TSI) , 2000, IEEE Journal of Solid-State Circuits.

[421]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[422]  Ueli Maurer,et al.  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.

[423]  Sae-Young Chung,et al.  Sphere-bound-achieving coset codes and multilevel coset codes , 2000, IEEE Trans. Inf. Theory.

[424]  Muriel Médard,et al.  The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel , 2000, IEEE Trans. Inf. Theory.

[425]  Michael A. Jensen,et al.  Modeling the statistical time and angle of arrival characteristics of an indoor multipath channel , 2000, IEEE Journal on Selected Areas in Communications.

[426]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[427]  Ingmar Land,et al.  Log-likelihood values and Monte Carlo simulation - some fundamental results , 2000 .

[428]  Marcus Greferath,et al.  Linear Codes and Rings of Matrices , 1999, AAECC.

[429]  Marcus Greferath,et al.  Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code , 1999, IEEE Trans. Inf. Theory.

[430]  Ueli Maurer,et al.  Information-Theoretic Cryptography , 1999, CRYPTO.

[431]  Alexander Barg,et al.  On the complexity of minimum distance decoding of long linear codes , 1999, IEEE Trans. Inf. Theory.

[432]  R. Schober,et al.  Decision-feedback differential detection of MDPSK for flat Rayleigh fading channels , 1999, 1999 IEEE Communications Theory Mini-Conference (Cat. No.99EX352).

[433]  Kaoru Kurosawa,et al.  On a Fallacious Bound for Authentication Codes , 1999, Journal of Cryptology.

[434]  Jay A. Wood.  Duality for modules over finite rings and applications to coding theory , 1999 .

[435]  Parampalli Udaya,et al.  Cyclic Codes and Self-Dual Codes Over F2 + uF2 , 1999, IEEE Trans. Inf. Theory.

[436]  K. Ramchandran,et al.  Distributed source coding using syndromes (DISCUS): design and construction , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[437]  G. Horn.  Iterative decoding and pseudo-codewords , 1999 .

[438]  Anna Scaglione,et al.  Filterbank transceivers optimizing information rate in block transmissions over dispersive channels , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[439]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[440]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[441]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[442]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[443]  Yuan Xing Lee,et al.  Decoding of parallel Reed-Solomon codes with applications to product and concatenated codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[444]  A. Vardy,et al.  Minimal tail-biting trellises: the Golay code and more , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[445]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[446]  Gerhard Kramer,et al.  Directed information for channels with feedback , 1998 .

[447]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[448]  Joachim Hagenauer,et al.  Approaching Shannon's capacity limit by 0.2 dB using simple Hamming codes , 1997, IEEE Communications Letters.

[449]  H. Viswanathan,et al.  Sequential coding of correlated sources , 1997, Proceedings of IEEE International Symposium on Information Theory.

[450]  M. Feder,et al.  Universal decoding for channels with memory , 1997, Proceedings of IEEE International Symposium on Information Theory.

[451]  Yuan Xing Lee,et al.  Decoding For Iterative Reed-solomon Coding Schemes , 1997, 1997 IEEE International Magnetics Conference (INTERMAG'97).

[452]  Christine Bachoc,et al.  Applications of Coding Theory to the Construction of Modular Lattices , 1997, J. Comb. Theory A.

[453]  A. Rhodius.  On the maximum of ergodicity coefficients, the Dobrushin ergodicity coefficient, and products of stochastic matrices , 1997 .

[454]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[455]  Shlomo Shamai,et al.  Information-theoretic considerations for symmetric, cellular, multiple-access fading channels - Part I , 1997, IEEE Trans. Inf. Theory.

[456]  Felix Lazebnik,et al.  On Systems of Linear Diophantine Equations , 1996 .

[457]  Shlomo Shamai,et al.  The intersymbol interference channel: lower bounds on capacity and channel precoding loss , 1996, IEEE Trans. Inf. Theory.

[458]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[459]  Rüdiger L. Urbanke,et al.  A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[460]  Gregory J. Pottie,et al.  On punctured trellis-coded modulation , 1996, IEEE Trans. Inf. Theory.

[461]  John M. Cioffi,et al.  Block transmission over dispersive channels: transmit filter optimization and realization, and MMSE-DFE receiver performance , 1996, IEEE Trans. Inf. Theory.

[462]  Bernard Henri Fleury,et al.  Advanced Radio Channel Model for Magic WAND , 1996 .

[463]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[464]  R. Schweikert,et al.  Performance of punctured pragmatic codes , 1995, Proceedings of GLOBECOM '95.

[465]  John M. Cioffi,et al.  MMSE decision-feedback equalizers and coding. I. Equalization results , 1995, IEEE Trans. Commun..

[466]  Yu-Sun Liu,et al.  A new universal random coding bound for the multiple-access channel , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[467]  A. Lapidoth.  On the role of mismatch in rate distortion theory , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[468]  Y. Oohama.  Gaussian multiterminal source coding , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[469]  Georgios B. Giannakis,et al.  Principal component filter banks for optimal multiresolution analysis , 1995, IEEE Trans. Signal Process..

[470]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[471]  B. E. Spinnler,et al.  Design of hyper states for reduced-state sequence estimation , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[472]  Satoshi Obana,et al.  Combinatorial Bounds on Authentication Codes with Arbitration , 1995, Des. Codes Cryptogr..

[473]  Ulrich K. Sorger,et al.  Bounded minimum distance decoding of unit memory codes , 1995, IEEE Trans. Inf. Theory.

[474]  Tal Rabin,et al.  Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.

[475]  Rudolf Ahlswede,et al.  Identification via compressed data , 1994, Proceedings of 1994 Workshop on Information Theory and Statistics.

[476]  M. Talagrand.  On Russo's Approximate Zero-One Law , 1994 .

[477]  Hans-Andrea Loeliger.  A posteriori probabilities and performance evaluation of trellis codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[478]  F. Alajaji,et al.  Effect of feedback on the capacity of discrete additive channels with memory , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[479]  N. J. A. Sloane,et al.  The Z4-linearity of Kerdock, Preparata, Goethals, and related codes , 1994, IEEE Trans. Inf. Theory.

[480]  Gregory Poltyrev,et al.  On coding without restrictions for the AWGN channel , 1993, IEEE Trans. Inf. Theory.

[481]  Uwe Dettmar.  Partial unit memory codes , 1994 .

[482]  U. Maurer.  The Strong Secret Key Rate of Discrete Random Triples , 1994 .

[483]  Michael Unser,et al.  On the optimality of ideal filters for pyramid and wavelet signal approximation , 1993, IEEE Trans. Signal Process..

[484]  W. Banaszczyk.  New bounds in some transference theorems in the geometry of numbers , 1993 .

[485]  Fumiyuki Adachi,et al.  Decision feedback multiple-symbol differential detection for M-ary DPSK , 1993 .

[486]  H. Hashemi,et al.  The indoor radio propagation channel , 1993, Proc. IEEE.

[487]  N. Merhav.  Universal Decoding for Memoryless Gaussian Channels with a Deterministic Interference , 1993, Proceedings. IEEE International Symposium on Information Theory.

[488]  Graham Everest,et al.  Counting Algebraic Units with Bounded Height , 1993 .

[489]  Frank R. Kschischang,et al.  Optimal nonuniform signaling for Gaussian channels , 1993, IEEE Trans. Inf. Theory.

[490]  T. Han,et al.  Approximation Theory of Output Statistics , 1993, Proceedings. IEEE International Symposium on Information Theory.

[491]  Sergio Verdú,et al.  Gaussian multiaccess channels with ISI: Capacity region and multiuser water-filling , 1993, IEEE Trans. Inf. Theory.

[492]  Hisato Iwai,et al.  Wideband Propagation Model for the Analysis of the Effect of the Multipath Fading on the Near-Far Problem in CDMA Mobile Radio Systems (Special Issue on Land Mobile/Portable Propagation) , 1993 .

[493]  G. Kaplan,et al.  On Information Rates for Mismatched Decoders , 1993, Proceedings. IEEE International Symposium on Information Theory.

[494]  N. Sloane,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I , 1993 .

[495]  Aaron D. Wyner,et al.  Coding Theorems for a Discrete Source With a Fidelity CriterionInstitute of Radio Engineers, International Convention Record, vol. 7, 1959. , 1993 .

[496]  Ephraim Zehavi,et al.  8-PSK trellis codes for a Rayleigh channel , 1992, IEEE Trans. Commun..

[497]  Franz Edbauer.  Bit error rate of binary and quaternary DPSK signals with multiple differential feedback detection , 1992, IEEE Trans. Commun..

[498]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[499]  Jianhua Lin,et al.  Divergence measures based on the Shannon entropy , 1991, IEEE Trans. Inf. Theory.

[500]  Moti Yung,et al.  Perfectly secure message transmission , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[501]  Dariush Divsalar,et al.  Multiple-symbol differential detection of MPSK , 1990, IEEE Trans. Commun..

[502]  Spyros J. Papantoniou.  Modelling the mobile-radio channel , 1990 .

[503]  J. Massey.  CAUSALITY, FEEDBACK AND DIRECTED INFORMATION , 1990 .

[504]  R. Gray.  Entropy and Information Theory , 1990, Springer New York.

[505]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[506]  Alexandra Duel-Hallen,et al.  Delayed decision-feedback sequence estimation , 1989, IEEE Trans. Commun..

[507]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[508]  Nathan Linial,et al.  The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[509]  Gustavus J. Simmons,et al.  A survey of information authentication , 1988, Proc. IEEE.

[510]  Béla Bollobás,et al.  The Isoperimetric Number of Random Regular Graphs , 1988, Eur. J. Comb..

[511]  Shahid U. H. Qureshi,et al.  Reduced-state sequence estimation with set partitioning and decision feedback , 1988, IEEE Trans. Commun..

[512]  G. Ungerboeck,et al.  Trellis-coded modulation with redundant signal sets Part I: Introduction , 1987, IEEE Communications Magazine.

[513]  J. L. Massey,et al.  Cryptography ― a selective survey , 1986 .

[514]  Hans-Martin Wallmeier,et al.  Random coding bound and codes produced by permutations for the multiple-access channel , 1985, IEEE Trans. Inf. Theory.

[515]  Toby Berger,et al.  Rate distortion when side information may be absent , 1985, IEEE Trans. Inf. Theory.

[516]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[517]  Jacob Ziv,et al.  Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.

[518]  G. J. Foschini,et al.  Contrasting performance of faster binary signaling with QAM , 1984, AT&T Bell Laboratories Technical Journal.

[519]  Peter Ney,et al.  Convexity and Large Deviations , 1984 .

[520]  Lawrence H. Ozarow,et al.  The capacity of the white Gaussian multiple access channel with feedback , 1984, IEEE Trans. Inf. Theory.

[521]  Lawrence H. Ozarow,et al.  An achievable region and outer bound for the Gaussian broadcast channel with feedback , 1984, IEEE Trans. Inf. Theory.

[522]  G. Gonzalez.  Microwave Transistor Amplifiers: Analysis and Design , 1984 .

[523]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[524]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[525]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[526]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[527]  Imre Csiszár.  Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[528]  C. R. Rao,et al.  On the convexity of some divergence measures based on entropy functions , 1982, IEEE Trans. Inf. Theory.

[529]  Imre Csiszár,et al.  Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.

[530]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[531]  Imre Csiszár,et al.  Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.

[532]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[533]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[534]  János Körner,et al.  How to encode the modulo-two sum of binary sources (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[535]  J. Wolfowitz.  The rate distortion function for source coding with side information at the decoder , 1979 .

[536]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[537]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[538]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[539]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[540]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

[541]  J. Galdos,et al.  Information and distortion in reduced-order filter design , 1977, IEEE Trans. Inf. Theory.

[542]  P. Gács,et al.  Spreading of Sets in Product Spaces and Hypercontraction of the Markov Operator , 1976 .

[543]  Lin-nan Lee,et al.  Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[544]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[545]  Aaron D. Wyner,et al.  On source coding with side information at the decoder , 1975, IEEE Trans. Inf. Theory.

[546]  Aaron D. Wyner,et al.  The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.

[547]  W. C. Jakes,et al.  Microwave Mobile Communications , 1974 .

[548]  Robert M. Gray,et al.  Source coding for a simple network , 1974 .

[549]  H. Marko,et al.  The Bidirectional Communication Theory - A Generalization of Information Theory , 1973, IEEE Transactions on Communications.

[550]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[551]  D. Connor.  Techniques for Reducing the Visibility of Transmission Errors in Digitally Encoded Video Signals , 1973, IEEE Trans. Commun..

[552]  Robert G. Gallager,et al.  The random coding bound is tight for the average code (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[553]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[554]  George L. Turin,et al.  A statistical model of urban multipath propagation , 1972 .

[555]  Suguru Arimoto,et al.  An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.

[556]  Jacob Ziv,et al.  Mutual information of the white Gaussian channel with and without feedback , 1971, IEEE Trans. Inf. Theory.

[557]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[558]  T. Duncan.  ON THE CALCULATION OF MUTUAL INFORMATION , 1970 .

[559]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[560]  C. Rader.  Discrete Fourier transforms when the number of data samples is prime , 1968 .

[561]  H. Witsenhausen.  A Counterexample in Stochastic Optimum Control , 1968 .

[562]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[563]  Nelson M. Blachman,et al.  The convolution inequality for entropy powers , 1965, IEEE Trans. Inf. Theory.

[564]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[565]  Amiel Feinstein,et al.  Information and information stability of random variables and processes , 1964 .

[566]  Michael Horstein,et al.  Sequential transmission using noiseless feedback , 1963, IEEE Trans. Inf. Theory.

[567]  J. Wolfowitz.  Products of indecomposable, aperiodic, stochastic matrices , 1963 .

[568]  L. Goddard.  Information Theory , 1962, Nature.

[569]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[570]  R. R. Bahadur,et al.  On Deviations of the Sample Mean , 1960 .

[571]  Satosi Watanabe,et al.  Loss and Recovery of Information by Coarse Observation of Stochastic Chain , 1960, Inf. Control..

[572]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

[573]  A. Rényi.  On the dimension and entropy of probability distributions , 1959 .

[574]  M. Bartlett,et al.  Weak ergodicity in non-homogeneous Markov chains , 1958, Mathematical Proceedings of the Cambridge Philosophical Society.

[575]  K Fan,et al.  Minimax Theorems. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[576]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[577]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[578]  H. Jeffreys.  An invariant form for the prior probability in estimation problems , 1946, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[579]  É. Lucas.  Theorie des Fonctions Numeriques Simplement Periodiques , 1878 .

[580]  T. Han,et al.  A Dichotomy of Functions F ( X , Y ) o f Corre lated Sources ( X , Y ) from the Viewpoint o f the Achievable Rate Region , .

[581]  S. Artstein,et al.  Entropy Methods , .

[582]  R. McEliece.  On the Average List Size for the Guruswami-sudan Decoder * , 2022 .