###### Volume 65, Number 12, December 2019
The Error Linear Complexity Spectrum as a Cryptographic Criterion of Boolean Functions. On Random Read Access in OCB. A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues. Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within ½ Bit. Delay in Cooperative Communications: Achieving Higher Multiplexing Gain in Gaussian Interference Channels With Full-Duplex Transmitters. Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval. The Capacity of Private Information Retrieval With Partially Known Private Side Information. Optimum Overflow Thresholds in Variable-Length Source Coding Allowing Non-Vanishing Error Probability. The Meet Operation in the Imbalance Lattice of Maximal Instantaneous Codes: Alternative Proof of Existence. Overflow Probability of Variable-Length Codes With Codeword Cost. The Entropy Rate of Some Pólya String Models. Error Exponents of Typical Random Codes for the Colored Gaussian Channel. Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels. Asymptotic Majorization of Finite Probability Distributions. Discrete Sampling: A Graph Theoretic Approach to Orthogonal Interpolation. On the Minimax Misclassification Ratio of Hypergraph Community Detection. Recovery of Binary Sparse Signals With Biased Measurement Matrices. Sharp Bounds for Mutual Covering. Tunable Measures for Information Leakage and Applications to Privacy-Utility Tradeoffs. Privacy With Estimation Guarantees. Snapshot Compressed Sensing: Performance Bounds and Algorithms. A Correlation Measure Based on Vector-Valued Lp-Norms. A Characterization of All Single-Integral, Non-Kernel Divergence Estimators. Analyticity of Entropy Rates of Continuous-State Hidden Markov Models. Tone Reservation for OFDM With Restricted Carrier Set. Statistical Mechanics of MAP Estimation: General Replica Ansatz. On Two-to-One Mappings Over Finite Fields. Constructions of Involutions Over Finite Fields. Optimum Linear Codes With Support-Constrained Generator Matrices Over Small Fields. On b-Symbol Distances of Repeated-Root Constacyclic Codes. Some New Constructions of Quantum MDS Codes. Some Nonprimitive BCH Codes and Related Quantum Codes. Ulam Ball Size Analysis for Permutation and Multipermutation Codes Correcting Translocation Errors. Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes. Codes With Locality for Two Erasures. The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement. Coded Caching With Distributed Storage. Rosenthal's Decoding Algorithm for Certain 1-Dimensional Convolutional Codes. Rank-Metric Codes Over Finite Principal Ideal Rings and Applications. Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography. Unique Reconstruction of Coded Strings From Multiset Substring Spectra. Multilevel Constructions: Coding, Packing and Geometric Uniformity.

###### Volume 65, Number 11, November 2019
Secure Clustered Distributed Storage Against Eavesdropping. Asymmetry Hurts: Private Information Retrieval Under Asymmetric Traffic Constraints. Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost. Entropy Accumulation With Improved Second-Order Term. Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel. Quantum Reading Capacity: General Definition and Bounds. Generic Constructions of Five-Valued Spectra Boolean Functions. New Results About the Boomerang Uniformity of Permutation Polynomials. Bent Vectorial Functions, Codes and Designs. LP Bounds for Rate-Distortion With Variable Side Information. Lossless Analog Compression. The Informativeness of k-Means for Learning Mixture Models. Confidence Region of Singular Subspaces for Low-Rank Matrix Regression. Multichannel Sparse Blind Deconvolution on the Sphere. Recovery and Convergence Rate of the Frank-Wolfe Algorithm for the m-Exact-Sparse Problem. Anonymous Heterogeneous Distributed Detection: Optimal Decision Rules, Error Exponents, and the Price of Anonymity. Analysis of Approximate Message Passing With Non-Separable Denoisers and Markov Random Field Priors. Optimization of Smooth Functions With Noisy Observations: Local Minimax Rates. Near Optimal Coded Data Shuffling for Distributed Learning. A Framework for the Construction of Upper Bounds on the Number of Affine Linear Regions of ReLU Feed-Forward Neural Networks. The Wideband Slope of Interference Channels: The Small Bandwidth Case. Asymptotic Analysis of RZF in Large-Scale MU-MIMO Systems Over Rician Channels. K-User Interference Channels With Backhaul Cooperation: DoF vs. Backhaul Load Trade-Off. Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort. On the Optimality of Treating Inter-Cell Interference as Noise in Uplink Cellular Networks. Optimality of Simple Layered Superposition Coding in the 3 User MISO BC With Finite Precision CSIT. Central Limit Theorem for Mutual Information of Large MIMO Systems With Elliptically Correlated Channels. Mutual Information of Wireless Channels and Block-Jacobi Ergodic Operators. Performance Bounds of Concatenated Polar Coding Schemes. Generalized Partial Orders for Polar Code Bit-Channels. A New Design of Binary MDS Array Codes With Asymptotically Weak-Optimal Repair. Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields. On the Complete Weight Distribution of Subfield Subcodes of Algebraic-Geometric Codes. Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic. Variable- and Fixed-Length Balanced Runlength-Limited Codes Based on a Knuth-Like Balancing Method. Covert Communication Over a K-User Multiple-Access Channel. Benefits of Cache Assignment on Degraded Broadcast Channels. Guessing Attacks on Distributed-Storage Systems. Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. Ring Compute-and-Forward Over Block-Fading Channels. The Simultaneous Connectivity of Cognitive Networks. Low-Mean Hitting Time for Random Walks on Heterogeneous Networks. Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks. Community Recovery in a Preferential Attachment Graph. Testing Ising Models.

