The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
IEEE Transactions on Information Theory（英语：IEEE Transactions on Information Theory）是一份发表有关信息传输、处理和利用的理论和实验论文的期刊。可接受的主题的边界有意地不被明确地界定。相反，我们希望随着研究活动的重点发生变化，灵活的政策将允许本交易遵循这种变化。最新的目录最能反映当前的适当主题;在封面内页的编辑区标题中对它们进行了总结。
The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2869154
Vector Approximate Message Passing
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2916359
The Capacity of Symmetric Private Information Retrieval
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2848977
Comparison of Quantum Channels by Superchannels
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2907989
The Capacity of Private Information Retrieval With Partially Known Private Side Information
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2936023
Coded Computation Over Heterogeneous Clusters
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2904055
Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2873136
Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2901492
Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2902924
A Theoretical Analysis of Noisy Sparse Subspace Clustering on Dimensionality-Reduced Data
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2879912
Near Optimal Coded Data Shuffling for Distributed Learning
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2926704
Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2924888
Quickest Change Detection Under Transient Dynamics: Theory and Asymptotic Analysis
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2877972
Quantum Version of Wielandt’s Inequality Revisited
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2897772
Calculating the Hilbert Transform on Spaces With Energy Concentration: Convergence and Divergence Regions
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2859328
Verifiably Multiplicative Secret Sharing
来源期刊：IEEE Transactions on Information TheoryDOI：10.1007/978-3-319-72089-0_5
A Key Recovery Reaction Attack on QC-MDPC
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2877458
Generalized Compression Strategy for the Downlink Cloud Radio Access Network
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2930568
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2897129
Some Nonprimitive BCH Codes and Related Quantum Codes
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2932670
AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2875004
Quantum Versus Classical Simultaneity in Communication Complexity
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2918453
Asymptotic Optimality of Mixture Rules for Detecting Changes in General Stochastic Models
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2876863
A Characterization of All Single-Integral, Non-Kernel Divergence Estimators
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2937527
Simulation of Random Variables Under Rényi Divergence Measures of All Orders
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2891363
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2915242
Multilevel Constructions: Coding, Packing and Geometric Uniformity
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2933219
Optimal Uniform Secret Sharing
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2852276
Reed–Solomon Codes Over Small Fields With Constrained Generator Matrices
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2897767
Confidence Region of Singular Subspaces for Low-Rank Matrix Regression
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2924900
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2879823
Capacity-Approaching Non-Binary Balanced Codes Using Auxiliary Data
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2844834
Optimum Linear Codes With Support-Constrained Generator Matrices Over Small Fields
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2932663
Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2849971
Codes With Locality in the Rank and Subspace Metrics
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2915539
Common Reconstructions in the Successive Refinement Problem With Receiver Side Information
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2918781
Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2924187
Game of Duels: Information-Theoretic Axiomatization of Scoring Rules
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2867469
Column Distances of Convolutional Codes Over ${\\mathbb Z}_{p^r}$
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2870436
On $b$ -Symbol Distances of Repeated-Root Constacyclic Codes
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2937858
The Decoding Error Probability of Linear Codes Over the Erasure Channel
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2926075
Blind Group Testing
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2906607
COMPREHENSIVE PERFORMANCE CRITERION FOR HYPER-CONVERGED INFRASTRUCTURE
来源期刊：IEEE Transactions on Information TheoryDOI：10.31673/2412-4338.2019.035562
Converse Results for the Downlink Multicell Processing With Finite Backhaul Capacity
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2869881
Urban Planning Aspects of Ecological and Urban Planning Regulation Fundamentals for Main Street and Road Network Functioning and Forward Development
来源期刊：IEEE Transactions on Information TheoryDOI：10.31493/uwt1921.0202
Subcovers and Codes on a Class of Trace-Defining Curves
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2018.2868822
PERFORMANCE EVALUATION OF COMPUTER CAMPUS NETWORK SEGMENTS
来源期刊：IEEE Transactions on Information TheoryDOI：10.31673/2412-4338.2019.041119
Recovery and Convergence Rate of the Frank–Wolfe Algorithm for the m-Exact-Sparse Problem
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2919640
Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2898663
The Poisson Channel With Varying Dark Current Known to the Transmitter
来源期刊：IEEE Transactions on Information TheoryDOI：10.1109/TIT.2019.2911474
