default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 65
Volume 65, Number 1, January 2019
- Mansoor I. Yousefi, Frank R. Kschischang:
2018 IEEE Information Theory Society Paper Award. 1 - Arash Gholami Davoodi, Syed Ali Jafar:
2018 IEEE Communications Society and Information Theory Society Joint Paper Award. 2 - Serge Kas Hanna
, Salim El Rouayheb:
Guess & Check Codes for Deletions, Insertions, and Synchronization. 3-15 - Zhengchun Zhou, Xia Li, Chunming Tang, Cunsheng Ding:
Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction. 16-27 - Sven C. Polak:
Semidefinite Programming Bounds for Constant-Weight Codes. 28-38 - Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi:
New Characterization and Parametrization of LCD Codes. 39-49 - Netanel Raviv, Moshe Schwartz, Eitan Yaakobi:
Rank-Modulation Codes for DNA Storage With Shotgun Sequencing. 50-64 - Hanqi Tang, Qifu Tyler Sun, Zongpeng Li, Xiaolong Yang, Keping Long:
Circular-Shift Linear Network Coding. 65-80 - Jy-yong Sohn, Beongjun Choi, Sung Whan Yoon, Jaekyun Moon:
Capacity of Clustered Distributed Storage. 81-107 - Xudong Li, Liming Ma, Chaoping Xing:
Optimal Locally Repairable Codes Via Elliptic Curves. 108-117 - Wael Halbawi, Zihan Liu, Iwan M. Duursma, Hoang Dau, Babak Hassibi:
Sparse and Balanced Reed-Solomon and Tamo-Barg Codes. 118-130 - Roland D. Barrolleta, Mercè Villanueva:
Partial Permutation Decoding for Several Families of Linear and ℤ4-Linear Codes. 131-141 - Yu-Chih Huang, Yi Hong, Emanuele Viterbo, Lakshmi Natarajan:
Layered Space-Time Index Coding. 142-158 - Filip Paluncic, Bodhaswar T. Maharaj:
Capacity-Approaching Non-Binary Balanced Codes Using Auxiliary Data. 159-173 - Louay Bazzi:
On the Covering Radius of Small Codes Versus Dual Distance. 174-183 - Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-Based Tests for Reed-Muller Codes. 184-197 - Alberto Ravagnani, Frank R. Kschischang:
Adversarial Network Coding. 198-219 - Joseph Connelly, Kenneth Zeger:
Capacity and Achievable Rate Regions for Linear Network Coding Over Ring Alphabets. 220-234 - Gireeja Ranade, Anant Sahai:
Control Capacity. 235-254 - Xiugang Wu, Leighton Pate Barnes, Ayfer Özgür:
"The Capacity of the Relay Channel": Solution to Cover's Problem in the Gaussian Case. 255-275 - Lin Song, Fady Alajaji, Tamás Linder:
Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost. 276-291 - Jingge Zhu, Sung Hoon Lim, Michael Gastpar:
Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding. 292-301 - Masahito Hayashi:
Universal Channel Coding for General Output Alphabet. 302-321 - Hua Sun, Syed Ali Jafar:
The Capacity of Symmetric Private Information Retrieval. 322-329 - Ilai Bistritz, Amir Leshem:
Game Theoretic Dynamic Channel Allocation for Frequency-Selective Interference Channels. 330-353 - Song-Nam Hong, Dennis Hui, Ivana Maric, Giuseppe Caire:
On the Achievable Rates of Virtual Full-Duplex Relay Channel. 354-367 - Tianyu Yang, Nan Liu, Wei Kang, Shlomo Shamai Shitz:
Converse Results for the Downlink Multicell Processing With Finite Backhaul Capacity. 368-379 - Austin Collins, Yury Polyanskiy:
Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength. 380-405 - Arash Gholami Davoodi, Syed Ali Jafar:
Aligned Image Sets and the Generalized Degrees of Freedom of Symmetric MIMO Interference Channel With Partial CSIT. 406-417 - Dawei Ding, Dmitri S. Pavlichin, Mark M. Wilde:
Quantum Channel Capacities per Unit Cost. 418-435 - Maki Yoshida, Toru Fujiwara, Marc P. C. Fossorier:
Optimal Uniform Secret Sharing. 436-443 - Karim A. Banawan, Sennur Ulukus:
Secure Degrees of Freedom Region of Static and Time-Varying Gaussian MIMO Interference Channel. 444-461 - Hai Cheng, Xiaojun Yuan, Yihua Tan:
Generalized Compute-Compress-and-Forward. 462-481 - Alon Kipnis, Andrea J. Goldsmith, Yonina C. Eldar:
The Distortion-Rate Function of Sampled Wiener Processes. 482-499 - Jun Muramatsu, Shigeki Miyake:
Channel Code Using Constrained-Random-Number Generator Revisited. 500-510 - Cheng-Der Fuh, Alexander G. Tartakovsky:
Asymptotic Bayesian Theory of Quickest Change Detection for Hidden Markov Models. 511-529 - Jaksa Cvitanic, Drazen Prelec, Sonja Radas, Hrvoje Sikic:
Game of Duels: Information-Theoretic Axiomatization of Scoring Rules. 530-537 - Alessio Sancetta:
Consistency Results for Stationary Autoregressive Processes With Constrained Coefficients. 538-550 - Yingjie Fei, Yudong Chen:
Exponential Error Rates of SDP for Block Models: Beyond Grothendieck's Inequality. 551-571 - Ahmed El Alaoui, Aaditya Ramdas, Florent Krzakala, Lenka Zdeborová, Michael I. Jordan:
Decoding From Pooled Data: Phase Transitions of Message Passing. 572-585 - Holger Boche, Volker Pohl:
Calculating the Hilbert Transform on Spaces With Energy Concentration: Convergence and Divergence Regions. 586-603 - Rafah El-Khatib, Nicolas Macris, Tom Richardson, Rüdiger L. Urbanke:
Displacement Convexity in Spatially Coupled Scalar Recursions. 604-621 - Vincenzo Matta, Ali H. Sayed:
Consistent Tomography Under Partial Observations Over Adaptive Networks. 622-646 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2. 647-663 - Gal Shulkind, Stefanie Jegelka, Gregory W. Wornell:
Sensor Array Design Through Submodular Optimization. 664-675 - Jong Yoon Hyun, Yoonjin Lee:
Characterization of p-ary Bent Functions in Terms of Strongly Regular Graphs. 676-684
Volume 65, Number 2, February 2019
- Yining Wang, Yu-Xiang Wang, Aarti Singh:
A Theoretical Analysis of Noisy Sparse Subspace Clustering on Dimensionality-Reduced Data. 685-706 - Oliver Johnson, Matthew Aldridge, Jonathan Scarlett:
Performance of Group Testing Algorithms With Near-Constant Tests Per Item. 707-723 - Nazanin Takbiri, Amir Houmansadr, Dennis L. Goeckel, Hossein Pishro-Nik:
Matching Anonymized and Obfuscated Time Series to Users' Profiles. 724-741 - Mahdi Soltanolkotabi, Adel Javanmard, Jason D. Lee:
Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks. 742-769 - Gabriel H. Tucci, Ke Wang:
New Methods for Handling Singular Sample Covariance Matrices. 770-786 - Matías Vera, Leonardo Rey Vega, Pablo Piantanida:
Collaborative Information Bottleneck. 787-815 - Baris Nakiboglu:
The Sphere Packing Bound via Augustin's Method. 816-840 - Baris Nakiboglu:
The Rényi Capacity and Center. 841-860 - Uzi Pereg, Yossef Steinberg:
The Arbitrarily Varying Channel Under Constraints With Side Information at the Encoder. 861-887 - M. H. R. Khouzani, Pasquale Malacaria:
Generalized Entropies and Metric-Invariant Optimal Countermeasures for Information Leakage Under Symmetric Constraints. 888-901 - Jithin Ravi, Bikash Kumar Dey:
Function Computation Through a Bidirectional Relay. 902-916 - Assaf Kartowsky, Ido Tal:
Greedy-Merge Degrading has Optimal Power-Law. 917-934 - Christopher G. Blake, Frank R. Kschischang:
Energy, Latency, and Reliability Tradeoffs in Coding Circuits. 935-946 - Hilal Asi, Eitan Yaakobi:
Nearly Optimal Constructions of PIR and Batch Codes. 947-964 - Ryan Gabrys, Frederic Sala:
Codes Correcting Two Deletions. 965-974 - Kun Huang, Udaya Parampalli, Ming Xian:
Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes. 975-984 - Yi-Sheng Su:
Optimal Pliable Fractional Repetition Codes That are Locally Recoverable: A Bipartite Graph Approach. 985-999 - Carlos Galindo, Olav Geil, Fernando Hernando, Diego Ruano:
New Binary and Ternary LCD Codes. 1008-1016 - Yoones Hashemi, Amir H. Banihashemi:
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes With Applications to Stopping Sets. 1017-1033 - Ignacio Cascudo:
On Squares of Cyclic Codes. 1034-1047 - Yuan Luo, Chaoping Xing, Chen Yuan:
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes. 1048-1053 - Rocco Trombetti, Yue Zhou:
A New Family of MRD Codes in $\mathbb{F_q}^{2n\times2n}$ With Right and Middle Nuclei $\mathbb F_{q^n}$. 1054-1062 - Diego Napp, Raquel Pinto, Marisa Toste:
Column Distances of Convolutional Codes Over ${\mathbb Z}_{p^r}$. 1063-1071 - Anuradha Sharma, Tania Sidana:
On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings. 1072-1084 - Hessam Mahdavifar, Alexander Vardy:
Algebraic List-Decoding in Projective Space: Decoding With Multiplicities and Rank-Metric Codes. 1085-1100 - Nikolay I. Yankov, Radka Russeva, Emine Karatash:
Classification of Binary Self-Dual [76, 38, 14] Codes With an Automorphism of Order 9. 1101-1105 - Claudio M. Qureshi:
Matched Metrics to the Binary Asymmetric Channels. 1106-1112 - Anshul Jaiswal, Manav R. Bhatnagar:
Free-Space Optical Communication: A Diversity-Multiplexing Tradeoff Perspective. 1113-1125 - Arash Gholami Davoodi, Syed Ali Jafar:
$K$ -User Symmetric $M\times N$ MIMO Interference Channel Under Finite Precision CSIT: A GDoF Perspective. 1126-1136 - Seyed Arvin Ayoughi, Wei Yu:
Interference Mitigation via Relaying. 1137-1152 - Or Ordentlich, Uri Erez:
Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM. 1153-1164 - Mark Braverman, Brendan Juba:
The Price of Uncertain Priors in Source Coding. 1165-1171 - Chen Gong, Xiaodong Wang:
On Finite Block-Length Quantization Distortion. 1172-1188 - Julien Lavauzelle:
Private Information Retrieval From Transversal Designs. 1189-1205 - Karim A. Banawan, Sennur Ulukus:
The Capacity of Private Information Retrieval from Byzantine and Colluding Databases. 1206-1219 - Alireza Vahid, A. Robert Calderbank:
Throughput Region of Spatially Correlated Interference Packet Networks. 1220-1235 - Ahmad AlAmmouri, Jeffrey G. Andrews, François Baccelli:
A Unified Asymptotic Analysis of Area Spectral Efficiency in Ultradense Cellular Networks. 1236-1248 - Jia-Min Zhang, Tian Tian, Wen-Feng Qi, Qun-Xiong Zheng:
A New Method for Finding Affine Sub-Families of NFSR Sequences. 1249-1257 - Fabien Arlery, UyHour Tan, Olivier Rabaste:
Generalization and Improvement of the Levenshtein Lower Bound for Aperiodic Correlation. 1258-1266 - Michal Horovitz, Eitan Yaakobi:
Reconstruction of Sequences Over Non-Identical Channels. 1267-1286 - Pierre-Alain Fouque, Mehdi Tibouchi:
Close to Uniform Prime Number Generation With Fewer Random Bits. 1307-1317 - Chunlei Xie, WeiGuo Zhang, Enes Pasalic:
Correction to "Large Sets of Orthogonal Sequences Suitable for Applications in CDMA Systems". 1318 - Iwan M. Duursma:
Shortened Regenerating Codes. 1000-1007 - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Building Blocks for Communication Over Noisy Quantum Networks. 1287-1306
Volume 65, Number 3, March 2019
- Lei Yu, Vincent Y. F. Tan:
Asymptotic Coupling and Its Applications in Information Theory. 1321-1344 - Shengtian Yang, Rui Xu, Jun Chen, Jian-Kang Zhang:
Intrinsic Capacity. 1345-1360 - Venkat Anantharam, Amin Aminzadeh Gohari, Chandra Nair:
On the Evaluation of Marton's Inner Bound for Two-Receiver Broadcast Channels. 1361-1371 - Chandra Nair, David Ng:
Invariance of the Han-Kobayashi Region With Respect to Temporally-Correlated Gaussian Inputs. 1372-1374 - Mokshay Madiman, Farhad Ghassemi:
Combinatorial Entropy Power Inequalities: A Preliminary Study of the Stam Region. 1375-1386 - Arnaud Marsiglietti, James Melbourne:
On the Entropy Power Inequality for the Rényi Entropy of Order [0, 1]. 1387-1396 - Shaofeng Zou, Georgios Fellouris, Venugopal V. Veeravalli:
Quickest Change Detection Under Transient Dynamics: Theory and Asymptotic Analysis. 1397-1412 - Alexander G. Tartakovsky:
Asymptotic Optimality of Mixture Rules for Detecting Changes in General Stochastic Models. 1413-1429 - Dong Yin, Ramtin Pedarsani, Yudong Chen, Kannan Ramchandran:
Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes. 1430-1451 - Andreas Elsener, Sara A. van de Geer:
Sharp Oracle Inequalities for Stationary Points of Nonconvex Penalized M-Estimators. 1452-1472 - Hao Henry Zhou, Garvesh Raskutti:
Non-Parametric Sparse Additive Auto-Regressive Network Models. 1473-1492 - Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen, Qi Chen, Pierre Moulin:
On Information-Theoretic Characterizations of Markov Random Fields and Subfields. 1493-1511 - Shahab Asoodeh, Mario Díaz, Fady Alajaji, Tamás Linder:
Estimation Efficiency Under Privacy Constraints. 1512-1534 - Michael Kohler, Adam Krzyzak:
Estimation of a Density From an Imperfect Simulation Model. 1535-1546 - Praneeth Narayanamurthy, Namrata Vaswani:
Provable Dynamic Robust PCA or Robust Subspace Tracking. 1547-1577 - Ahmed Elzanaty, Andrea Giorgetti, Marco Chiani:
Limits on Sparse Data Acquisition: RIC Analysis of Finite Gaussian Matrices. 1578-1588 - Xin Jiang Hunt, Patricia Reynaud-Bouret, Vincent Rivoirard, Laure Sansonnet, Rebecca Willett:
A Data-Dependent Weighted LASSO Under Poisson Noise. 1589-1613 - Simon R. Blackburn, Jessica Claridge:
Finite-Field Matrix Channels for Network Coding. 1614-1625 - Urs Niesen, Shrinivas Kudekar:
Joint Crosstalk-Avoidance and Error-Correction Coding for Parallel Data Buses. 1626-1638 - Min Ye, Alexander Barg:
Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters. 1639-1656 - Noga Alon, Boris Bukh, Yury Polyanskiy:
List-Decodable Zero-Rate Codes. 1657-1667 - Chengju Li, Peng Zeng:
Constructions of Linear Codes With One-Dimensional Hull. 1668-1676 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
BP-LED Decoding Algorithm for LDPC Codes Over AWGN Channels. 1677-1693 - Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi:
On $\sigma$ -LCD Codes. 1694-1704 - Michal Horovitz, Tuvi Etzion:
Local Rank Modulation for Flash Memories. 1705-1713 - Mohammad Ali Maddah-Ali, Urs Niesen:
Cache-Aided Interference Channels. 1714-1724 - Min Li, Lawrence Ong, Sarah J. Johnson:
Cooperative Multi-Sender Index Coding. 1725-1739 - Yansheng Wu, Qin Yue:
Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes. 1740-1751