###### Volume 65, Number 10, October 2019
Correction to Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering. Differential Spectrum of Kasami Power Permutations Over Odd Characteristic Finite Fields. Network Simplification in Half-Duplex: Building on Submodularity. Degrees-of-Freedom of the MIMO Three-Way Channel With Node-Intermittency. Generalized Compression Strategy for the Downlink Cloud Radio Access Network. Wiretap Channels With Causal State Information: Strong Secrecy. Secure and Robust Identification via Classical-Quantum Channels. On Function Computation With Privacy and Secrecy Constraints. Estimating the Fundamental Limits is Easier Than Achieving the Fundamental Limits. Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities. Vector Approximate Message Passing. One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints. Online Codes for Analog Signals. On the Error in Phase Transition Computations for Compressed Sensing. Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes. Community Recovery in Hypergraphs. High Dimensional Inference With Random Maximum A-Posteriori Perturbations. Detection Under One-Bit Messaging Over Adaptive Networks. On the Information Dimension of Stochastic Processes. Information Topological Characterization of Periodically Correlated Processes by Dilation Operators. Quantum Versus Classical Simultaneity in Communication Complexity. Non-Asymptotic Entanglement Distillation. One-Shot Coherence Distillation: Towards Completing the Picture. Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems. Universal Tree Source Coding Using Grammar-Based Compression. Successive Refinement of Abstract Sources. The Dispersion of the Gauss-Markov Source. Common Reconstructions in the Successive Refinement Problem With Receiver Side Information. Cooperative Binning for Semi-Deterministic Channels With Non-Causal State Information. Capacity of Two-Way Channels With Symmetry Properties. Quasi Structured Codes for Multi-Terminal Communications. Exact Exponent for Soft Covering. Crossed Products and Coding Theory. Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations. The Decoding Error Probability of Linear Codes Over the Erasure Channel. "Short-Dot": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products. Probabilistic Existence Results for Parent-Identifying Schemes. Context-Aware Resiliency: Unequal Message Protection for Random-Access Memories. PIR Array Codes With Optimal Virtual Server Rate. On the Sub-Optimality of Single-Letter Coding Over Networks. Wireless MapReduce Distributed Computing. Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. Multi-Rack Distributed Data Storage Networks. Codes With Hierarchical Locality From Covering Maps of Curves. On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels. Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound. Random Matrices From Linear Codes and Wigner's Semicircle Law. Optimal Interactive Coding for Insertions, Deletions, and Substitutions.

