default search action
IEEE Transactions on Information Theory, Volume 64
Volume 64, Number 1, January 2018
- Igal Sason
, Sergio Verdú
Arimoto-Rényi Conditional Entropy and Bayesian M-Ary Hypothesis Testing. 4-25 - Himanshu Tyagi
Interactive Communication for Data Exchange. 26-37 - Dor Shaviv
A Communication Channel With Random Battery Recharges. 38-56 - Chung Chan
Change of Multivariate Mutual Information: From Local to Global. 57-76 - Mokshay M. Madiman
Entropy Bounds on Abelian Groups and the Ruzsa Divergence. 77-92 - Varun S. Jog, Venkat Anantharam:
Intrinsic Entropies of Log-Concave Distributions. 93-108 - Songze Li
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing. 109-128 - Yanina Y. Shkel
A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss. 129-147 - Yonglong Li
Asymptotics of Input-Constrained Erasure Channel Capacity. 148-162 - Yuta Sakai
Extremality Between Symmetric Capacity and Gallager's Reliability Function E0 for Ternary-Input Discrete Memoryless Channels. 163-191 - Umberto Martínez-Peñas
Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties. 192-204 - Lei M. Zhang
Spatially Coupled Split-Component Codes With Iterative Algebraic Decoding. 205-224 - Renaud-Alexandre Pitaval
Density of Spherically Embedded Stiefel and Grassmann Codes. 225-248 - Kees A. Schouhamer Immink
Composition Check Codes. 249-256 - Bella Bose, Noha Elarief, Luca G. Tallini
On Codes Achieving Zero Error Capacities in Limited Magnitude Error Channels. 257-273 - Joseph Connelly
Linear Network Coding Over Rings - Part I: Scalar Codes and Commutative Alphabets. 274-291 - Joseph Connelly
Linear Network Coding Over Rings - Part II: Vector Codes and Non-Commutative Alphabets. 292-308 - Talha Cihad Gülcü
Construction of Polar Codes for Arbitrary Discrete Memoryless Channels. 309-321 - Shenghao Yang
Finite-Length Analysis of BATS Codes. 322-348 - Jinbei Zhang, Xiaojun Lin
Coded Caching Under Arbitrary Popularity Distributions. 349-366 - Yuwei Xu, Claude Carlet, Sihem Mesnager
Classification of Bent Monomials, Constructions of Bent Multinomials and Upper Bounds on the Nonlinearity of Vectorial Functions. 367-383 - Yang Yang
Generic Construction of Binary Sequences of Period 2N With Optimal Odd Correlation Magnitude Based on Quaternary Sequences of Odd Period N. 384-392 - Deng Tang
Construction of n-Variable (n ≡ 2 mod 4) Balanced Boolean Functions With Maximum Absolute Value in Autocorrelation Spectra < 2n/2. 393-402 - Alexander Pott, Enes Pasalic
On the Maximum Number of Bent Components of Vectorial Functions. 403-411 - Veit Elser
The Complexity of Bit Retrieval. 412-428 - Sameer Pawar
FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time. 429-450 - Sameer Pawar
R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT. 451-466 - Tamir Bendory
Non-Convex Phase Retrieval From STFT Measurements. 467-484 - Felix Krahmer
Phase Retrieval Without Small-Ball Probability Assumptions. 485-500 - Michael Kohler, Adam Krzyzak
Adaptive Estimation of Quantiles in a Simulation Model. 501-512 - Alex Dytso
On Communication Through a Gaussian Channel With an MMSE Disturbance Constraint. 513-530 - Kaniska Mohanty, Mahesh K. Varanasi
The Generalized Degrees of Freedom Region of the MIMO Z-Interference Channel With Delayed CSIT. 531-546 - Matha Deghel
Queueing Stability and CSI Probing of a TDD Wireless Network With Interference Alignment. 547-576 - Joseph M. Renes
Duality of Channels and Codes. 577-592 - Cambyse Rouze
Finite Blocklength and Moderate Deviation Analysis of Hypothesis Testing of Correlated Quantum States and Application to Classical-Quantum Channels With Memory. 593-612 - Kenji Nakahira
Realizing a 2-D Positive Operator-Valued Measure by Local Operations and Classical Communication. 613-621 - Ching-Yi Lai
Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators. 622-639 - Xin Wang
Semidefinite Programming Strong Converse Bounds for Classical Capacity. 640-653 - Mitsugu Iwamoto
Security Formalizations and Their Relationships for Encryption and Key Agreement in Information-Theoretic Cryptography. 654-685
Volume 64, Number 2, February 2018
- Richard Kueng
Robust Nonnegative Sparse Recovery and the Nullspace Property of 0/1 Measurements. 689-703 - Peter Jung
Blind Demixing and Deconvolution at Near-Optimal Rate. 704-727 - Lasha Ephremidze
On the Algorithmization of Janashia-Lagvilava Matrix Spectral Factorization Method. 728-737 - Zheng Wang
On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling. 738-751 - Salem Said
Gaussian Distributions on Riemannian Symmetric Spaces: Statistical Learning With Structured Covariance Matrices. 752-772 - Gang Wang
Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow. 773-794 - Diaa Al Mohamad
Semiparametric Two-Component Mixture Models When One Component Is Defined Through Linear Constraints. 795-830 - Nidhin Koshy Vaidhiyan
Learning to Detect an Oddball Target. 831-852 - K. Pavan Srinath
Cluster-Seeking James-Stein Estimators. 853-874 - Masahito Hayashi
Minimum Rates of Approximate Sufficient Statistics. 875-888 - Jian Liu, Sihem Mesnager
New Constructions of Optimal Locally Recoverable Codes via Good Polynomials. 889-899 - Lingfei Jin
Repairing Algebraic Geometry Codes. 900-908 - Yeow Meng Chee
Linear Size Constant-Composition Codes Meeting the Johnson Bound. 909-917 - Evyatar Hemo
A Constrained Coding Scheme for Correcting Asymmetric Magnitude-1 Errors in q-Ary Channels. 918-932 - Rawad Bitar
Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads. 933-943 - Ron M. Roth
On Decoding Rank-Metric Codes Over Large Fields. 944-951 - Chong-Dao Lee
Algebraic Decoding of Cyclic Codes Using Partial Syndrome Matrices. 952-971 - Michael Dowling
Fast Decoding of Expander Codes. 972-978 - Linqi Song
A Polynomial-Time Algorithm for Pliable Index Coding. 979-999 - Hua Sun
Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al. 1000-1022 - Xiugang Wu
Cut-Set Bound is Loose for Gaussian Relay Networks. 1023-1037 - Siddharth Barman, Omar Fawzi
Algorithmic Aspects of Optimal Channel Coding. 1038-1045 - Anatoly Khina
The MIMO Wiretap Channel Decomposed. 1046-1063 - Marco Tomamichel
Operational Interpretation of Rényi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions. 1064-1082 - Benjamin Arras
IT Formulae for Gamma Target: Mutual Information and Relative Entropy. 1083-1091 - Mireille El Gheche
Proximity Operators of Discrete Information Divergences. 1092-1104 - Hye Won Chung
Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem. 1105-1131 - Badri N. Vellambi
Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks. 1132-1162 - Ahmad ElMoslimany
On the Discreteness of Capacity-Achieving Distributions for Fading and Signal-Dependent Noise Channels With Amplitude-Limited Inputs. 1163-1177 - Jihad Fahs
On Properties of the Support of Capacity-Achieving Distributions for Additive Noise Channel Models With Input Cost Constraints. 1178-1198 - Félix Balado, David Haughton:
Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless Sources. 1199-1216 - Ayse Ünsal
Converse Bounds on Modulation-Estimation Performance for the Gaussian Multiple-Access Channel. 1217-1230 - Alex Alvarado
Asymptotic Comparison of ML and MAP Detectors for Multidimensional Constellations. 1231-1240 - Morteza Varasteh
Zero-Delay Source-Channel Coding With a Low-Resolution ADC Front End. 1241-1261 - Kasper Fløe Trillingsgaard
Generalized HARQ Protocols with Delayed Channel State Information and Average Latency Constraints. 1262-1280 - Qian Yu
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching. 1281-1296 - Sakshi Kapoor, Sreejith Sreekumar
Distributed Scheduling in Multiple Access With Bursty Arrivals Under a Maximum Delay Constraint. 1297-1316 - Wenhan Dai
A Computational Geometry Framework for Efficient Network Localization. 1317-1339 - Zhengchun Zhou
A Construction of Multiple Optimal ZCZ Sequence Sets With Good Cross Correlation. 1340-1346 - Francis N. Castro, Oscar E. González
Diophantine Equations With Binomial Coefficients and Perturbations of Symmetric Boolean Functions. 1347-1360 - Huangsheng Yu, Shujuan Dang, Dianhua Wu
Bounds and Constructions for Optimal (n, {3, 4, 5}, Λa, 1, Q)-OOCs. 1361-1367 - Per Austrin, Petteri Kaski, Mikko Koivisto
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. 1368-1373 - Motohisa Fukuda
On the Minimum Output Entropy of Random Orthogonal Quantum Channels. 1374-1384 - Hao-Chung Cheng
Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing. 1385-1403 - Ravi Kishore
On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission. 1404-1422
Volume 64, Number 3, March 2018
- Anurag Anshu
A One-Shot Achievability Result for Quantum State Redistribution. 1425-1435 - Anurag Anshu
A Generalized Quantum Slepian-Wolf. 1436-1453 - Xin Wang
Separation Between Quantum Lovász Number and Entanglement-Assisted Zero-Error Classical Capacity. 1454-1460 - Lan Luo
Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes. 1461-1470 - Sungsoo Ahn
Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality. 1471-1480 - Lakshmi Natarajan
Lattice Codes Achieve the Capacity of Common Message Gaussian Broadcast Channels With Coded Side Information. 1481-1496 - Mario Blaum
Extended Product and Integrated Interleaved Codes. 1497-1513 - Kangwook Lee
Speeding Up Distributed Machine Learning Using Codes. 1514-1529 - Xiaoqing Fan
Variable Packet-Error Coding. 1530-1547 - Chao Tian
Caching and Delivery via Interference Elimination. 1548-1560 - Nicola di Pietro
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel. 1561-1594 - Lin Sok, Jean-Claude Belfiore, Patrick Solé
Lattice Codes for Deletion and Repetition Channels. 1595-1603 - Xiao Ma
Systematic Block Markov Superposition Transmission of Repetition Codes. 1604-1620 - K. V. Rashmi
Information-Theoretically Secure Erasure Codes for Distributed Storage. 1621-1646 - Ling Liu
Achieving Secrecy Capacity of the Gaussian Wiretap Channel With Polar Lattices. 1647-1665 - Kiryung Lee
Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization. 1666-1698 - Rui Zhang
A Proof of Conjecture on Restricted Isometry Property Constants δtk (0<t<4/3). 1699-1705 - Elaheh Mohammadi
Sampling and Distortion Tradeoffs for Bandlimited Periodic Signals. 1706-1724 - Samuel Vaiter, Gabriel Peyré, Jalal Fadili:
Model Consistency of Partly Smooth Regularizers. 1725-1737 - Yudong Chen, Xinyang Yi
Convex and Nonconvex Formulations for Mixed Regression With Two Components: Minimax Optimal Rates. 1738-1766 - Sabyasachi Chatterjee
Denoising Flows on Trees. 1767-1783 - Yu-Hang Xiao
Approximate Asymptotic Distribution of Locally Most Powerful Invariant Test for Independence: Complex Case. 1784-1799 - Triet M. Le
A Multivariate Hawkes Process With Gaps in Observations. 1800-1811 - Fode Zhang
Information Geometry of Generalized Bayesian Prediction Using α-Divergences as Loss Functions. 1812-1824 - Jihad Fahs
Information Measures, Inequalities and Performance Bounds for Parameter Estimation in Impulsive Noise Environments. 1825-1844 - Thomas Wiatowski
A Mathematical Theory of Deep Convolutional Neural Networks for Feature Extraction. 1845-1866 - Venkat Chandar, Aslan Tchamkerten
Sampling Constrained Asynchronous Communication: How to Sleep Efficiently. 1867-1878 - Flávio du Pin Calmon
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels. 1879-1892 - Shraga I. Bross
The Rate-and-State Capacity with Feedback. 1893-1918 - Ni Ding
Determining Optimal Rates for Communication for Omniscience. 1919-1944 - Karim A. Banawan
The Capacity of Private Information Retrieval From Coded Databases. 1945-1956 - Roy Timo
A Rate-Distortion Approach to Caching. 1957-1976 - Wonseok Jeon
Capacity of Continuous-Space Electromagnetic Channels With Lossy Transceivers. 1977-1991 - Wenbo He, Bobak Nazer
Uplink-Downlink Duality for Integer-Forcing. 1992-2011 - Alex Dytso
On the Minimum Mean pth Error in Gaussian Noise Channels and Its Applications. 2012-2037 - Silas L. Fong
On Achievable Rates of AWGN Energy-Harvesting Channels With Block Energy Arrival and Non-Vanishing Error Probabilities. 2038-2064 - Xinping Yi
TDMA is Optimal for All-Unicast DoF Region of TIM if and only if Topology is Chordal Bipartite. 2065-2076 - Mohamed S. Nafea
A New Wiretap Channel Model and Its Strong Secrecy Capacity. 2077-2092 - Pritam Mukherjee, Sennur Ulukus
Secure Degrees of Freedom of the Multiple Access Wiretap Channel With Multiple Antennas. 2093-2103 - Shaofeng Zou
Degraded Broadcast Channel With Secrecy Outside a Bounded Range. 2104-2120 - Pranav Madadi
Shared Rate Process for Mobile Users in Poisson Networks and Applications. 2121-2141 - Imad Ahmad
When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks? 2142-2171
Volume 64, Number 4, April 2018
- Thomas A. Courtade
A Strong Entropy Power Inequality. 2173-2192 - Salman Beigi, Amin Gohari
Φ-Entropic Measures of Correlation. 2193-2211 - Lukasz Debowski
Maximal Repetition and Zero Entropy Rate. 2212-2219 - Ferdinando Cicalese
Bounds on the Entropy of a Function of a Random Variable and Their Applications. 2220-2230 - Neri Merhav
Universal Decoding Using a Noisy Codebook. 2231-2239 - Lóránt Farkas, Tamás Kói
Universal Random Access Error Exponents for Codebooks of Different Blocklengths. 2240-2252 - Jonathan Scarlett
Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel. 2253-2266 - Arun Padakandla
Achievable Rate Region for Three User Discrete Broadcast Channel Based on Coset Codes. 2267-2297 - Shih-Yi Yeh
Degrees of Freedom of the Bursty MIMO X Channel Without Feedback. 2298-2320 - Youlong Wu
Achievable Rates for Discrete Memoryless Multicast Networks With and Without Feedback. 2321-2332 - Lan V. Truong
On Gaussian MACs With Variable-Length Feedback and Non-Vanishing Error Probabilities. 2333-2346 - Huseyin A. Inan
Capacity of the Energy Harvesting Gaussian MAC. 2347-2360 - Hua Sun
The Capacity of Robust Private Information Retrieval With Colluding Databases. 2361-2370 - Chung Chan
On the Optimality of Secret Key Agreement via Omniscience. 2371-2389 - Sihem Mesnager
Complementary Dual Algebraic Geometry Codes. 2390-2397 - Tuvi Etzion
Metrics Based on Finite Directed Graphs and Coding Invariants. 2398-2409 - Shu Liu, Chaoping Xing
List Decoding of Cover Metric Codes Up to the Singleton Bound. 2410-2416 - Hai Q. Dinh
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths. 2417-2430 - Theo G. Swart
Prefixless q-Ary Balanced Codes With Fast Syndrome-Based Error Correction. 2431-2443 - Carlos Galindo
Improved Constructions of Nested Code Pairs. 2444-2459 - Tuvi Etzion
Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding. 2460-2473 - Ohad Elishco
On Encoding Semiconstrained Systems. 2474-2484 - Sarit Buzaglo
Consecutive Switch Codes. 2485-2498 - Bin Chen
Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes. 2499-2511 - Yuchong Hu
Proxy-Assisted Regenerating Codes With Uncoded Repair for Distributed Storage Systems. 2512-2528 - Umberto Martínez-Peñas
Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks. 2529-2549 - Ryan Gabrys
Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction. 2550-2570 - Zi Long Liu
Spectrally-Constrained Sequences: Bounds and Constructions. 2571-2582 - Cheuk Ting Li
A Universal Coding Scheme for Remote Generation of Continuous Random Variables. 2583-2592 - Ashwin Pananjady
The Effect of Local Decodability Constraints on Variable-Length Compression. 2593-2608 - Tobias Koch
A Rigorous Approach to High-Resolution Entropy-Constrained Vector Quantization. 2609-2625 - Sangsin Na
On the Convexity of the MSE Distortion of Symmetric Uniform Scalar Quantization. 2626-2638 - Yue M. Lu
Sparse Representation in Fourier and Local Bases Using ProSparse: A Probabilistic Analysis. 2639-2647 - Yuheng Bu
Estimation of KL Divergence: Optimal Minimax Rate. 2648-2674 - Tom Goldstein, Christoph Studer
PhaseMax: Convex Phase Retrieval via Basis Pursuit. 2675-2689 - Yonatan Kaspi
Searching With Measurement Dependent Noise. 2690-2705 - Zahra Shakeri
Minimax Lower Bounds on Dictionary Learning for Tensor Data. 2706-2726 - W. D. Brinda
Finite-Sample Risk Bounds for Maximum Likelihood Estimation With Arbitrary Penalties. 2727-2741 - Shang Li, Xiaodong Wang:
Fully Distributed Sequential Hypothesis Testing: Algorithms and Asymptotic Analyses. 2742-2758 - Ankur A. Kulkarni
Local and Networked Mean-square Estimation with High Dimensional Log-concave Noise. 2759-2773 - Elad Domanovitz
Outage Behavior of Integer Forcing With Random Unitary Pre-Processing. 2774-2790 - Junse Lee
Scaling Laws for Ergodic Spectral Efficiency in MIMO Poisson Networks. 2791-2804 - Solomon W. Golomb, Beatrice A. Golomb
A Career in Engineering. 2805-2836 - Andrew J. Viterbi
Solomon Wolf Golomb 1932-2016. 2837-2838 - Joe Buhler
Puzzles in Memory of Solomon Golomb. 2839-2843 - Guang Gong
Solomon W. Golomb - Mathematician, Engineer, and Pioneer. 2844-2857 - Serdar Boztas
Explicit Full Correlation Distribution of Sequence Families Using Plateaued Functions. 2858-2875 - Branislav M. Popovic
Optimum Sets of Interference-Free Sequences With Zero Autocorrelation Zones. 2876-2882 - Yeow Meng Chee
Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes. 2883-2895 - Zhengchun Zhou
A Family of Polyphase Sequences With Asymptotically Optimal Correlation. 2896-2900 - Min Kyu Song
A Construction of Odd Length Generators for Optimal Families of Perfect Sequences. 2901-2909 - Yi Chen, Yuan-Hsun Lo
CRT Sequences With Applications to Collision Channels Allowing Successive Interference Cancellation. 2910-2923 - Ryan Gabrys
Sequence Reconstruction Over the Deletion Channel. 2924-2931 - Jia-Min Zhang
On the Affine Sub-Families of Quadratic NFSRs. 2932-2940 - Ming Li
De Bruijn Sequences, Adjacency Graphs, and Cyclotomy. 2941-2952 - Andrew Klapper
On the Nonexistence of q-Bent Boolean Functions. 2953-2961 - Thomas W. Cusick
Weight Recursions for Any Rotation Symmetric Boolean Functions. 2962-2968 - Claude Carlet
Constructing Low-Weight dth-Order Correlation-Immune Boolean Functions Through the Fourier-Hadamard Transform. 2969-2978 - Robert S. Coulter
Bent Functions From Involutions Over 𝔽2n. 2979-2986 - Fengrong Zhang
Large Sets of Disjoint Spectra Plateaued Functions Inequivalent to Partially Linear Functions. 2987-2999 - Zilong Wang
Discrete Fourier Transform of Boolean Functions over the Complex Field and Its Applications. 3000-3009 - Claude Carlet
Linear Codes Over 𝔽q Are Equivalent to LCD Codes for q>3. 3010-3017 - Angela I. Barbero
Rate (n-1)/n Systematic Memory Maximum Distance Separable Convolutional Codes. 3018-3030 - Sihem Mesnager
2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions. 3031-3041 - Claudio M. Qureshi
Non-Existence of Linear Perfect Lee Codes With Radius 2 for Infinitely Many Dimensions. 3042-3047 - Peter Horák
50 Years of the Golomb-Welch Conjecture. 3048-3061 - Yeow Meng Chee
Cooling Codes: Thermal-Management Coding for High-Performance Interconnects. 3062-3085 - Mahed Abroshan
Coding for Segmented Edit Channels. 3086-3098 - Li Tang
Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes. 3099-3120 - Kaveh Mahdaviani
Product Matrix MSR Codes With Bandwidth Adaptive Exact Repair. 3121-3135 - Navid Nasr Esfahani, Ian Goldberg
Some Results on the Existence of t-All-or-Nothing Transforms Over Arbitrary Alphabets. 3136-3143 - Jonathan Jedwab
Costas Cubes. 3144-3149 - Alfred W. Hales
Random Walks on Visible Points. 3150-3152 - Ryosuke Sugiura
Optimal Golomb-Rice Code Extension for Lossless Coding of Low-Entropy Exponentially Distributed Sources. 3153-3161 - Viorel Nitica
Revisiting a Tiling Hierarchy. 3162-3169 - Ilya Soloveychik
Pseudo-Wigner Matrices. 3170-3178 - Ilya Soloveychik
Symmetric Pseudo-Random Matrices. 3179-3196 - Chong Li
Youla Coding and Computation of Gaussian Feedback Capacity. 3197-3215 - Wei Mao
Models and Information-Theoretic Bounds for Nanopore Sequencing. 3216-3236
Volume 64, Number 5, May 2018
- Jayakrishnan Unnikrishnan
Unlabeled Sensing With Random Linear Measurements. 3237-3253 - Vince Lyzinski
Information Recovery in Shuffled Graphs via Graph Matching. 3254-3273 - Abhinav V. Sambasivan
Minimax Lower Bounds for Noisy Matrix Completion Under Sparse Factor Models. 3274-3285 - Ashwin Pananjady
Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery. 3286-3300 - Irène Waldspurger
Phase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections. 3301-3312 - Weihao Gao, Sewoong Oh
Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation. 3313-3330 - Dong Dai
Bayesian Model Averaging With Exponentiated Least Squares Loss. 3331-3345 - Georgios Fellouris
Efficient Byzantine Sequential Change Detection. 3346-3360 - Alix Lheritier
A Sequential Non-Parametric Multivariate Two-Sample Test. 3361-3370 - Marco Mondelli
How to Achieve the Capacity of Asymmetric Channels. 3371-3393 - Chaoping Xing
A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius. 3394-3402 - Joshua Brakensiek, Venkatesan Guruswami
Efficient Low-Redundancy Codes for Correcting Multiple Deletions. 3403-3410 - Yoones Hashemi, Amir H. Banihashemi
Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms. 3411-3430 - Vahid Aref
Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels. 3431-3449 - Yujie Gu
Bounds on Traceability Schemes. 3450-3460 - Ardhendu Tripathy
Sum-Networks From Incidence Structures: Construction and Capacity Analysis. 3461-3480 - Abhishek Agarwal, Alexander Barg
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. 3481-3492 - Imad Ahmad
Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair. 3493-3512 - Wentu Song, Kai Cai, Chau Yuen, Kui Cai, Guangyue Han:
On Sequential Locally Repairable Codes. 3513-3527 - Claudio M. Qureshi
On Equivalence of Binary Asymmetric Channels Regarding the Maximum Likelihood Decoding. 3528-3537 - Annina Bracher
The Zero-Error Feedback Capacity of State-Dependent Channels. 3538-3578 - Ashok Vardhan Makkuva
Equivalence of Additive-Combinatorial Linear Inequalities for Shannon Entropy and Differential Entropy. 3579-3589 - Elon Lindenstrauss
From Rate Distortion Theory to Metric Mean Dimension: Variational Principle. 3590-3609 - Tarik Kaced
A Conditional Information Inequality and Its Combinatorial Applications. 3610-3615 - Lei Yu
Wyner's Common Information Under Rényi Divergence Measures. 3616-3632 - Benjamin Larrousse, Samson Lasaulce
Coordination in Distributed Networks via Coded Actions With Application to Power Control. 3633-3654 - Parham Noorzad
The Unbounded Benefit of Encoder Cooperation for the $k$ -User MAC. 3655-3678 - Simon Li, Ashish Khisti
Information-Theoretic Privacy for Smart Metering Systems with a Rechargeable Battery. 3679-3695 - Wenwen Tu
Keyless Authentication and Authenticated Capacity. 3696-3714 - Semih Yagli
Minimax Rényi Redundancy. 3715-3733 - Vincent Y. F. Tan
Analysis of Remaining Uncertainties and Exponents Under Various Conditional Rényi Entropies. 3734-3755 - Lin Zhou
Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources. 3756-3780 - Farhad Shirani Chaharsooghi
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes. 3781-3809 - Alon Kipnis
The Distortion Rate Function of Cyclostationary Gaussian Processes. 3810-3824 - Burak Çakmak
Capacity Scaling in MIMO Systems With General Unitarily Invariant Random Matrices. 3825-3841 - Xinping Yi
Topological Interference Management With Decoded Message Passing. 3842-3864 - Sudeep Kamath
The Two-Unicast Problem. 3865-3882 - Weiping Zhu
Statistical Properties of Loss Rate Estimators in Tree Topology. 3883-3893 - Mauro Barni
Adversarial Source Identification Game With Corrupted Training. 3894-3915 - Cheuk Ting Li
Maximal Correlation Secrecy. 3916-3926 - Carlos Aguilar Melchor
Efficient Encryption From Random Quasi-Cyclic Codes. 3927-3943 - Yupeng Jiang
Lower and Upper Bounds on the Density of Irreducible NFSRs. 3944-3952 - S. Sandeep Pradhan
Corrections to "Abelian Group Codes for Channel Coding and Source Coding". 3953
Volume 64, Number 6, June 2018
- Imre Csiszár
Expected Value Minimization in Information Theoretic Multiple Priors Models. 3957-3974 - Ali Ahmed
Leveraging Diversity and Sparsity in Blind Deconvolution. 3975-4000 - Reinhard Heckel
Generalized Line Spectral Estimation via Convex Optimization. 4001-4023 - Jie Ding
Bridging AIC and BIC: A New Criterion for Autoregression. 4024-4043 - Armin Eftekhari
Weighted Matrix Completion and Recovery With Prior Subspace Information. 4044-4071 - Guy Bresler
Learning Graphical Models From the Glauber Dynamics. 4072-4080 - Michael Tschannen
Noisy Subspace Clustering via Matching Pursuits. 4081-4104 - Gregory J. Puleo
Correlation Clustering and Biclustering With Locally Bounded Errors. 4105-4119 - Lee-Ad Gottlieb
Near-Optimal Sample Compression for Nearest Neighbors. 4120-4128 - Samet Oymak, Benjamin Recht, Mahdi Soltanolkotabi
Sharp Time-Data Tradeoffs for Linear Inverse Problems. 4129-4158 - Martin Slawski
On the Trade-Off Between Bit Depth and Number of Samples for a Basic Approach to Structured Signal Recovery From b-Bit Quantized Linear Measurements. 4159-4178 - Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. 4179-4190 - Umberto Martínez-Peñas
Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes. 4191-4206 - Arpita Patra
On the Power of Hybrid Networks in Multi-Party Computation. 4207-4227 - Domingo Gómez-Pérez
On the Expansion Complexity of Sequences Over Finite Fields. 4228-4232 - Hugues Mercier
STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement. 4233-4258 - Changho Suh
Two-Way Interference Channel Capacity: How to Have the Cake and Eat It Too. 4259-4281 - Parham Noorzad
Can Negligible Rate Increase Network Reliability? 4282-4293 - Eli Haim
On Random-Coding Union Bounds With and Without Erasures. 4294-4308 - Ori Rottenstreich
Optimal Compression for Two-Field Entries in Fixed-Width Memories. 4309-4322 - Igal Sason
Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures. 4323-4346 - Qianqian Yang
Coded Caching and Content Delivery With Heterogeneous Distortion Requirements. 4347-4364 - Ahmed Badr, Devin Lui, Ashish Khisti
Multiplexed Coding for Multiple Streams With Different Decoding Delays. 4365-4378 - Tarik Kaced
Information Inequalities are Not Closed Under Polymatroid Duality. 4379-4381 - Abhishek Bhowmick
The List Decoding Radius for Reed-Muller Codes Over Small Fields. 4382-4391 - Tim L. Alderson
3-Dimensional Optical Orthogonal Codes With Ideal Autocorrelation-Bounds and Optimal Constructions. 4392-4398 - Lilya Budaghyan
On Upper Bounds for Algebraic Degrees of APN Functions. 4399-4411 - Ron M. Roth
Construction of Sidon Spaces With Applications to Coding. 4412-4422 - Badih Ghazi
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes. 4423-4437 - Ali Dehghan
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles. 4438-4451 - Shojiro Sakata
Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel-Pellikaan Bound. 4452-4466 - Qiwen Wang
End-to-End Error-Correcting Codes on Networks With Worst-Case Bit Errors. 4467-4479 - Elisa Gorla
An Algebraic Framework for End-to-End Physical-Layer Network Coding. 4480-4495 - Wentao Huang
Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding. 4496-4512 - Xuan Guang
Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach. 4513-4529 - Xunrui Yin, Zongpeng Li, Yaduo Liu, Xin Wang:
A Reduction Approach to the Multiple-Unicast Conjecture in Network Coding. 4530-4539 - Zhiying Wang
Multi-Version Coding - An Information-Theoretic Perspective of Consistent Distributed Storage. 4540-4561 - Henry P. Romero
Hierarchical Successive Group Decoding Achieves Capacity in the Multiple Access Channel With General Message Sets. 4562-4580 - Sunghyun Kim
A Relay Can Increase Degrees of Freedom in Bursty Interference Networks. 4581-4593 - Rhys Bowden
Finding the Right Tree: Topology Inference Despite Spatial Dependences. 4594-4609 - Pranav Sakulkar
Online Learning Schemes for Power Allocation in Energy Harvesting Communications. 4610-4628 - An Liu
Cache-Induced Hierarchical Cooperation in Wireless Device-to-Device Caching Networks. 4629-4652 - Honggang Hu
New Classes of Ternary Bent Functions From the Coulter-Matthews Bent Functions. 4653-4663 - Raúl García-Patrón
Quantum Enhancement of Randomness Distribution. 4664-4673 - Markus Grassl
Quantum Error-Correcting Codes for Qudit Amplitude Damping. 4674-4685 - Tadashi Wadayama
Comments on "Nonadaptive Group Testing Based on Sparse Pooling Graphs". 4686
Volume 64, Number 7, July 2018
- Felix Leditzky
Useful States and Entanglement Distillation. 4689-4708 - Shima Bab Hadiashar
Communication Complexity of One-Shot Remote State Preparation. 4709-4728 - Dmitri Maslov
Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations. 4729-4738 - Christoph Hirche
Bounds on Information Combining With Quantum Side Information. 4739-4757 - Angela Capel
Superadditivity of Quantum Relative Entropy for General States. 4758-4765 - Yuxiang Yang
Compression for Quantum Population Coding. 4766-4783 - Vladimir I. Man'ko, Liubov A. Markovich
Optimal Nonlinear Filtering of Quantum State. 4784-4791 - Kiryung Lee
Fast and Guaranteed Blind Multichannel Deconvolution Under a Bilinear System Model. 4792-4818 - Thomas Wiatowski
Energy Propagation in Deep Convolutional Neural Networks. 4819-4842 - Hamid Ghourchian
How Compressible Are Innovation Processes? 4843-4871 - Jess Banks, Cristopher Moore
Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization. 4872-4894 - Miguel Natalio Abadi, Sandro Gallo
The Shortest Possible Return Time of β-Mixing Processes. 4895-4906 - Danna Zhang
Asymptotic Theory for Estimators of High-Order Statistics of Stationary Processes. 4907-4922 - Shun Watanabe
Neyman-Pearson Test for Zero-Rate Multiterminal Hypothesis Testing. 4923-4939 - Oron Sabag
Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint. 4940-4961 - Christos K. Kourtellaris
Information Structures for Feedback Capacity of Channels With Memory and Transmission Cost: Stochastic Optimal Control and Variational Equalities. 4962-4992 - Martin Mittelbach
Coding Theorem and Converse for Abstract Channels With Time Structure and Memory. 4993-5016 - Hon Fah Chong, Ying-Chang Liang
On the Capacity Region of the Parallel Degraded Broadcast Channel With Three Receivers and Three-Degraded Message Sets. 5017-5041 - Michael Heindlmaier
Capacity Regions of Two-Receiver Broadcast Erasure Channels With Feedback and Memory. 5042-5069 - Ran Averbuch
Exact Random Coding Exponents and Universal Decoders for the Asymmetric Broadcast Channel. 5070-5086 - Remi A. Chou
Empirical and Strong Coordination via Soft Covering With Polar Codes. 5087-5100 - Tetsuya Kobayashi
On the Capacity of Write-Constrained Memories. 5101-5109 - Zhao Wang
Strong Secrecy for Interference Channels Based on Channel Resolvability. 5110-5130 - Gerhard Kramer
Autocorrelation Function for Dispersion-Free Fiber Channels With Distributed Amplification. 5131-5155 - Mladen Kovacevic
Codes in the Space of Multisets - Coding for Permutation Channels With Impairments. 5156-5169 - Krishna Kaipa
An Improvement of the Asymptotic Elias Bound for Non-Binary Codes. 5170-5178 - Yong Li
Using the Difference of Syndromes to Decode Quadratic Residue Codes. 5179-5190 - Hsuan-Yin Lin
Weak Flip Codes and their Optimality on the Binary Erasure Channel. 5191-5218 - Ronen Karni, Moshe Schwartz
Infinity-Norm Permutation Covering Codes From Cyclic Groups. 5219-5230 - Antonio Campello
Random Ensembles of Lattices From Generalized Reductions. 5231-5239 - Jennifer Tang
Defect Tolerance: Fundamental Limits and Examples. 5240-5260 - Jasper Goseling
Sign-Compute-Resolve for Tree Splitting Random Access. 5261-5276 - Maxim Lvov
Initialization Algorithms for Convolutional Network Coding. 5277-5295 - Rafid Mahmood
Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss. 5296-5311 - Giusi Alfano
Information-Theoretic Characterization of MIMO Systems With Multiple Rayleigh Scattering. 5312-5325 - Victor Quintero
Approximate Capacity Region of the Two-User Gaussian Interference Channel With Noisy Channel-Output Feedback. 5326-5358 - Jad Hachem
Degrees of Freedom of Cache-Aided Wireless Interference Networks. 5359-5380 - Qing He
Optimal Link Scheduling for Age Minimization in Wireless Systems. 5381-5394 - Maialen Larrañaga
Asymptotically Optimal Pilot Allocation Over Markovian Fading Channels. 5395-5418 - Lijun Ji
Asymptotically Optimal Optical Orthogonal Signature Pattern Codes. 5419-5431 - Samir Hodzic, Wilfried Meidl
Full Characterization of Generalized Bent Functions as (Semi)-Bent Spaces, Their Dual, and the Gray Image. 5432-5440 - Sihem Mesnager
Further Results on Generalized Bent Functions and Their Complete Characterization. 5441-5452 - Thomas A. Courtade
Counterexample to the Vector Generalization of Costa's Entropy Power Inequality, and Partial Resolution. 5453-5454 - Wataru Kumagai
Corrections to "Second-Order Asymptotics of Conversions of Distributions and Entangled States Based on Rayleigh-Normal Probability Distributions". 5455
Volume 64, Number 8, August 2018
- Kiryung Lee
Unified Theory for Recovery of Sparse Signals in a General Transform Domain. 5457-5477 - Sjoerd Dirksen, Guillaume Lecué
On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions. 5478-5487 - Jonathan Weed
Approximately Certifying the Restricted Isometry Property is Hard. 5488-5497 - Yuan Li
Minimax Optimal Convex Methods for Poisson Inverse Problems Under ℓq-Ball Sparsity. 5498-5512 - Larry Goldstein, Stanislav Minsker
Structured Signal Recovery From Non-Linear and Heavy-Tailed Measurements. 5513-5530 - Holger Boche, Ezra Tampubolon
PAPR Problem for Walsh Systems and Related Problems. 5531-5548 - Anelia Somekh-Baruch
On the Non-Existence of Unbiased Estimators in Constrained Estimation Problems. 5549-5554 - Mark Kozdoba
Source Estimation in Time Series and the Surprising Resilience of HMMs. 5555-5569 - Thomas Hirschler, Wolfgang Woess
Comparing Entropy Rates on Finite and Infinite Rooted Trees. 5570-5580 - Abhik Ghosh
A New Family of Divergences Originating From Model Adequacy Tests and Application to Robust Statistical Inference. 5581-5591 - Christos Thrampoulidis
Precise Error Analysis of Regularized M-Estimators in High Dimensions. 5592-5628 - Weihao Gao, Sewoong Oh
Demystifying Fixed k-Nearest Neighbor Information Estimators. 5629-5661 - Min Ye
Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy. 5662-5676 - Jianping He
Preserving Data-Privacy With Added Noises: Optimal Estimation and Privacy Analysis. 5677-5690 - Thomas A. Courtade
Quantitative Stability of the Entropy Power Inequality. 5691-5703 - Anuran Makur
Comparison of Channels: Criteria for Domination by a Symmetric Channel. 5704-5725 - Chien-Yi Wang
On Achievability for Downlink Cloud Radio Access Networks With Base Station Cooperation. 5726-5742 - Hua Sun
Multiround Private Information Retrieval: Capacity and Storage Overhead. 5743-5754 - Chong Shangguan
Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach. 5755-5766 - T. S. Jayram
A Note on Some Inequalities Used in Channel Polarization and Polar Coding. 5767-5768 - Cunsheng Ding
All Binary Linear Codes That Are Invariant Under PSL2(n). 5769-5775 - Bocong Chen, Hongwei Liu
New Constructions of MDS Codes With Complementary Duals. 5776-5782 - N. Prakash
The Storage Versus Repair-Bandwidth Trade-off for Clustered Storage Systems. 5783-5805 - Yeow Meng Chee
Optimal q-Ary Error Correcting/All Unidirectional Error Detecting Codes. 5806-5812 - Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. 5813-5831 - Günther Koliander
Rate-Distortion Theory of Finite Point Processes. 5832-5861 - Cheuk Ting Li
Extended Gray-Wyner System With Complementary Causal Side Information. 5862-5878 - Lin Zhou
Exponential Strong Converse for Content Identification With Lossy Recovery. 5879-5897 - Joseph Kampeas
The Ergodic Capacity of the Multiple Access Channel Under Distributed Scheduling - Order Optimality of Linear Receivers. 5898-5919 - Dor Shaviv
Online Power Control for Block i.i.d. Energy Harvesting Channels. 5920-5937 - Srdjan Z. Budisin
Paraunitary-Based Boolean Generator for QAM Complementary Sequences of Length 2K. 5938-5956 - Richard Hofer
On the 2-Adic Complexity of the Two-Prime Generator. 5957-5960 - Elie N. Mambou
A Construction for Balancing Non-Binary Sequences Based on Gray Code Prefixes. 5961-5969 - Rafael Dowsley
Commitment and Oblivious Transfer in the Bounded Storage Model With Errors. 5970-5984 - Wataru Kumagai
Corrections to "Random Number Conversion and LOCC Conversion via Restricted Storage". 5985
Volume 64, Number 9, September 2018
- Ebrahim MolavianJazi
Subset Source Coding. 5989-6012 - Alon Kipnis
Fundamental Distortion Limits of Analog-to-Digital Compression. 6013-6033 - Lei Yu
Distortion Bounds for Source Broadcast Problems. 6034-6053 - Daniyar Chumbalov
On the Combinatorial Version of the Slepian-Wolf Problem. 6054-6069 - Abram Magner
Lossless Compression of Binary Trees With Correlated Vertex Names. 6070-6080 - Basak Guler
Lossy Coding of Correlated Sources Over a Multiple Access Channel: Necessary Conditions and Separation Results. 6081-6097 - Rayan Saab, Rongrong Wang
From Compressed Sensing to Compressed Bit-Streams: Practical Encoders, Tractable Decoders. 6098-6114 - Kenji Yamanishi
Model Change Detection With the MDL Principle. 6115-6126 - Jungseul Ok
Optimal Inference in Crowdsourced Classification via Belief Propagation. 6127-6138 - Xi Chen
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem. 6139-6160 - Anusha Lalitha
Social Learning and Distributed Hypothesis Testing. 6161-6179 - Jiangfan Zhang
A Fundamental Limitation on Maximum Parameter Dimension for Accurate Estimation With Quantized Data. 6180-6195 - Anelia Somekh-Baruch
Converse Theorems for the DMC With Mismatched Decoding. 6196-6207 - Marco Dalai
Bounds on the Reliability Function of Typewriter Channels. 6208-6222 - Neri Merhav
Error Exponents of Typical Random Codes. 6223-6235 - Wei Yang
Beta-Beta Bounds: Finite-Blocklength Analog of the Golden Formula. 6236-6256 - Jie Li
A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems. 6257-6267 - Elise Barelli
Two-Point Codes for the Generalized GK Curve. 6268-6276 - Lingfei Jin
Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound. 6277-6282 - S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah
Mutually Uncorrelated Primers for DNA-Based Data Storage. 6283-6296 - Antonia Wachter-Zeh
List Decoding of Insertions and Deletions. 6297-6304 - Maosheng Xiong
On Cyclic Codes of Composite Length and the Minimum Distance. 6305-6314 - Liqing Xu, Hao Chen
New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes. 6315-6319 - Brian M. Kurkoski
Encoding and Indexing of Lattice Codes. 6320-6332 - Gilles R. Ducharme
Estimating the Signal-to-Noise Ratio Under Repeated Sampling of the Same Centered Signal: Applications to Side-Channel Attacks on a Cryptoprocessor. 6333-6339 - Alexei Ashikhmin, Liangbin Li
Interference Reduction in Multi-Cell Massive MIMO Systems With Large-Scale Fading Precoding. 6340-6361 - Shih-Chun Lin
Gaussian Broadcast Channels With Intermittent Connectivity and Hybrid State Information at the Transmitter. 6362-6383 - Charalambos D. Charalambous
Capacity Achieving Distributions and Separation Principle for Feedback Gaussian Channels With Memory: the LQG Theory of Directed Information. 6384-6418 - Clement Kam
On the Age of Information With Packet Deadlines. 6419-6428 - Jianghua Zhong
On Minimum Period of Nonlinear Feedback Shift Registers in Grain-Like Structure. 6429-6442 - Claude Carlet
Characterizations of the Differential Uniformity of Vectorial Functions by the Walsh Transform. 6443-6453 - Cupjin Huang
Comments on Cut-Set Bounds on Network Function Computation. 6454-6459 - Chandra Thapa
Corrections to "Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques". 6460
Volume 64, Number 10, October 2018
- Ohad Elishco
On Independence and Capacity of Multidimensional Semiconstrained Systems. 6461-6483 - José Joaquín Bernal
Information Sets From Defining Sets for Reed-Muller Codes of First and Second Order. 6484-6497 - Gaojun Luo
Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum. 6498-6505 - Ankit Singh Rawat
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth. 6506-6525 - Ian F. Blake
On Short Cycle Enumeration in Biregular Bipartite Graphs. 6526-6535 - Cunsheng Ding
Minimal Binary Linear Codes. 6536-6545 - Ran Gelles
Explicit Capacity Approaching Coding for Interactive Communication. 6546-6560 - Tao Zhang
On the Nonexistence of Perfect Splitter Sets. 6561-6566 - Hoang Dau
Repairing Reed-Solomon Codes With Multiple Erasures. 6567-6582 - Claude Carlet
On Linear Complementary Pairs of Codes. 6583-6589 - Tsung-Ching Lin, Chong-Dao Lee
The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance. 6590-6603 - Anshoo Tandon
Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes. 6604-6619 - François Bachoc, Fabrice Gamboa, Jean-Michel Loubes, Nil Venet
A Gaussian Process Regression Model for Distribution Inputs. 6620-6637 - Simone Brugiapaglia
Robustness to Unknown Error in Sparse Regularization. 6638-6661 - Jiantao Jiao
Mutual Information, Relative Entropy and Estimation Error in Semi-Martingale Channels. 6662-6671 - Jiantao Jiao
Minimax Estimation of the L1 Distance. 6672-6706 - Mohammad Golbabaee
Inexact Gradient Projection and Fast Data Driven Compressed Sensing. 6707-6721 - Juan Miguel Medina
On the Papoulis Sampling Theorem: Some General Conditions. 6722-6730 - Junfeng Wu
Kalman Filtering Over Fading Channels: Zero-One Laws and Almost Sure Stabilities. 6731-6742 - Irene Valero Toranzo
Generalization of the de Bruijn Identity to General φ-Entropies and φ-Fisher Informations. 6743-6758 - Rajai Nasser
Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering. 6759-6770 - Qi Cao
On Zero-Error Capacity of Binary Channels With One Memory. 6771-6778 - Si-Hyeon Lee
A Unified Random Coding Bound. 6779-6802 - Krzysztof Postek
Computing the Channel Capacity of a Communication System Affected by Uncertain Transition Probabilities. 6803-6815 - Christoph Kawan
On Optimal Coding of Non-Linear Dynamical Systems. 6816-6829 - Ehsan Shafieepoorfard, Maxim Raginsky
Sequential Empirical Coordination Under an Output Entropy Constraint. 6830-6841 - Karim A. Banawan
Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes. 6842-6862 - Yu-Chih Huang
Lattices Over Algebraic Integers With an Application to Compute-and-Forward. 6863-6877 - Morteza Soltani
Optical Wiretap Channel With Input-Dependent Gaussian Noise Under Peak- and Average-Intensity Constraints. 6878-6893 - Jinyuan Chen
On the MISO Channel With Feedback: Can Infinitely Massive Antennas Achieve Infinite Capacity? 6894-6916 - Rupert H. Levene
Complexity and Capacity Bounds for Quantum Channels. 6917-6928 - Eric A. Carlen
Recovery and the Data Processing Inequality for Quasi-Entropies. 6929-6938
Volume 64, Number 11, November 2018
- Amir Burin, Ofer Shayevitz
Reducing Guesswork via an Unreliable Oracle. 6941-6953 - Stefan M. Moser
Capacity Results on Multiple-Input Single-Output Wireless Optical Channels. 6954-6966 - Cheuk Ting Li
Strong Functional Representation Lemma and Applications to Coding Theorems. 6967-6978 - Venkat Anantharam
A Variational Characterization of Rényi Divergences. 6979-6989 - Alexander Golovnev
The Minrank of Random Graphs. 6990-6995 - Shirin Saeedi Bidokhti
Noisy Broadcast Networks With Receiver Caching. 6996-7016 - Shengyu Zhu
Distributed Detection in Ad Hoc Networks Through Quantized Consensus. 7017-7030 - Linqi Song
Making Recommendations Bandwidth Aware. 7031-7050 - Chien-Yi Wang
Improved Converses and Gap Results for Coded Caching. 7051-7062 - Tao Li
Distributed Averaging With Random Network Graphs and Noises. 7063-7080 - Razan Tajeddine
Private Information Retrieval From MDS Coded Data in Distributed Storage Systems. 7081-7093 - Yeow Meng Chee
Coding for Racetrack Memories. 7094-7112 - Rafah El-Khatib, Nicolas Macris
The Velocity of the Propagating Wave for Spatially Coupled Systems With Applications to LDPC Codes. 7113-7131 - Igor E. Shparlinski
On Constructing Primitive Roots in Finite Fields With Advice. 7132-7136 - Geonu Kim
Locally Repairable Codes With Unequal Local Erasure Correction. 7137-7152 - Dina Goldin
On the Finite Length Scaling of q-Ary Polar Codes. 7153-7170 - Sergei V. Bezzateev
Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes. 7171-7177 - Netanel Raviv
Asymptotically Optimal Regenerating Codes Over Any Field. 7178-7187 - Peter Beelen
Explicit MDS Codes With Complementary Duals. 7188-7193 - Si-Hyeon Lee
The Wiretapped Diamond-Relay Channel. 7194-7207 - Arash Gholami Davoodi
GDoF Region of the MISO BC: Bridging the Gap Between Finite Precision and Perfect CSIT. 7208-7217 - Laura Luzzi
Almost Universal Codes for MIMO Wiretap Channels. 7218-7241 - Eirik Rosnes
Asymptotic Analysis and Spatial Coupling of Counter Braids. 7242-7263 - Cynthia Rush
Finite Sample Analysis of Approximate Message Passing Algorithms. 7264-7286 - Huishuai Zhang
Median-Truncated Nonconvex Approach for Phase Retrieval With Outliers. 7287-7310 - Anru Zhang
Tensor SVD: Statistical and Computational Limits. 7311-7338 - Wenwen Zhao
Distributed Testing With Cascaded Encoders. 7339-7348 - Joe Suzuki
Forest Learning From Data and its Universal Coding. 7349-7358 - Yuksel Ozan Basciftci
Physical-Layer Security in TDD Massive MIMO. 7359-7380 - Eric Chitambar
The Conditional Common Information in Classical and Quantum Secret Key Distillation. 7381-7394 - Anurag Anshu
Expected Communication Cost of Distributed Quantum Tasks. 7395-7423 - Rajai Nasser
Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs. 7424-7442 - Ulrich Michel
Comments on "Improving Compressed Sensing With the Diamond Norm"-Saturation of the Norm Inequalities Between Diamond and Nuclear Norm. 7443-7445
Volume 64, Number 12, December 2018
- Mehdi Molkaraie
Monte Carlo Methods for the Ferromagnetic Potts Model Using Factor Graph Duality. 7449-7464 - G. David Forney Jr.
Codes on Graphs: Models for Elementary Algebraic Topology and Statistical Physics. 7465-7487 - Ali Al-Bashabsheh
A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers-Wannier Duality. 7488-7510 - Jiun-Hung Yu
Simultaneous Partial Inverses and Decoding Interleaved Reed-Solomon Codes. 7511-7528 - Ankit Singh Rawat
Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing. 7529-7550 - Joaquim Borges
Binary Images of ℤ2ℤ4-Additive Cyclic Codes. 7551-7556 - N. Prakash
Communication Cost for Updating Linear Functions When Message Updates are Sparse: Connections to Maximally Recoverable Codes. 7557-7576 - Yu Tsunoda
Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes. 7577-7593 - Hamid Javadi
A Statistical Model for Motifs Detection. 7594-7612 - Martin Azizyan, Akshay Krishnamurthy
Extreme Compressive Sampling for Covariance Estimation. 7613-7635 - Neri Merhav
Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation. 7636-7648 - Jason M. Klusowski
Approximation by Combinations of ReLU and Squared ReLU Ridge Functions With ℓ1 and ℓ0 Controls. 7649-7656 - Sung Hoon Lim
A Joint Typicality Approach to Compute-Forward. 7657-7685 - Kasper F. Trillingsgaard
Common-Message Broadcast Channels With Feedback in the Nonasymptotic Regime: Stop Feedback. 7686-7718 - Kasper F. Trillingsgaard
Common-Message Broadcast Channels With Feedback in the Nonasymptotic Regime: Full Feedback. 7719-7741 - Vinay Praneeth Boda
Universal Sampling Rate Distortion. 7742-7758 - Santiago Mazuelas
Spatiotemporal Information Coupling in Network Navigation. 7759-7779 - Arash Gholami Davoodi
Network Coherence Time Matters - Aligned Image Sets and the Degrees of Freedom of Interference Networks With Finite Precision CSIT and Perfect CSIR. 7780-7791 - Joseph M. Renes
On Privacy Amplification, Lossy Compression, and Their Duality to Channel Coding. 7792-7801 - Mark M. Wilde
Energy-Constrained Private and Quantum Capacities of Quantum Channels. 7802-7827 - Hamid Ghourchian
On the Capacity of a Class of Signal-Dependent Noise Channels. 7828-7846 - Antonio Campello
Universal Lattice Codes for MIMO Channels. 7847-7865 - Wei Yang
State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results. 7866-7882 - Mayank Bakshi
Plausible Deniability Over Broadcast Channels. 7883-7902 - Remi A. Chou
Polar Coding for the Multiple Access Wiretap Channel via Rate-Splitting and Cooperative Jamming. 7903-7921
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: