default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE 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, Pramod Viswanath, Shun Watanabe:
Interactive Communication for Data Exchange. 26-37 - Dor Shaviv, Ayfer Özgür, Haim H. Permuter:
A Communication Channel With Random Battery Recharges. 38-56 - Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Change of Multivariate Mutual Information: From Local to Global. 57-76 - Mokshay M. Madiman, Ioannis Kontoyiannis:
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, Mohammad Ali Maddah-Ali, Qian Yu, Amir Salman Avestimehr:
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing. 109-128 - Yanina Y. Shkel, Sergio Verdú:
A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss. 129-147 - Yonglong Li, Guangyue Han:
Asymptotics of Input-Constrained Erasure Channel Capacity. 148-162 - Yuta Sakai, Ken-ichi Iwata:
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, Dmitri V. Truhachev, Frank R. Kschischang:
Spatially Coupled Split-Component Codes With Iterative Algebraic Decoding. 205-224 - Renaud-Alexandre Pitaval, Lu Wei, Olav Tirkkonen, Camilla Hollanti:
Density of Spherically Embedded Stiefel and Grassmann Codes. 225-248 - Kees A. Schouhamer Immink, Kui Cai:
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, Kenneth Zeger:
Linear Network Coding Over Rings - Part I: Scalar Codes and Commutative Alphabets. 274-291 - Joseph Connelly, Kenneth Zeger:
Linear Network Coding Over Rings - Part II: Vector Codes and Non-Commutative Alphabets. 292-308 - Talha Cihad Gülcü, Min Ye, Alexander Barg:
Construction of Polar Codes for Arbitrary Discrete Memoryless Channels. 309-321 - Shenghao Yang, Tsz-Ching Ng, Raymond W. Yeung:
Finite-Length Analysis of BATS Codes. 322-348 - Jinbei Zhang, Xiaojun Lin, Xinbing Wang:
Coded Caching Under Arbitrary Popularity Distributions. 349-366 - Yuwei Xu, Claude Carlet, Sihem Mesnager, Chuankun Wu:
Classification of Bent Monomials, Constructions of Bent Multinomials and Upper Bounds on the Nonlinearity of Vectorial Functions. 367-383 - Yang Yang, Xiaohu Tang:
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, Subhamoy Maitra:
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, Amela Muratovic-Ribic, Samed Bajric:
On the Maximum Number of Bent Components of Vectorial Functions. 403-411 - Veit Elser:
The Complexity of Bit Retrieval. 412-428 - Sameer Pawar, Kannan Ramchandran:
FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time. 429-450 - Sameer Pawar, Kannan Ramchandran:
R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT. 451-466 - Tamir Bendory, Yonina C. Eldar, Nicolas Boumal:
Non-Convex Phase Retrieval From STFT Measurements. 467-484 - Felix Krahmer, Yi-Kai Liu:
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, Ronit Bustin, Daniela Tuninetti, Natasha Devroye, H. Vincent Poor, Shlomo Shamai Shitz:
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, Mohamad Assaad, Mérouane Debbah, Anthony Ephremides:
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, Nilanjana Datta:
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, Tsuyoshi Sasaki Usuda:
Realizing a 2-D Positive Operator-Valued Measure by Local Operations and Classical Communication. 613-621 - Ching-Yi Lai, Alexei E. Ashikhmin:
Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators. 622-639 - Xin Wang, Wei Xie, Runyao Duan:
Semidefinite Programming Strong Converse Bounds for Classical Capacity. 640-653 - Mitsugu Iwamoto, Kazuo Ohta, Junji Shikata:
Security Formalizations and Their Relationships for Encryption and Key Agreement in Information-Theoretic Cryptography. 654-685
Volume 64, Number 2, February 2018
- Richard Kueng, Peter Jung:
Robust Nonnegative Sparse Recovery and the Nullspace Property of 0/1 Measurements. 689-703 - Peter Jung, Felix Krahmer, Dominik Stöger:
Blind Demixing and Deconvolution at Near-Optimal Rate. 704-727 - Lasha Ephremidze, Faisal Saied, Ilya M. Spitkovsky:
On the Algorithmization of Janashia-Lagvilava Matrix Spectral Factorization Method. 728-737 - Zheng Wang, Cong Ling:
On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling. 738-751 - Salem Said, Hatem Hajri, Lionel Bombrun, Baba C. Vemuri:
Gaussian Distributions on Riemannian Symmetric Spaces: Statistical Learning With Structured Covariance Matrices. 752-772 - Gang Wang, Georgios B. Giannakis, Yonina C. Eldar:
Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow. 773-794 - Diaa Al Mohamad, Assia Boumahdaf:
Semiparametric Two-Component Mixture Models When One Component Is Defined Through Linear Constraints. 795-830 - Nidhin Koshy Vaidhiyan, Rajesh Sundaresan:
Learning to Detect an Oddball Target. 831-852 - K. Pavan Srinath, Ramji Venkataramanan:
Cluster-Seeking James-Stein Estimators. 853-874 - Masahito Hayashi, Vincent Y. F. Tan:
Minimum Rates of Approximate Sufficient Statistics. 875-888 - Jian Liu, Sihem Mesnager, Lusheng Chen:
New Constructions of Optimal Locally Recoverable Codes via Good Polynomials. 889-899 - Lingfei Jin, Yuan Luo, Chaoping Xing:
Repairing Algebraic Geometry Codes. 900-908 - Yeow Meng Chee, Xiande Zhang:
Linear Size Constant-Composition Codes Meeting the Johnson Bound. 909-917 - Evyatar Hemo, Yuval Cassuto:
A Constrained Coding Scheme for Correcting Asymmetric Magnitude-1 Errors in q-Ary Channels. 918-932 - Rawad Bitar, Salim El Rouayheb:
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, Shuhong Gao:
Fast Decoding of Expander Codes. 972-978 - Linqi Song, Christina Fragouli:
A Polynomial-Time Algorithm for Pliable Index Coding. 979-999 - Hua Sun, Syed Ali Jafar:
Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al. 1000-1022 - Xiugang Wu, Ayfer Özgür:
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, Yuval Kochman, Ashish Khisti:
The MIMO Wiretap Channel Decomposed. 1046-1063 - Marco Tomamichel, Masahito Hayashi:
Operational Interpretation of Rényi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions. 1064-1082 - Benjamin Arras, Yvik Swan:
IT Formulae for Gamma Target: Mutual Information and Relative Entropy. 1083-1091 - Mireille El Gheche, Giovanni Chierchia, Jean-Christophe Pesquet:
Proximity Operators of Discrete Information Divergences. 1092-1104 - Hye Won Chung, Brian M. Sadler, Lizhong Zheng, Alfred O. Hero III:
Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem. 1105-1131 - Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch:
Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks. 1132-1162 - Ahmad ElMoslimany, Tolga M. Duman:
On the Discreteness of Capacity-Achieving Distributions for Fading and Signal-Dependent Noise Channels With Amplitude-Limited Inputs. 1163-1177 - Jihad Fahs, Ibrahim C. Abou-Faycal:
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, Raymond Knopp, Neri Merhav:
Converse Bounds on Modulation-Estimation Performance for the Gaussian Multiple-Access Channel. 1217-1230 - Alex Alvarado, Erik Agrell, Fredrik Brannstrom:
Asymptotic Comparison of ML and MAP Detectors for Multidimensional Constellations. 1231-1240 - Morteza Varasteh, Borzoo Rassouli, Osvaldo Simeone, Deniz Gündüz:
Zero-Delay Source-Channel Coding With a Low-Resolution ADC Front End. 1241-1261 - Kasper Fløe Trillingsgaard, Petar Popovski:
Generalized HARQ Protocols with Delayed Channel State Information and Average Latency Constraints. 1262-1280 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching. 1281-1296 - Sakshi Kapoor, Sreejith Sreekumar, Sibi Raj B. Pillai:
Distributed Scheduling in Multiple Access With Bursty Arrivals Under a Maximum Delay Constraint. 1297-1316 - Wenhan Dai, Yuan Shen, Moe Z. Win:
A Computational Geometry Framework for Efficient Network Localization. 1317-1339 - Zhengchun Zhou, Dan Zhang, Tor Helleseth, Jinming Wen:
A Construction of Multiple Optimal ZCZ Sequence Sets With Good Cross Correlation. 1340-1346 - Francis N. Castro, Oscar E. González, Luis A. Medina:
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, Jesper Nederlof:
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. 1368-1373 - Motohisa Fukuda, Ion Nechita:
On the Minimum Output Entropy of Random Orthogonal Quantum Channels. 1374-1384 - Hao-Chung Cheng, Min-Hsiu Hsieh:
Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing. 1385-1403 - Ravi Kishore, Ashutosh Kumar, Chiranjeevi Vanarasa, Kannan Srinathan:
On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission. 1404-1422
Volume 64, Number 3, March 2018
- Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A One-Shot Achievability Result for Quantum State Redistribution. 1425-1435 - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Generalized Quantum Slepian-Wolf. 1436-1453 - Xin Wang, Runyao Duan:
Separation Between Quantum Lovász Number and Entanglement-Assisted Zero-Error Classical Capacity. 1454-1460 - Lan Luo, Zhi Ma:
Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes. 1461-1470 - Sungsoo Ahn, Michael Chertkov, Andrew E. Gelfand, Sejun Park, Jinwoo Shin:
Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality. 1471-1480 - Lakshmi Natarajan, Yi Hong, Emanuele Viterbo:
Lattice Codes Achieve the Capacity of Common Message Gaussian Broadcast Channels With Coded Side Information. 1481-1496 - Mario Blaum, Steven R. Hetzler:
Extended Product and Integrated Interleaved Codes. 1497-1513 - Kangwook Lee, Maximilian Lam, Ramtin Pedarsani, Dimitris S. Papailiopoulos, Kannan Ramchandran:
Speeding Up Distributed Machine Learning Using Codes. 1514-1529 - Xiaoqing Fan, Oliver Kosut, Aaron B. Wagner:
Variable Packet-Error Coding. 1530-1547 - Chao Tian, Jun Chen:
Caching and Delivery via Interference Elimination. 1548-1560 - Nicola di Pietro, Gilles Zémor, Joseph J. Boutros:
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel. 1561-1594 - Lin Sok, Jean-Claude Belfiore, Patrick Solé, Aslan Tchamkerten:
Lattice Codes for Deletion and Repetition Channels. 1595-1603 - Xiao Ma, Kechao Huang, Baoming Bai:
Systematic Block Markov Superposition Transmission of Repetition Codes. 1604-1620 - K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar:
Information-Theoretically Secure Erasure Codes for Distributed Storage. 1621-1646 - Ling Liu, Yanfei Yan, Cong Ling:
Achieving Secrecy Capacity of the Gaussian Wiretap Channel With Polar Lattices. 1647-1665 - Kiryung Lee, Yihong Wu, Yoram Bresler:
Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization. 1666-1698 - Rui Zhang, Song Li:
A Proof of Conjecture on Restricted Isometry Property Constants δtk (0<t<4/3). 1699-1705 - Elaheh Mohammadi, Farokh Marvasti:
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, Constantine Caramanis:
Convex and Nonconvex Formulations for Mixed Regression With Two Components: Minimax Optimal Rates. 1738-1766 - Sabyasachi Chatterjee, John D. Lafferty:
Denoising Flows on Trees. 1767-1783 - Yu-Hang Xiao, Lei Huang, Junhao Xie, Hing-Cheung So:
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, Yimin Shi, Hon Keung Tony Ng, Ruibing Wang:
Information Geometry of Generalized Bayesian Prediction Using α-Divergences as Loss Functions. 1812-1824 - Jihad Fahs, Ibrahim C. Abou-Faycal:
Information Measures, Inequalities and Performance Bounds for Parameter Estimation in Impulsive Noise Environments. 1825-1844 - Thomas Wiatowski, Helmut Bölcskei:
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, Yury Polyanskiy, Yihong Wu:
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels. 1879-1892 - Shraga I. Bross, Amos Lapidoth:
The Rate-and-State Capacity with Feedback. 1893-1918 - Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Determining Optimal Rates for Communication for Omniscience. 1919-1944 - Karim A. Banawan, Sennur Ulukus:
The Capacity of Private Information Retrieval From Coded Databases. 1945-1956 - Roy Timo, Shirin Saeedi Bidokhti, Michèle A. Wigger, Bernhard C. Geiger:
A Rate-Distortion Approach to Caching. 1957-1976 - Wonseok Jeon, Sae-Young Chung:
Capacity of Continuous-Space Electromagnetic Channels With Lossy Transceivers. 1977-1991 - Wenbo He, Bobak Nazer, Shlomo Shamai Shitz:
Uplink-Downlink Duality for Integer-Forcing. 1992-2011 - Alex Dytso, Ronit Bustin, Daniela Tuninetti, Natasha Devroye, H. Vincent Poor, Shlomo Shamai Shitz:
On the Minimum Mean pth Error in Gaussian Noise Channels and Its Applications. 2012-2037