###### Volume 65, Number 9, September 2019
New Lower Bounds to the Output Entropy of Multi-Mode Quantum Gaussian Channels. Distillation of Greenberger-Horne-Zeilinger States by Combinatorial Methods. Optimal Universal Learning Machines for Quantum State Discrimination. Algorithmic No-Cloning Theorem. Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction. Comparison of Quantum Channels by Superchannels. Designing Plateaued Boolean Functions in Spectral Domain and Their Classification. High-Meets-Low: Construction of Strictly Almost Optimal Resilient Boolean Functions via Fragmentary Walsh Spectra. New Extension Constructions of Optimal Frequency-Hopping Sequence Sets. On the Derivative Imbalance and Ambiguity of Functions. Degrees of Freedom in Wireless Interference Networks With Cooperative Transmission and Backhaul Load Constraints. Generalized Degrees of Freedom of the Symmetric Cache-Aided MISO Broadcast Channel With Partial CSIT. Cross Subspace Alignment and the Asymptotic Capacity of $X$ -Secure $T$ -Private Information Retrieval. Secrecy Capacity of Colored Gaussian Noise Channels With Feedback. Second Order Analysis for Joint Source-Channel Coding With General Channel and Markovian Source. Real-Time Status Updates for Markov Source. Sufficiently Myopic Adversaries Are Blind. The Error Probability of Generalized Perfect Codes via the Meta-Converse. An Information-Theoretic Analysis of Deduplication. Information Theory With Finite Vector Spaces. Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding. Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets. Universal Sparse Superposition Codes With Spatial Coupling and GAMP Decoding. Code Design Based on Connecting Spatially Coupled Graph Chains. On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing. Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate. New Constructions of MDS Euclidean Self-Dual Codes From GRS Codes and Extended GRS Codes. On Private Information Retrieval Array Codes. Linear Programming Approximations for Index Coding. Error-Correcting WOM Codes: Concatenation and Joint Design. Efficiently Decodable Non-Adaptive Threshold Group Testing. On the Second Relative Greedy Weight of 4-Dimensional Codes. On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes. Determinant Codes With Helper-Independent Repair for Single and Multiple Failures. Codes With Locality in the Rank and Subspace Metrics. Codes for Graph Erasures. Provable Subspace Clustering: When LRR Meets SSC. Geometric Distance Between Positive Definite Matrices of Different Dimensions. Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor. High-Dimensional Adaptive Minimax Sparse Estimation With Interactions. Harmonic Bayesian Prediction Under $\alpha$ -Divergence. On the Convergence of Approximate Message Passing With Arbitrary Matrices. Distributed Estimation of Gaussian Correlations. Data Discovery and Anomaly Detection Using Atypicality: Theory. Moments of the Scores. Non-Uniform Bounds in the Poisson Approximation With Applications to Informational Distances I.

###### Volume 65, Number 8, August 2019
Corrections to "Achieving AWGN Channel Capacity With Lattice Gaussian Coding". Understanding the Related-Key Security of Feistel Ciphers From a Provable Perspective. On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving. Quantum Version of Wielandt's Inequality Revisited. Sequence Pairs With Asymptotically Optimal Aperiodic Correlation. Minimizing the Age of Information Through Queues. Fundamental Limits of Cloud and Cache-Aided Interference Management With Multi-Antenna Edge Nodes. Tradeoffs Between Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation. On the Degrees-of-Freedom of Two-Unicast Wireless Networks With Delayed CSIT. Symmetric Private Information Retrieval from MDS Coded Distributed Storage With Non-Colluding and Colluding Servers. Secret-Key Generation in Many-to-One Networks: An Integrated Game-Theoretic and Information-Theoretic Approach. Generalizing Multiple Access Wiretap and Wiretap II Channel Models: Achievable Rates and Cost of Strong Secrecy. Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels. Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. Reconstructing Gaussian Sources by Spatial Sampling. Blind Group Testing. Semi-Robust Communications Over a Broadcast Channel. The Reliability Function of Variable-Length Lossy Joint Source-Channel Coding With Feedback. The Stochastic-Calculus Approach to Multi-Receiver Poisson Channels. False-Accept/False-Reject Trade-Offs for Ensembles of Biometric Authentication Systems. Wiretap and Gelfand-Pinsker Channels Analogy and Its Applications. The Poisson Channel With Varying Dark Current Known to the Transmitter. On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection. SOFAR: Large-Scale Association Network Learning. Lattice Functions for the Analysis of Analog-to-Digital Conversion. Detecting Random Walks on Graphs With Heterogeneous Sensors. Adaptive Nonparametric Clustering. Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons. A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC. New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions. List Decodability of Symbol-Pair Codes. Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis. Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes. T-Count Optimization and Reed-Muller Codes. Reed-Solomon Codes Over Small Fields With Constrained Generator Matrices. Theoretical Bounds and Constructions of Codes in the Generalized Cayley Metric. Rack-Aware Regenerating Codes for Data Centers. The Subfield Codes of Ovoid Codes. A Class of Narrow-Sense BCH Codes. Latency Analysis for Distributed Coded Storage Systems. The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle. Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code. Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes. Generalized Subspace Subcodes With Application in Cryptology.

