We found 217 result.
Thomas M. Cover Dissertation Award
The IEEE Information Theory Society Thomas M. Cover Dissertation Award is awarded annually to the author of an outstanding doctoral dissertation contributing to the mathematical foundations of any of the information sciences within the purview of…
Jack Keil Wolf ISIT Student Paper Award
The IEEE Jack Keil Wolf ISIT Student Paper Award is given to up to 3 outstanding papers for which a student is the principal author and presenter.
Communications Society & Information Theory Society Joint Paper Award
The Communications Society & Information Theory Society Joint Paper Award recognizes outstanding papers that lie at the intersection of communications and information theory.
Information Theory Society Paper Award
The Information Theory Society Paper Award is given annually for an outstanding publication in the fields of interest to the Society appearing anywhere during the preceding four calendar years.
Joy Thomas Tutorial Paper Award
The IEEE Joy Thomas Tutorial Paper Award is given to a paper of tutorial or survey nature that has appeared in an IEEE Information Theory Society publication.
Student and Outreach Subcommittee
Fellows Evaluation Committee
Alumni in Industry Ad Hoc Committee
Membership Committee
Aaron D. Wyner Distinguished Service Award Selection Committee
Nominations and Appointments Committee
Board of Governors
WITHITS Officers
Constitution and Bylaws Committee
Paper Awards Committee
Digital Presence Committee
Distinguished Lecturers List
Online Committee
Claude E. Shannon Award Selection Committee
Conference Committee
Publications Committee
BITS Information Theory Magazine Steering Committee
BITS Magazine Editorial Board
Thomas M. Cover Dissertation Award Committee
External Nominations Committee
Diversity and Inclusion Committee
James L. Massey Research and Teaching Award for Young Scholars Selection Committee
Schools Subcommittee
Newsletter Editorial Committee
Journal on Selected Areas in Information Theory (JSAIT) Steering Committee
Sharing Teaching Resources Ad Hoc Committee
Open Access Journal Ad Hoc Committee
Improved Low-Density Parity-Check Codes Using Irregular Graphs
Exponential error bounds for erasure, list, and decision feedback schemes
Source Coding Theorems without the Ergodic Assumption
Universal prediction of individual sequences
Matched spectral-null codes for partial-response channels
New directions in cryptography
On Digital Signatures and Public-Key Cryptosystems
Tree algorithms for packet broadcast channels
Free Synchronous Packet Access in a Broadcast Channel with Feedback
Compressed Sensing
A Random Linear Network Coding Approach to Multicast
Wireless Information-Theoretic Security
Network Coding for Distributed Storage Systems
A technique for deriving one-shot achievability results in network information theory
Polarization and Spatial Coupling: Two Techniques to Boost Performance
Multiterminal Source Coding under Logarithmic Loss
Variable-length coding with feedback in the non-asymptotic regime
The dispersion of infinite constellations
Pointwise relations between information and estimation in Gaussian noise
A Proof of the Ahlswede-Cai-Zhang Conjecture
Capacity Analysis of Asymptotically Large MIMO Channels
On Connections Between Graphs, Codes, Quantum States, and Boolean Functions
Re-proving Channel Polarization Theorems: An Extremality and Robustness Analysis
Aligned Image Sets Under Channel Uncertainty: Settling Conjectures on the Collapse of Degrees of Freedom Under Finite Precision CSIT
Polar Codes:Characterization of Exponent, Bounds, and Constructions
Symmetric Feedback Capacity of the Gaussian Interference Channel to within One Bit
New Bounds on the Maximal Error Exponent for Multiple-Access Channels
Age of Information in Random Access Channels
A Unified Framework for One-shot Achievability via the Poisson Matching Lemma
A Version of Delsarte’s Linear Program for Constrained Systems
Coded Computing: A Transformative Framework for Resilient, Secure, Private, and Communication Efficient Large Scale Distributed Computing
A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling
A New Method for Employing Feedback to Improve Coding Performance
Active Learning and CSI Acquisition for mmWave Initial Alignment
Shannon, Euler, and Mazes
A Coded Compressed Sensing Scheme for Unsourced Multiple Access
Byzantine Consensus Over Broadcast Channels
Linear Network Coding
Space-time Codes for High Data Rate Wireless Communications: Performance Criterion and Code Construction
The Z4-linearity of Kerdock, Preparata, Goethals, andrelated codes
Decoding algebraic-geometric codes up to the designed minimum distance
Channel Coding with Multilevel/Phase Signals
Recognition of membership in classes
The generation of impulse-equivalent pulse trains
Unified analysis of certain coherent and noncoherent binary communications systems
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Computation of channel capacity and rate-distortion functions
On the Shannon capacity of a graph
Interference Alignment and the Degrees of Freedom for the K User Interference Channel
Feedback capacity of stationary Gaussian channels
Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
Wireless Network Information Flow: A Deterministic Approach
Integrable communication channels and the nonlinear fourier transform
On the Locality of Codeword Symbols
New channel coding achievability bounds
On reconstructing a string from its substring compositions
Unitary isotropically distributed inputs are not capacity-achieving for large-MIMO fading channels
Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors
Completely Stale Transmitter Channel State Information is Still Very Useful
Fundamental Limits of Caching
A Generic Transformation for Optimal Repair Bandwidth and Rebuilding Access in MDS Codes
From Matched Filters to Martingales
List Decoding of Polar Codes
Optimal Lossless Source Codes for Timely Updates
Phase Retrieval via Wirtinger Flow: Theory and Algorithms
Paper dummy page
Universal Compression of Memoryless Sources Over Unknown Alphabets
Raptor Codes