###### Volume 65, Number 7, July 2019
Corrections to "Fine Asymptotics for Universal One-to-One Compression of Parametric Sources". On the Uniqueness Result of Theorem 6 in "Relative Entropy and the Multivariable Multidimensional Moment Problem". Improved Bounds on the Threshold Gap in Ramp Secret Sharing. On Converse Bounds for Classical Communication Over Quantum Channels. Constructions of Quasi-Complementary Sequence Sets Associated With Characters. On the Capacity of Cloud Radio Access Networks With Oblivious Relaying. Coupling Data Transmission for Multiple-Access Communications. BER-Improved Quantization of Source-to-Relay Link SNR for Cooperative Beamforming: A Fixed Point Theory Approach. State-Dependent Interference Channel With Correlated States. Gaussian Intersymbol Interference Channels With Mismatch. Remote Source Coding Under Gaussian Noise: Dueling Roles of Power and Entropy Power. Compression of Data Streams Down to Their Information Content. B-Spline-Based Exact Discretization of Continuous-Domain Inverse Problems With Generalized TV Regularization. Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements. Hypothesis Testing Over the Two-Hop Relay Network. Sequential Hypothesis Test With Online Usage-Constrained Sensor Selection. An Exact Expression for the Gap in the Data Processing Inequality for f-Divergences. Moderate Deviation Asymptotics for Variable-Length Codes With Feedback. Belief Propagation, Bethe Approximation and Polynomials. Determining the Number of Samples Required to Estimate Entropy in Natural Sequences. Nonparametric Identification in the Dynamic Stochastic Block Model. Exact Upper and Lower Bounds on the Misclassification Probability. A General Construction of Ordered Orthogonal Arrays Using LFSRs. Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. LDPC Codes Over the q-ary Multi-Bit Channel. Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures. Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes. Coded Computation Over Heterogeneous Clusters. Linear Codes for Broadcasting With Noisy Side Information. Centralized Multi-Node Repair Regenerating Codes. Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach. New Bounds and Generalizations of Locally Recoverable Codes With Availability. Minimal Linear Codes in Odd Characteristic. A Multi-Layer Encoding and Decoding Strategy for Binary Erasure Channel. Grassmannian Codes With New Distance Measures for Network Coding. Constructions for Optimal Ferrers Diagram Rank-Metric Codes. Feedback Capacity and Coding for the (0, k)-RLL Input-Constrained BEC. A Note on Reverse Pinsker Inequalities. Wiretap Channels: Nonasymptotic Fundamental Limits. Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel. Minimal Characterization of Shannon-Type Inequalities Under Functional Dependence and Full Conditional Independence Structures. Capacity-Achieving Guessing Random Additive Noise Decoding. Capacity Region of the Symmetric Injective K-User Deterministic Interference Channel. Expressions for the Entropy of Basic Discrete Distributions.

###### Volume 65, Number 6, June 2019
Perfect Anonymity. Superadditivity in Trade-Off Capacities of Quantum Channels. Quantum State Merging for Arbitrarily Small-Dimensional Systems. $k$ -Connectivity of Inhomogeneous Random Key Graphs With Unreliable Links. On the Capacity of the Peak Power Constrained Vector Gaussian Channel: An Estimation Theoretic Perspective. Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers. The Capacity of Private Computation. The Capacity of Anonymous Communications. Constellation-Optimal Beamformers for Multiuser MISO Broadcast Visible Light Communications. On $Z_p Z_{p^k}$ -Additive Codes and Their Duality. On Two Classes of Primitive BCH Codes and Some Related Codes. Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks. Improved Upper Bound on the Network Function Computing Capacity. On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths. On the Maximum Size of Block Codes Subject to a Distance Criterion. Separable Codes for the Symmetric Multiple-Access Channel. Stopping Redundancy Hierarchy Beyond the Minimum Distance. Radical-Locator Polynomials and Row-Echelon Partial Syndrome Matrices With Applications to Decoding Cyclic Codes. Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories. Constructions of Partial MDS Codes Over Small Fields. Mutually Uncorrelated Codes for DNA Storage. How Long Can Optimal Locally Repairable Codes Be? Noisy Adaptive Group Testing: Bounds and Algorithms. Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling. Optimization-Based AMP for Phase Retrieval: The Impact of Initialization and $\ell_{2}$ Regularization. On the Minimal Overcompleteness Allowing Universal Sparse Representation. Multireference Alignment Is Easier With an Aperiodic Translation Distribution. Estimation of Poisson Arrival Processes Under Linear Models. Empirical Lipschitz Constants for the Renyi Entropy Maximum Likelihood Estimator. Estimation in Tournaments and Graphs Under Monotonicity Constraints. Estimating the Coefficients of a Mixture of Two Linear Regressions by Expectation Maximization. Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization. Data Privacy for a $\rho$ -Recoverable Function. Generalized Random Gilbert-Varshamov Codes. Minimum-Entropy Couplings and Their Applications. Expurgated Bounds for the Asymmetric Broadcast Channel. The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels. Simulation of Random Variables Under Rényi Divergence Measures of All Orders. On a Fractional Version of Haemers' Bound. Strong Converses are Just Edge Removal Properties.

###### Volume 65, Number 5, May 2019
Three Families of Monomial Functions With Three-Valued Walsh Spectrum. The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding. On the Generalized Degrees of Freedom of the MIMO Interference Channel With Delayed CSIT. Multilevel LDPC Lattices With Efficient Encoding and Decoding and a Generalization of Construction $\text{D}'$. Verifiably Multiplicative Secret Sharing. Fundamental Limits of Cache-Aided Private Information Retrieval With Unknown and Uncoded Prefetching. The Capacity of Private Information Retrieval With Eavesdroppers. On PIR and Symmetric PIR From Colluding Databases With Adversaries and Eavesdroppers. Optimal Accuracy-Privacy Trade-Off for Secure Computations. RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy. Refined Asymptotics for Rate-Distortion Using Gaussian Codebooks for Arbitrary Sources. Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion. Blind Gain and Phase Calibration via Sparse Spectral Methods. Robust Estimators and Test Statistics for One-Shot Device Testing Under the Exponential Distribution. High-Dimensional Classification by Sparse Logistic Regression. Asymptotically Optimal Prediction for Time-Varying Data Generating Processes. Optimal Stopping for Interval Estimation in Bernoulli Trials. Data-Dependent Generalization Bounds for Multi-Class Classification. Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements. Network Estimation From Point Process Data. MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction. Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources. Quantum Query Complexity of Entropy Estimation. Quantum Sphere-Packing Bounds With Polynomial Prefactors. A Characterization of Guesswork on Swiftly Tilting Curves. Second-Order Asymptotics for Communication Under Strong Asynchronism. Multiplexing Zero-Error and Rare-Error Communications Over a Noisy Channel. Error Exponents for Dimension-Matched Vector Multiple Access Channels With Additive Noise. Physical-Layer Schemes for Wireless Coded Caching. Construction of Polar Codes With Sublinear Complexity. On Capacities of the Two-User Union Channel With Complete Feedback. Nearly Optimal Sparse Group Testing. Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes. The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers. An Innovations Approach to Viterbi Decoding of Convolutional Codes. Two or Few-Weight Trace Codes over ${\mathbb{F}_{q}}+u{\mathbb{F}_{q}}$. The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size. Repairing Multiple Failures for Scalar MDS Codes. Locality and Availability of Array Codes Constructed From Subspaces.