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 - José Joaquín Bernal, Marinês Guerreiro, Juan Jacobo Simón:
From ds-Bounds for Cyclic Codes to True Minimum Distance for Abelian Codes. 1752-1763 - Dania Elzouki, Sorina Dumitrescu, Jun Chen:
Lattice-Based Robust Distributed Source Coding. 1764-1781 - Sangsin Na, David L. Neuhoff:
Monotonicity of Step Sizes of MSE-Optimal Symmetric Uniform Scalar Quantizers. 1782-1792 - Alvaro Martín, Gadiel Seroussi, Luciana Vitale:
Asymptotically Tight Bounds on the Depth of Estimated Context Trees. 1793-1806 - Roy D. Yates, Sanjit K. Kaul:
The Age of Information: Real-Time Status Updating by Multiple Sources. 1807-1827 - Xing Liu, Liang Zhou, Shengqiang Li:
A New Method to Construct Strictly Optimal Frequency Hopping Sequences With New Parameters. 1828-1844 - Qian Guo, Thomas Johansson, Paul Stankovski Wagner:
A Key Recovery Reaction Attack on QC-MDPC. 1845-1861 - Lei Yu, Vincent Y. F. Tan:
Rényi Resolvability and Its Applications to the Wiretap Channel. 1862-1897 - Yimin Pang, Mahesh K. Varanasi:
A Unified Theory of Multiple-Access and Interference Channels via Approximate Capacity Regions for the MAC-IC-MAC. 1898-1920 - Jinming Wen, Xiao-Wen Chang:
On the KZ Reduction. 1921-1935 - Ezio Biglieri, Emanuele Viterbo:
Line Codes Generated by Finite Coxeter Groups. 1936-1947 - Ather Gattami:
Feedback Capacity of Gaussian Channels Revisited. 1948-1960 - Antonio Campello, Daniel Dadush, Cong Ling:
AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping. 1961-1971
Volume 65, Number 4, April 2019
- Mengfan Zheng, Cong Ling, Wen Chen, Meixia Tao:
Polar Coding Strategies for the Interference Channel With Partial-Joint Decoding. 1973-1993 - Eren Sasoglu, Ido Tal:
Polar Coding for Processes With Memory. 1994-2003 - Boaz Shuval, Ido Tal:
Fast Polarization for Processes With Memory. 2004-2020 - Boaz Shuval, Ido Tal:
A Lower Bound on the Probability of Error of Polar Codes over BMS Channels. 2021-2045 - Ron M. Roth:
Fault-Tolerant Dot-Product Engines. 2046-2057 - Matthew Aldridge:
Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime. 2058-2061 - Ali Dehghan, Amir H. Banihashemi:
From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. 2062-2074 - Heide Gluesing-Luerssen, Anna-Lena Horlemann-Trautmann:
Symbol Erasure Correction in Random Networks With Spread Codes. 2075-2091 - Emmanuel Boutillon:
Optimization of Non Binary Parity Check Coefficients. 2092-2100 - Herivelto Martins Borges Filho, Alonso Sepúlveda Castellanos, Guilherme Chaud Tizziotti:
Subcovers and Codes on a Class of Trace-Defining Curves. 2101-2106 - Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Ivo Kubjas:
$t$ -Private Information Retrieval Schemes Using Transitive Codes. 2107-2118 - Joaquim Borges, Steven T. Dougherty, Cristina Fernández-Córdoba, Roger Ten-Valls:
${\mathbb{Z}_{2}\mathbb{Z}_{4}}$ -Additive Cyclic Codes: Kernel and Rank. 2119-2127 - Ahmed H. Hareedy, Chinmayi Lanka, Nian Guo, Lara Dolecek:
A Combinatorial Methodology for Optimizing Non-Binary Graph-Based Codes: Theoretical Analysis and Applications in Data Storage. 2128-2154 - Eitan Yaakobi, Jehoshua Bruck:
On the Uncertainty of Information Retrieval in Associative Memories. 2155-2165 - Lingfei Jin, Haibin Kan:
Self-Dual Near MDS Codes from Elliptic Curves. 2166-2170 - Venkatesan Guruswami, Ray Li:
Polynomial Time Decodable Codes for the Binary Deletion Channel. 2171-2178 - Anelia Somekh-Baruch:
Ratio List Decoding. 2179-2189 - Mehrdad Tahmasbi, Matthieu R. Bloch:
First- and Second-Order Asymptotics in Covert Communication. 2190-2212 - Germán Bassi, Pablo Piantanida, Shlomo Shamai Shitz:
The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation. 2213-2233 - Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
The Dispersion of Mismatched Joint Source-Channel Coding for Arbitrary Sources and Additive Channels. 2234-2251 - Galen Reeves, Henry D. Pfister:
The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact. 2252-2283 - Boshuang Huang, Kobi Cohen, Qing Zhao:
Active Anomaly Detection in Heterogeneous Processes. 2284-2301 - Zai Yang, Jinhui Tang, Yonina C. Eldar, Lihua Xie:
On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization. 2302-2315 - Majid Asadi, Nader Ebrahimi, Omid Kharazmi, Ehsan S. Soofi:
Mixture Models, Bayes Fisher Information, and Divergence Measures. 2316-2321 - Aamir Anis, Aly El Gamal, Amir Salman Avestimehr, Antonio Ortega:
A Sampling Theory Perspective of Graph-Based Semi-Supervised Learning. 2322-2342 - Chao Ma, Xin Liu, Zaiwen Wen:
Globally Convergent Levenberg-Marquardt Method for Phase Retrieval. 2343-2359 - Pengfei Yang, Biao Chen:
Robust Kullback-Leibler Divergence and Universal Hypothesis Testing for Continuous Distributions. 2360-2373 - Mahdi Soltanolkotabi:
Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization. 2374-2400 - Eric C. Hall, Garvesh Raskutti, Rebecca M. Willett:
Learning High-Dimensional Generalized Linear Autoregressive Models. 2401-2422 - Sharu Theresa Jose, Ankur A. Kulkarni:
Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming. 2423-2441 - Nematollah Iri, Oliver Kosut:
Fine Asymptotics for Universal One-to-One Compression of Parametric Sources. 2442-2458 - Aaron B. Wagner, Amine Laourine, Nadine Hussami:
Degradedness and Secrecy in Memoryless Queues. 2459-2476 - Neri Merhav:
Ensemble Performance of Biometric Authentication Systems Based on Secret Key Generation. 2477-2491 - Tao Liu, Guangyue Han:
Feedback Capacity of Stationary Gaussian Channels Further Examined. 2492-2506 - Thomas R. Dean, Mary Wootters, Andrea J. Goldsmith:
Blind Joint MIMO Channel Estimation and Decoding. 2507-2524 - Ziv Goldfeld, Haim H. Permuter:
MIMO Gaussian Broadcast Channels With Common, Private, and Confidential Messages. 2525-2544 - Kasper Duivenvoorden, Nikolas P. Breuckmann, Barbara M. Terhal:
Renormalization Group Decoder for a Four-Dimensional Toric Code. 2545-2562 - Kyungjoo Noh, Victor V. Albert, Liang Jiang:
Quantum Capacity Bounds of Gaussian Thermal Loss Channels and Achievable Rates With Gottesman-Kitaev-Preskill Codes. 2563-2582 - Xin Wang, Kun Fang, Runyao Duan:
Semidefinite Programming Converse Bounds for Quantum Communication. 2583-2592 - Carlos Galindo, Fernando Hernando, Diego Ruano:
Classical and Quantum Evaluation Codes at the Trace Roots. 2593-2602 - Sina Salek, Daniela Cadamuro, Philipp Kammerlander, Karoline Wiesner:
Quantum Rate-Distortion Coding of Relevant Information. 2603-2613 - Michele Dall'Arno, Francesco Buscemi:
Tradeoff Relations Between Accessible Information, Informational Power, and Purity. 2614-2622 - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel. 2623-2636
Volume 65, Number 5, May 2019
- Ron M. Roth, Alexander Zeh:
On Spectral Design Methods for Quasi-Cyclic Codes. 2637-2647 - Natalia Silberstein, Tuvi Etzion, Moshe Schwartz:
Locality and Availability of Array Codes Constructed From Subspaces. 2648-2660 - Jay Mardia, Burak Bartan, Mary Wootters:
Repairing Multiple Failures for Scalar MDS Codes. 2661-2672 - Itzhak Tamo, Min Ye, Alexander Barg:
The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size. 2673-2695 - Hongwei Liu, Youcef Maouche:
Two or Few-Weight Trace Codes over ${\mathbb{F}_{q}}+u{\mathbb{F}_{q}}$. 2696-2703 - Masato Tajima:
An Innovations Approach to Viterbi Decoding of Convolutional Codes. 2704-2722 - Zhifang Zhang, Jingke Xu:
The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers. 2723-2735 - Kaveh Mahdaviani, Ashish Khisti, Soheil Mohajer:
Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes. 2736-2759 - Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou:
Nearly Optimal Sparse Group Testing. 2760-2773 - Zilin Jiang, Nikita Polyanskii, Ilya Vorobyev:
On Capacities of the Two-User Union Channel With Complete Feedback. 2774-2781 - Marco Mondelli, S. Hamed Hassani, Rüdiger L. Urbanke:
Construction of Polar Codes With Sublinear Complexity. 2782-2791 - Seyed Pooya Shariatpanahi, Giuseppe Caire, Babak Hossein Khalaj:
Physical-Layer Schemes for Wireless Coded Caching. 2792-2807 - Venkat Anantharam, François Baccelli:
Error Exponents for Dimension-Matched Vector Multiple Access Channels With Additive Noise. 2808-2823 - Tibor Keresztfalvi, Amos Lapidoth:
Multiplexing Zero-Error and Rare-Error Communications Over a Noisy Channel. 2824-2837 - Longguang Li, Aslan Tchamkerten:
Second-Order Asymptotics for Communication Under Strong Asynchronism. 2838-2849 - Ahmad Beirami, A. Robert Calderbank, Mark M. Christiansen, Ken R. Duffy, Muriel Médard:
A Characterization of Guesswork on Swiftly Tilting Curves. 2850-2871 - Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel:
Quantum Sphere-Packing Bounds With Polynomial Prefactors. 2872-2898 - Tongyang Li, Xiaodi Wu:
Quantum Query Complexity of Entropy Estimation. 2899-2921 - Holger Boche, Minglai Cai, Ning Cai:
Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources. 2922-2943 - Gaojun Luo, Xiwang Cao, Xiaojing Chen:
MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction. 2944-2952 - Benjamin Mark, Garvesh Raskutti, Rebecca Willett:
Network Estimation From Point Process Data. 2953-2975 - Jinchi Chen, Yulong Liu:
Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements. 2976-2994 - Yunwen Lei, Ürün Dogan, Ding-Xuan Zhou, Marius Kloft:
Data-Dependent Generalization Bounds for Multi-Class Classification. 2995-3021 - Tony Yaacoub, George V. Moustakides, Yajun Mei:
Optimal Stopping for Interval Estimation in Bernoulli Trials. 3022-3033 - Jie Ding, Jiawei Zhou, Vahid Tarokh:
Asymptotically Optimal Prediction for Time-Varying Data Generating Processes. 3034-3067 - Felix Abramovich, Vadim Grinshtein:
High-Dimensional Classification by Sparse Logistic Regression. 3068-3079 - Narayanaswamy Balakrishnan, Elena Castilla, Nirian Martín, Leandro Pardo:
Robust Estimators and Test Statistics for One-Shot Device Testing Under the Exponential Distribution. 3080-3096 - Yanjun Li, Kiryung Lee, Yoram Bresler:
Blind Gain and Phase Calibration via Sparse Spectral Methods. 3097-3123 - Abiy Tasissa, Rongjie Lai:
Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion. 3124-3144 - Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
Refined Asymptotics for Rate-Distortion Using Gaussian Codebooks for Arbitrary Sources. 3145-3159 - Carlos Ochoa, Gonzalo Navarro:
RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy. 3160-3164 - Patrick Ah-Fat, Michael Huth:
Optimal Accuracy-Privacy Trade-Off for Secure Computations. 3165-3182 - Qiwen Wang, Mikael Skoglund:
On PIR and Symmetric PIR From Colluding Databases With Adversaries and Eavesdroppers. 3183-3197 - Qiwen Wang, Hua Sun, Mikael Skoglund:
The Capacity of Private Information Retrieval With Eavesdroppers. 3198-3214 - Yi-Peng Wei, Karim Banawan, Sennur Ulukus:
Fundamental Limits of Cache-Aided Private Information Retrieval With Unknown and Uncoded Prefetching. 3215-3232 - Maki Yoshida, Satoshi Obana:
Verifiably Multiplicative Secret Sharing. 3233-3245 - Paulo Ricardo Branco da Silva, Danilo Silva:
Multilevel LDPC Lattices With Efficient Encoding and Decoding and a Generalization of Construction $\text{D}'$. 3246-3260 - Kaniska Mohanty, Mahesh K. Varanasi:
On the Generalized Degrees of Freedom of the MIMO Interference Channel With Delayed CSIT. 3261-3277 - Cynthia Rush, Ramji Venkataramanan:
The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding. 3278-3303 - Yansheng Wu, Qin Yue, Fengwei Li:
Three Families of Monomial Functions With Three-Valued Walsh Spectrum. 3304-3314
Volume 65, Number 6, June 2019
- Oliver Kosut, Jörg Kliewer:
Strong Converses are Just Edge Removal Properties. 3315-3339 - Boris Bukh, Christopher Cox:
On a Fractional Version of Haemers' Bound. 3340-3348 - Lei Yu, Vincent Y. F. Tan:
Simulation of Random Variables Under Rényi Divergence Measures of All Orders. 3349-3383 - Zitan Chen, Sidharth Jaggi, Michael Langberg:
The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels. 3384-3411 - Ran Averbuch, Nir Weinberger, Neri Merhav:
Expurgated Bounds for the Asymmetric Broadcast Channel. 3412-3435 - Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Minimum-Entropy Couplings and Their Applications. 3436-3451 - Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillen i Fabregas:
Generalized Random Gilbert-Varshamov Codes. 3452-3469 - Ajaykrishnan Nageswaran, Prakash Narayan:
Data Privacy for a $\rho$ -Recoverable Function. 3470-3488 - Xingguo Li, Junwei Lu, Raman Arora, Jarvis D. Haupt, Han Liu, Zhaoran Wang, Tuo Zhao:
Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization. 3489-3514 - Jason M. Klusowski, Dana Yang, W. D. Brinda:
Estimating the Coefficients of a Mixture of Two Linear Regressions by Expectation Maximization. 3515-3524 - Sabyasachi Chatterjee, Sumit Mukherjee:
Estimation in Tournaments and Graphs Under Monotonicity Constraints. 3525-3539 - John M. Konstantinides, Ioannis Andreadis:
Empirical Lipschitz Constants for the Renyi Entropy Maximum Likelihood Estimator. 3540-3554 - Michael G. Moore, Mark A. Davenport:
Estimation of Poisson Arrival Processes Under Linear Models. 3555-3564 - Emmanuel Abbe, Tamir Bendory, William E. Leeb, João M. Pereira, Nir Sharon, Amit Singer:
Multireference Alignment Is Easier With an Aperiodic Translation Distribution. 3565-3584 - Rotem Mulayoff, Tomer Michaeli:
On the Minimal Overcompleteness Allowing Universal Sparse Representation. 3585-3599 - Junjie Ma, Ji Xu, Arian Maleki:
Optimization-Based AMP for Phase Retrieval: The Impact of Initialization and $\ell_{2}$ Regularization. 3600-3629 - Zheng Wang, Cong Ling:
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling. 3630-3645 - Jonathan Scarlett:
Noisy Adaptive Group Testing: Bounds and Algorithms. 3646-3661 - Venkatesan Guruswami, Chaoping Xing, Chen Yuan:
How Long Can Optimal Locally Repairable Codes Be? 3662-3670 - Maya Levy, Eitan Yaakobi:
Mutually Uncorrelated Codes for DNA Storage. 3671-3691 - Ryan Gabrys, Eitan Yaakobi, Mario Blaum, Paul H. Siegel:
Constructions of Partial MDS Codes Over Small Fields. 3692-3701 - Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Van Khu Vu:
Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories. 3702-3712 - Chong-Dao Lee:
Radical-Locator Polynomials and Row-Echelon Partial Syndrome Matrices With Applications to Decoding Cyclic Codes. 3713-3723 - Yauhen Yakimenka, Vitaly Skachek, Irina E. Bocharova, Boris D. Kudryashov:
Stopping Redundancy Hierarchy Beyond the Minimum Distance. 3724-3737 - Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Separable Codes for the Symmetric Multiple-Access Channel. 3738-3750 - Ling-Hua Chang, Po-Ning Chen, Vincent Y. F. Tan, Carol Wang, Yunghsiang S. Han:
On the Maximum Size of Block Codes Subject to a Distance Criterion. 3751-3757 - Sudarsan V. S. Ranganathan, Dariush Divsalar, Richard D. Wesel:
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths. 3758-3777 - Ali Dehghan, Amir H. Banihashemi:
On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph. 3778-3789 - Xuan Guang, Raymond W. Yeung, Shenghao Yang, Congduan Li:
Improved Upper Bound on the Network Function Computing Capacity. 3790-3811 - Ran Gelles, Yael Tauman Kalai:
Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks. 3812-3829 - Chengju Li, Peng Wu, Fengmei Liu:
On Two Classes of Primitive BCH Codes and Some Related Codes. 3830-3840 - Minjia Shi, Rongsheng Wu, Denis S. Krotov:
On $Z_p Z_{p^k}$ -Additive Codes and Their Duality. 3841-3847 - Yan-Yu Zhang, Hong-Yi Yu, Jian-Kang Zhang:
Constellation-Optimal Beamformers for Multiuser MISO Broadcast Visible Light Communications. 3848-3870 - Hua Sun:
The Capacity of Anonymous Communications. 3871-3879 - Hua Sun, Syed Ali Jafar:
The Capacity of Private Computation. 3880-3897 - Razane Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers. 3898-3906 - Alex Dytso, Mert Al, H. Vincent Poor, Shlomo Shamai Shitz:
On the Capacity of the Peak Power Constrained Vector Gaussian Channel: An Estimation Theoretic Perspective. 3907-3921 - Rashad Eletreby, Osman Yagan:
$k$ -Connectivity of Inhomogeneous Random Key Graphs With Unreliable Links. 3922-3949 - Hayata Yamasaki, Mio Murao:
Quantum State Merging for Arbitrarily Small-Dimensional Systems. 3950-3972 - Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor:
Superadditivity in Trade-Off Capacities of Quantum Channels. 3973-3989 - Yvo Desmedt, Fred Piper:
Perfect Anonymity. 3990-3997
Volume 65, Number 7, July 2019
- Mahdi Cheraghchi:
Expressions for the Entropy of Basic Discrete Distributions. 3999-4009 - Mehrdad Kiamari, Amir Salman Avestimehr:
Capacity Region of the Symmetric Injective K-User Deterministic Interference Channel. 4010-4022 - Ken R. Duffy, Jiange Li, Muriel Médard:
Capacity-Achieving Guessing Random Additive Noise Decoding. 4023-4040 - Terence Chan, Satyajit Thakor, Alex J. Grant:
Minimal Characterization of Shannon-Type Inequalities Under Functional Dependence and Full Conditional Independence Structures. 4041-4051 - Mahdi Cheraghchi, João Ribeiro:
Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel. 4052-4068 - Wei Yang, Rafael F. Schaefer, H. Vincent Poor:
Wiretap Channels: Nonasymptotic Fundamental Limits. 4069-4093 - Olivier Binette:
A Note on Reverse Pinsker Inequalities. 4094-4096 - Ori Peled, Oron Sabag, Haim H. Permuter:
Feedback Capacity and Coding for the (0, k)-RLL Input-Constrained BEC. 4097-4114 - Shuangqing Liu, Yanxun Chang, Tao Feng:
Constructions for Optimal Ferrers Diagram Rank-Metric Codes. 4115-4130 - Tuvi Etzion, Hui Zhang:
Grassmannian Codes With New Distance Measures for Network Coding. 4131-4142 - Milad Johnny, Mohammad Reza Aref:
A Multi-Layer Encoding and Decoding Strategy for Binary Erasure Channel. 4143-4151 - Daniele Bartoli, Matteo Bonini:
Minimal Linear Codes in Odd Characteristic. 4152-4155 - Stanislav Kruglik, Kamilla Nazirkhanova, Alexey A. Frolov:
New Bounds and Generalizations of Locally Recoverable Codes With Availability. 4156-4166 - Anyu Wang, Zhifang Zhang, Dongdai Lin:
Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach. 4167-4179 - Marwen Zorgui, Zhiying Wang:
Centralized Multi-Node Repair Regenerating Codes. 4180-4206 - Suman Ghosh, Lakshmi Natarajan:
Linear Codes for Broadcasting With Noisy Side Information. 4207-4226 - Amirhossein Reisizadeh, Saurav Prakash, Ramtin Pedarsani, Amir Salman Avestimehr:
Coded Computation Over Heterogeneous Clusters. 4227-4242 - Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, Alexandre Graell i Amat:
Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes. 4243-4273 - Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures. 4274-4292 - Rami Cohen, Netanel Raviv, Yuval Cassuto:
LDPC Codes Over the q-ary Multi-Bit Channel. 4293-4306 - Ali Dehghan, Amir H. Banihashemi:
Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. 4307-4315 - Daniel Panario, Mark Saaltink, Brett Stevens, Daniel Wevrick:
A General Construction of Ordered Orthogonal Arrays Using LFSRs. 4316-4326 - Iosif Pinelis:
Exact Upper and Lower Bounds on the Misclassification Probability. 4327-4334 - Ann-Kristin Becker, Hajo Holzmann:
Nonparametric Identification in the Dynamic Stochastic Block Model. 4335-4344 - Andrew D. Back, Daniel Angus, Janet Wiles:
Determining the Number of Samples Required to Estimate Entropy in Natural Sequences. 4345-4352 - Damian Straszak, Nisheeth K. Vishnoi:
Belief Propagation, Bethe Approximation and Polynomials. 4353-4363 - Lan V. Truong, Vincent Y. F. Tan:
Moderate Deviation Asymptotics for Variable-Length Codes With Feedback. 4364-4386 - Jean-Francois Collet:
An Exact Expression for the Gap in the Data Processing Inequality for f-Divergences. 4387-4391 - Shang Li, Xiaoou Li, Xiaodong Wang, Jingchen Liu:
Sequential Hypothesis Test With Online Usage-Constrained Sensor Selection. 4392-4410 - Sadaf Salehkalaibar, Michèle A. Wigger, Ligong Wang:
Hypothesis Testing Over the Two-Hop Relay Network. 4411-4433 - Gauri Jagatap, Chinmay Hegde:
Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements. 4434-4456 - Thomas Debarre, Julien Fageot, Harshit Gupta, Michael Unser:
B-Spline-Based Exact Discretization of Continuous-Domain Inverse Problems With Generalized TV Regularization. 4457-4470 - George Barmpalias, Andrew Lewis-Pye:
Compression of Data Streams Down to Their Information Content. 4471-4485 - Krishnan Eswaran, Michael Gastpar:
Remote Source Coding Under Gaussian Noise: Dueling Roles of Power and Entropy Power. 4486-4498 - Wasim Huleihel, Salman Salamatian, Neri Merhav, Muriel Médard:
Gaussian Intersymbol Interference Channels With Mismatch. 4499-4517 - Yunhao Sun, Ruchen Duan, Yingbin Liang, Shlomo Shamai Shitz:
State-Dependent Interference Channel With Correlated States. 4518-4531 - Wen-Hsuan Li, Jwo-Yuh Wu:
BER-Improved Quantization of Source-to-Relay Link SNR for Cooperative Beamforming: A Fixed Point Theory Approach. 4532-4549 - Dmitri V. Truhachev, Christian Schlegel:
Coupling Data Transmission for Multiple-Access Communications. 4550-4574 - Inaki Estella Aguerri, Abdellatif Zaidi, Giuseppe Caire, Shlomo Shamai Shitz:
On the Capacity of Cloud Radio Access Networks With Oblivious Relaying. 4575-4596 - Yubo Li, Liying Tian, Tao Liu, Chengqian Xu:
Constructions of Quasi-Complementary Sequence Sets Associated With Characters. 4597-4608 - Xin Wang, Kun Fang, Marco Tomamichel:
On Converse Bounds for Classical Communication Over Quantum Channels. 4609-4619 - Ignacio Cascudo, Jaron Skovsted Gundersen, Diego Ruano:
Improved Bounds on the Threshold Gap in Ramp Secret Sharing. 4620-4633 - Bin Zhu:
On the Uniqueness Result of Theorem 6 in "Relative Entropy and the Multivariable Multidimensional Moment Problem". 4634-4639 - Nematollah Iri, Oliver Kosut:
Corrections to "Fine Asymptotics for Universal One-to-One Compression of Parametric Sources". 4640
Volume 65, Number 8, August 2019
- Thierry P. Berger, Cheikh Thiécoumba Gueye, Jean Belo Klamti:
Generalized Subspace Subcodes With Application in Cryptology. 4641-4657 - Lingfei Jin:
Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes. 4658-4663 - Jong Yoon Hyun, Hyun Kwang Kim, Jeong Rye Park:
Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code. 4664-4672 - Tao Feng, Henk D. L. Hollmann, Qing Xiang:
The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle. 4673-4682 - Ajay Badita, Parimal Parag, Jean-François Chamberland:
Latency Analysis for Distributed Coded Storage Systems. 4683-4698 - Shixin Zhu, Zhonghua Sun, Xiaoshan Kai:
A Class of Narrow-Sense BCH Codes. 4699-4714 - Cunsheng Ding, Ziling Heng:
The Subfield Codes of Ovoid Codes. 4715-4729 - Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum, Yuchong Hu:
Rack-Aware Regenerating Codes for Data Centers. 4730-4745 - Siyi Yang, Clayton Schoeny, Lara Dolecek:
Theoretical Bounds and Constructions of Codes in the Generalized Cayley Metric. 4746-4763 - Gary R. W. Greaves, Jeven Syatriadi:
Reed-Solomon Codes Over Small Fields With Constrained Generator Matrices. 4764-4770 - Matthew Amy, Michele Mosca:
T-Count Optimization and Reed-Muller Codes. 4771-4784 - Umberto Martínez-Peñas, Frank R. Kschischang:
Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes. 4785-4803 - Mladen Kovacevic:
Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis. 4804-4814 - Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Symbol-Pair Codes. 4815-4821 - Daniel Heinlein:
New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions. 4822-4830 - Yanfang Liu, Pablo M. Olmos, Tobias Koch:
A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC. 4831-4853 - Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons. 4854-4874 - Kirill Efimov, Larisa Adamyan, Vladimir G. Spokoiny:
Adaptive Nonparametric Clustering. 4875-4892 - Dragana Bajovic, José M. F. Moura, Dejan Vukobratovic:
Detecting Random Walks on Graphs With Heterogeneous Sensors. 4893-4914 - Pablo Martínez-Nuevo, Alan V. Oppenheim:
Lattice Functions for the Analysis of Analog-to-Digital Conversion. 4915-4923 - Yoshimasa Uematsu, Yingying Fan, Kun Chen, Jinchi Lv, Wei Lin:
SOFAR: Large-Scale Association Network Learning. 4924-4939 - Nir Weinberger, Yuval Kochman:
On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection. 4940-4965 - Ligong Wang:
The Poisson Channel With Varying Dark Current Known to the Transmitter. 4966-4978 - Ziv Goldfeld, Haim H. Permuter:
Wiretap and Gelfand-Pinsker Channels Analogy and Its Applications. 4979-4996 - Neri Merhav:
False-Accept/False-Reject Trade-Offs for Ensembles of Biometric Authentication Systems. 4997-5006 - Nirmal V. Shende, Aaron B. Wagner:
The Stochastic-Calculus Approach to Multi-Receiver Poisson Channels. 5007-5027 - Lan V. Truong, Vincent Y. F. Tan:
The Reliability Function of Variable-Length Lossy Joint Source-Channel Coding With Feedback. 5028-5042 - Tibor Keresztfalvi, Amos Lapidoth:
Semi-Robust Communications Over a Broadcast Channel. 5043-5049 - Wasim Huleihel, Ohad Elishco, Muriel Médard:
Blind Group Testing. 5050-5063 - Vinay Praneeth Boda:
Reconstructing Gaussian Sources by Spatial Sampling. 5064-5079 - Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. 5080-5093 - Sarah Kamel, Mireille Sarkiss, Michèle A. Wigger, Ghaya Rekaya-Ben Othman:
Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels. 5094-5124 - Mohamed S. Nafea, Aylin Yener:
Generalizing Multiple Access Wiretap and Wiretap II Channel Models: Achievable Rates and Cost of Strong Secrecy. 5125-5143 - Remi A. Chou, Aylin Yener:
Secret-Key Generation in Many-to-One Networks: An Integrated Game-Theoretic and Information-Theoretic Approach. 5144-5159 - Qiwen Wang, Mikael Skoglund:
Symmetric Private Information Retrieval from MDS Coded Distributed Storage With Non-Colluding and Colluding Servers. 5160-5175 - Alireza Vahid:
On the Degrees-of-Freedom of Two-Unicast Wireless Networks With Delayed CSIT. 5176-5188 - Neri Merhav:
Tradeoffs Between Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation. 5189-5196 - Jingjing Zhang, Osvaldo Simeone:
Fundamental Limits of Cloud and Cache-Aided Interference Management With Multi-Antenna Edge Nodes. 5197-5214 - Ahmed M. Bedewy, Yin Sun, Ness B. Shroff:
Minimizing the Age of Information Through Queues. 5215-5232 - Christian Günther, Kai-Uwe Schmidt:
Sequence Pairs With Asymptotically Optimal Aperiodic Correlation. 5233-5238 - Mateusz Michalek, Yaroslav Shitov:
Quantum Version of Wielandt's Inequality Revisited. 5239-5242 - Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving. 5243-5259 - Chun Guo:
Understanding the Related-Key Security of Feistel Ciphers From a Provable Perspective. 5260-5280 - Cong Ling, Jean-Claude Belfiore:
Corrections to "Achieving AWGN Channel Capacity With Lattice Gaussian Coding". 5281
Volume 65, Number 9, September 2019
- Sergey G. Bobkov, Gennadiy P. Chistyakov, Friedrich Götze:
Non-Uniform Bounds in the Poisson Approximation With Applications to Informational Distances I. 5283-5293 - Sergey G. Bobkov:
Moments of the Scores. 5294-5301 - Anders Høst-Madsen, Elyas Sabeti, Chad Walton:
Data Discovery and Anomaly Detection Using Atypicality: Theory. 5302-5322 - Uri Hadar, Ofer Shayevitz:
Distributed Estimation of Gaussian Correlations. 5323-5338 - Sundeep Rangan, Philip Schniter, Alyson K. Fletcher, Subrata Sarkar:
On the Convergence of Approximate Message Passing With Arbitrary Matrices. 5339-5351 - Yuzo Maruyama, Takeru Matsuda, Toshio Ohnishi:
Harmonic Bayesian Prediction Under $\alpha$ -Divergence. 5352-5366 - Chenglong Ye, Yuhong Yang:
High-Dimensional Adaptive Minimax Sparse Estimation With Interactions. 5367-5379 - Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor. 5380-5400 - Lek-Heng Lim, Rodolphe Sepulchre, Ke Ye:
Geometric Distance Between Positive Definite Matrices of Different Dimensions. 5401-5405 - Yu-Xiang Wang, Huan Xu, Chenlei Leng:
Provable Subspace Clustering: When LRR Meets SSC. 5406-5432 - Lev Yohananov, Eitan Yaakobi:
Codes for Graph Erasures. 5433-5453 - Swanand Kadhe, Salim Y. El Rouayheb, Iwan M. Duursma, Alex Sprintson:
Codes With Locality in the Rank and Subspace Metrics. 5454-5468 - Mehran Elyasi, Soheil Mohajer:
Determinant Codes With Helper-Independent Repair for Single and Multiple Failures. 5469-5483 - Weiqi Li, Zhiying Wang, Hamid Jafarkhani:
On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes. 5484-5502 - Liang Bai, Zihui Liu:
On the Second Relative Greedy Weight of 4-Dimensional Codes. 5503-5518 - Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen:
Efficiently Decodable Non-Adaptive Threshold Group Testing. 5519-5528 - Amit Solomon, Yuval Cassuto:
Error-Correcting WOM Codes: Concatenation and Joint Design. 5529-5546 - Abhishek Agarwal, Larkin Flodin, Arya Mazumdar:
Linear Programming Approximations for Index Coding. 5547-5564 - Yiwei Zhang, Xin Wang, Hengjia Wei, Gennian Ge:
On Private Information Retrieval Array Codes. 5565-5573 - Weijun Fang, Fang-Wei Fu:
New Constructions of MDS Euclidean Self-Dual Codes From GRS Codes and Extended GRS Codes. 5574-5579 - Arya Mazumdar, Andrew McGregor, Sofya Vorotnikova:
Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate. 5580-5591 - Huseyin A. Inan, Peter Kairouz, Mary Wootters, Ayfer Özgür:
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing. 5592-5603 - Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr., Alireza Karami:
Code Design Based on Connecting Spatially Coupled Graph Chains. 5604-5617 - Jean Barbier, Mohamad Dia, Nicolas Macris:
Universal Sparse Superposition Codes With Spatial Coupling and GAMP Decoding. 5618-5642 - Henry D. Pfister, Rüdiger L. Urbanke:
Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets. 5643-5655 - Christopher G. Blake, Frank R. Kschischang:
Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding. 5656-5673 - Juan Pablo Vigneaux:
Information Theory With Finite Vector Spaces. 5674-5687 - Urs Niesen:
An Information-Theoretic Analysis of Deduplication. 5688-5704 - Gonzalo Vazquez-Vilar, Albert Guillén i Fàbregas, Sergio Verdú:
The Error Probability of Generalized Perfect Codes via the Meta-Converse. 5705-5717 - Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
Sufficiently Myopic Adversaries Are Blind. 5718-5736 - Sudheer Poojary, Sanidhay Bhambay, Parimal Parag:
Real-Time Status Updates for Markov Source. 5737-5749 - Ryo Yaguchi, Masahito Hayashi:
Second Order Analysis for Joint Source-Channel Coding With General Channel and Markovian Source. 5750-5770 - Chong Li, Yingbin Liang, H. Vincent Poor, Shlomo Shamai Shitz:
Secrecy Capacity of Colored Gaussian Noise Channels With Feedback. 5771-5782 - Zhuqing Jia, Hua Sun, Syed Ali Jafar:
Cross Subspace Alignment and the Asymptotic Capacity of $X$ -Secure $T$ -Private Information Retrieval. 5783-5798 - Enrico Piovano, Hamdi Joudeh, Bruno Clerckx:
Generalized Degrees of Freedom of the Symmetric Cache-Aided MISO Broadcast Channel With Partial CSIT. 5799-5815 - Meghana Bande, Aly El Gamal, Venugopal V. Veeravalli:
Degrees of Freedom in Wireless Interference Networks With Cooperative Transmission and Backhaul Load Constraints. 5816-5832 - Shihui Fu, Xiutao Feng, Qiang Wang, Claude Carlet:
On the Derivative Imbalance and Ambiguity of Functions. 5833-5845 - Xianhua Niu, Chaoping Xing:
New Extension Constructions of Optimal Frequency-Hopping Sequence Sets. 5846-5855 - WeiGuo Zhang:
High-Meets-Low: Construction of Strictly Almost Optimal Resilient Boolean Functions via Fragmentary Walsh Spectra. 5856-5864 - Samir Hodzic, Enes Pasalic, Yongzhuang Wei, Fengrong Zhang:
Designing Plateaued Boolean Functions in Spectral Domain and Their Classification. 5865-5879 - Gilad Gour:
Comparison of Quantum Channels by Superchannels. 5880-5904 - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction. 5905-5924 - Samuel Epstein:
Algorithmic No-Cloning Theorem. 5925-5930 - Marco Fanizza, Andrea Mari, Vittorio Giovannetti:
Optimal Universal Learning Machines for Quantum State Discrimination. 5931-5944 - Péter Vrana, Matthias Christandl:
Distillation of Greenberger-Horne-Zeilinger States by Combinatorial Methods. 5945-5958 - Giacomo De Palma:
New Lower Bounds to the Output Entropy of Multi-Mode Quantum Gaussian Channels. 5959-5968
Volume 65, Number 10, October 2019
- Alexander A. Sherstov, Pei Wu:
Optimal Interactive Coding for Insertions, Deletions, and Substitutions. 5971-6000 - Chin Hei Chan, Enoch Kung, Maosheng Xiong:
Random Matrices From Linear Codes and Wigner's Semicircle Law. 6001-6009 - Anand Kumar Narayanan, Matthew Weidner:
Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound. 6010-6021 - Ali Dehghan, Amir H. Banihashemi:
Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. 6022-6043 - Erik Ordentlich, Ron M. Roth:
On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels. 6044-6055 - Sean Ballentine, Alexander Barg, Serge G. Vladut:
Codes With Hierarchical Locality From Covering Maps of Curves. 6056-6071 - Mohammad Ali Tebbi, Terence H. Chan, Chi Wan Sung:
Multi-Rack Distributed Data Storage Networks. 6072-6088 - Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. 6089-6100 - Fan Li, Jinyuan Chen, Zhiying Wang:
Wireless MapReduce Distributed Computing. 6101-6114 - Farhad Shirani, S. Sandeep Pradhan:
On the Sub-Optimality of Single-Letter Coding Over Networks. 6115-6135 - Simon R. Blackburn, Tuvi Etzion:
PIR Array Codes With Optimal Virtual Server Rate. 6136-6145 - Clayton Schoeny, Frederic Sala, Mark Gottscho, Irina Alam, Puneet Gupta, Lara Dolecek:
Context-Aware Resiliency: Unequal Message Protection for Random-Access Memories. 6146-6159 - Yujie Gu, Minquan Cheng, Grigory Kabatiansky, Ying Miao:
Probabilistic Existence Results for Parent-Identifying Schemes. 6160-6170 - Sanghamitra Dutta, Viveck R. Cadambe, Pulkit Grover:
"Short-Dot": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products. 6171-6193 - Lin-Zhi Shen, Fang-Wei Fu:
The Decoding Error Probability of Linear Codes Over the Erasure Channel. 6194-6203 - Jared Antrobus, Heide Gluesing-Luerssen:
Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations. 6204-6223 - Yuval Ginosar, Aviram Rochas Moreno:
Crossed Products and Coding Theory. 6224-6233 - Semih Yagli, Paul Cuff:
Exact Exponent for Soft Covering. 6234-6262 - Mohsen Heidari, Farhad Shirani, S. Sandeep Pradhan:
Quasi Structured Codes for Multi-Terminal Communications. 6263-6289 - Jian-Jia Weng, Lin Song, Fady Alajaji, Tamás Linder:
Capacity of Two-Way Channels With Symmetry Properties. 6290-6313 - Ido B. Gattegno, Haim H. Permuter, Shlomo Shamai Shitz, Ayfer Özgür:
Cooperative Binning for Semi-Deterministic Channels With Non-Causal State Information. 6314-6331 - Badri N. Vellambi, Roy Timo:
Common Reconstructions in the Successive Refinement Problem With Receiver Side Information. 6332-6354 - Peida Tian, Victoria Kostina:
The Dispersion of the Gauss-Markov Source. 6355-6384 - Victoria Kostina, Ertem Tuncel:
Successive Refinement of Abstract Sources. 6385-6398 - Moses Ganardi, Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Universal Tree Source Coding Using Grammar-Based Compression. 6399-6413 - Lin Zhou, Mehul Motani:
Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems. 6414-6440 - Qi Zhao, Yunchao Liu, Xiao Yuan, Eric Chitambar, Andreas J. Winter:
One-Shot Coherence Distillation: Towards Completing the Picture. 6441-6453 - Kun Fang, Xin Wang, Marco Tomamichel, Runyao Duan:
Non-Asymptotic Entanglement Distillation. 6454-6465 - Dmitry Gavinsky:
Quantum Versus Classical Simultaneity in Communication Complexity. 6466-6483 - Guillaume Bouleux, Maël Dugast, Eric Marcon:
Information Topological Characterization of Periodically Correlated Processes by Dilation Operators. 6484-6495 - Bernhard C. Geiger, Tobias Koch:
On the Information Dimension of Stochastic Processes. 6496-6518 - Stefano Maranò, Ali H. Sayed:
Detection Under One-Bit Messaging Over Adaptive Networks. 6519-6538 - Tamir Hazan, Francesco Orabona, Anand D. Sarwate, Subhransu Maji, Tommi S. Jaakkola:
High Dimensional Inference With Random Maximum A-Posteriori Perturbations. 6539-6560 - Kwangjun Ahn, Kangwook Lee, Changho Suh:
Community Recovery in Hypergraphs. 6561-6579 - Xiao Li, Dong Yin, Sameer Pawar, Ramtin Pedarsani, Kannan Ramchandran:
Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes. 6580-6619 - Sajad Daei, Farzan Haddadi, Arash Amini, Martin Lotz:
On the Error in Phase Transition Computations for Compressed Sensing. 6620-6632 - Leonard J. Schulman, Piyush Srivastava:
Online Codes for Analog Signals. 6633-6649 - Dekai Liu, Song Li, Yi Shen:
One-Bit Compressive Sensing With Projected Subgradient Method Under Sparsity Constraints. 6650-6663 - Sundeep Rangan, Philip Schniter, Alyson K. Fletcher:
Vector Approximate Message Passing. 6664-6684 - Yuting Wei, Fanny Yang, Martin J. Wainwright:
Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities. 6685-6703 - Jiantao Jiao, Yanjun Han, Irena Fischer-Hwang, Tsachy Weissman:
Estimating the Fundamental Limits is Easier Than Achieving the Fundamental Limits. 6704-6715 - Wenwen Tu, Lifeng Lai:
On Function Computation With Privacy and Secrecy Constraints. 6716-6733 - Holger Boche, Christian Deppe, Andreas J. Winter:
Secure and Robust Identification via Classical-Quantum Channels. 6734-6749 - Te Sun Han, Masahide Sasaki:
Wiretap Channels With Causal State Information: Strong Secrecy. 6750-6765 - Pratik Patil, Wei Yu:
Generalized Compression Strategy for the Downlink Cloud Radio Access Network. 6766-6780 - Joachim Neu, Anas Chaaban, Aydin Sezgin, Mohamed-Slim Alouini:
Degrees-of-Freedom of the MIMO Three-Way Channel With Node-Intermittency. 6781-6800 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Daniela Tuninetti:
Network Simplification in Half-Duplex: Building on Submodularity. 6801-6818 - Haode Yan, Zhengchun Zhou, Jian Weng, Jinming Wen, Tor Helleseth, Qi Wang:
Differential Spectrum of Kasami Power Permutations Over Odd Characteristic Finite Fields. 6819-6826 - So Hirai, Kenji Yamanishi:
Correction to Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering. 6827-6828
Volume 65, Number 11, November 2019
- Constantinos Daskalakis, Nishanth Dikkala, Gautam Kamath:
Testing Ising Models. 6829-6852 - Bruce E. Hajek, Suryanarayana Sankagiri:
Community Recovery in a Preferential Attachment Graph. 6853-6874 - Wolfgang König, András Tóbiás:
Routeing Properties in a Gibbsian Model for Highly Dense Multihop Networks. 6875-6897 - Yibin Sheng, Zhongzhi Zhang:
Low-Mean Hitting Time for Random Walks on Heterogeneous Networks. 6898-6910 - Michal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem:
The Simultaneous Connectivity of Cognitive Networks. 6911-6930 - Shanxiang Lyu, Antonio Campello, Cong Ling:
Ring Compute-and-Forward Over Block-Fading Channels. 6931-6949 - Mahdi Cheraghchi, João Ribeiro:
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. 6950-6974 - Annina Bracher, Eran Hof, Amos Lapidoth:
Guessing Attacks on Distributed-Storage Systems. 6975-6998 - Shirin Saeedi Bidokhti, Michèle A. Wigger, Aylin Yener:
Benefits of Cache Assignment on Degraded Broadcast Channels. 6999-7019 - Keerthi Suria Kumar Arumugam, Matthieu R. Bloch:
Covert Communication Over a K-User Multiple-Access Channel. 7020-7044 - Filip Paluncic, Bodhaswar T. Maharaj, Hendrik C. Ferreira:
Variable- and Fixed-Length Balanced Runlength-Limited Codes Based on a Knuth-Like Balancing Method. 7045-7066 - Guangkui Xu, Longjiang Qu:
Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic. 7067-7078 - Chin Hei Chan, Maosheng Xiong:
On the Complete Weight Distribution of Subfield Subcodes of Algebraic-Geometric Codes. 7079-7086 - Xudong Li, Liming Ma, Chaoping Xing:
Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields. 7087-7094 - Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Yuchong Hu, Hui Li:
A New Design of Binary MDS Array Codes With Asymptotically Weak-Optimal Repair. 7095-7113 - Wei Wu, Paul H. Siegel:
Generalized Partial Orders for Polar Code Bit-Channels. 7114-7130 - Dina Goldin, David Burshtein:
Performance Bounds of Concatenated Polar Coding Schemes. 7131-7148 - Walid Hachem, Adrien Hardy, Shlomo Shamai:
Mutual Information of Wireless Channels and Block-Jacobi Ergodic Operators. 7149-7167 - Jiang Hu, Weiming Li, Wang Zhou:
Central Limit Theorem for Mutual Information of Large MIMO Systems With Elliptically Correlated Channels. 7168-7180 - Arash Gholami Davoodi, Syed Ali Jafar:
Optimality of Simple Layered Superposition Coding in the 3 User MISO BC With Finite Precision CSIT. 7181-7207 - Hamdi Joudeh, Bruno Clerckx:
On the Optimality of Treating Inter-Cell Interference as Noise in Uplink Cellular Networks. 7208-7232 - Silas L. Fong, Jing Yang, Aylin Yener:
Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort. 7233-7252 - Borna Kananian, Mohammad Ali Maddah-Ali, Babak Hossein Khalaj:
K-User Interference Channels With Backhaul Cooperation: DoF vs. Backhaul Load Trade-Off. 7253-7267 - Abla Kammoun, Luca Sanguinetti, Mérouane Debbah, Mohamed-Slim Alouini:
Asymptotic Analysis of RZF in Large-Scale MU-MIMO Systems Over Rician Channels. 7268-7286 - Minqi Shen, Anders Høst-Madsen:
The Wideband Slope of Interference Channels: The Small Bandwidth Case. 7287-7303 - Peter Hinz, Sara A. van de Geer:
A Framework for the Construction of Upper Bounds on the Number of Affine Linear Regions of ReLU Feed-Forward Neural Networks. 7304-7324 - Mohamed Adel Attia, Ravi Tandon:
Near Optimal Coded Data Shuffling for Distributed Learning. 7325-7349 - Yining Wang, Sivaraman Balakrishnan, Aarti Singh:
Optimization of Smooth Functions With Noisy Observations: Local Minimax Rates. 7350-7366 - Yanting Ma, Cynthia Rush, Dror Baron:
Analysis of Approximate Message Passing With Non-Separable Denoisers and Markov Random Field Priors. 7367-7389 - Wei-Ning Chen, I-Hsiang Wang:
Anonymous Heterogeneous Distributed Detection: Optimal Decision Rules, Error Exponents, and the Price of Anonymity. 7390-7406 - Farah Cherfaoui, Valentin Emiya, Liva Ralaivola, Sandrine Anthoine:
Recovery and Convergence Rate of the Frank-Wolfe Algorithm for the m-Exact-Sparse Problem. 7407-7414 - Yanjun Li, Yoram Bresler:
Multichannel Sparse Blind Deconvolution on the Sphere. 7415-7436 - Dong Xia:
Confidence Region of Singular Subspaces for Low-Rank Matrix Regression. 7437-7459 - Zhaoqiang Liu, Vincent Y. F. Tan:
The Informativeness of k-Means for Learning Mixture Models. 7460-7479 - Giovanni Alberti, Helmut Bölcskei, Camillo De Lellis, Günther Koliander, Erwin Riegler:
Lossless Analog Compression. 7480-7513 - Sinem Unal, Aaron B. Wagner:
LP Bounds for Rate-Distortion With Variable Side Information. 7514-7532 - Cunsheng Ding, Akihiro Munemasa, Vladimir D. Tonchev:
Bent Vectorial Functions, Codes and Designs. 7533-7541 - Kangquan Li, Longjiang Qu, Bing Sun, Chao Li:
New Results About the Boomerang Uniformity of Permutation Polynomials. 7542-7553 - Samir Hodzic, Enes Pasalic, WeiGuo Zhang:
Generic Constructions of Five-Valued Spectra Boolean Functions. 7554-7565 - Siddhartha Das, Mark M. Wilde:
Quantum Reading Capacity: General Definition and Bounds. 7566-7583 - Seth Lloyd, Peter W. Shor, Kevin Thompson:
Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel. 7584-7595 - Frédéric Dupuis, Omar Fawzi:
Entropy Accumulation With Improved Second-Order Term. 7596-7612 - Chao Tian, Hua Sun, Jun Chen:
Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost. 7613-7627 - Karim Banawan, Sennur Ulukus:
Asymmetry Hurts: Private Information Retrieval Under Asymmetric Traffic Constraints. 7628-7645 - Beongjun Choi, Jy-yong Sohn, Sung Whan Yoon, Jaekyun Moon:
Secure Clustered Distributed Storage Against Eavesdropping. 7646-7668
Volume 65, Number 12, December 2019
- Maiara F. Bollauf, Ram Zamir, Sueli I. R. Costa:
Multilevel Constructions: Coding, Packing and Geometric Uniformity. 7669-7681 - Ryan Gabrys, Olgica Milenkovic:
Unique Reconstruction of Coded Strings From Multiset Substring Spectra. 7682-7696 - Nicolas Aragon, Philippe Gaborit, Adrien Hauteville, Olivier Ruatta, Gilles Zémor:
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography. 7697-7717 - Hermann Tchatchiem Kamche, Christophe Mouaha:
Rank-Metric Codes Over Finite Principal Ideal Rings and Applications. 7718-7735 - Ángel Luis Muñoz Castañeda, José Maria Muñoz Porras, Francisco J. Plaza Martín:
Rosenthal's Decoding Algorithm for Certain 1-Dimensional Convolutional Codes. 7736-7741 - Tianqiong Luo, Vaneet Aggarwal, Borja Peleato:
Coded Caching With Distributed Storage. 7742-7755 - Saeid Sahraei, Pierre Quinton, Michael Gastpar:
The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement. 7756-7770 - N. Prakash, V. Lalitha, Balaji Srinivasan Babu, P. Vijay Kumar:
Codes With Locality for Two Erasures. 7771-7789 - Umberto Martínez-Peñas, Frank R. Kschischang:
Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes. 7790-7805 - Justin Kong:
Ulam Ball Size Analysis for Permutation and Multipermutation Codes Correcting Translocation Errors. 7806-7828 - Yang Liu, Ruihu Li, Guanmin Guo, Junli Wang:
Some Nonprimitive BCH Codes and Related Quantum Codes. 7829-7839 - Weijun Fang, Fang-Wei Fu:
Some New Constructions of Quantum MDS Codes. 7840-7847 - Anuradha Sharma, Tania Sidana:
On b-Symbol Distances of Repeated-Root Constacyclic Codes. 7848-7867 - Hikmet Yildiz, Babak Hassibi:
Optimum Linear Codes With Support-Constrained Generator Matrices Over Small Fields. 7868-7875 - Dabin Zheng, Mu Yuan, Nian Li, Lei Hu, Xiangyong Zeng:
Constructions of Involutions Over Finite Fields. 7876-7883 - Sihem Mesnager, Longjiang Qu:
On Two-to-One Mappings Over Finite Fields. 7884-7895 - Ali Bereyhi, Ralf R. Müller, Hermann Schulz-Baldes:
Statistical Mechanics of MAP Estimation: General Replica Ansatz. 7896-7934 - Holger Boche, Ullrich J. Mönich:
Tone Reservation for OFDM With Restricted Carrier Set. 7935-7949 - Vladislav Z. B. Tadic, Arnaud Doucet:
Analyticity of Entropy Rates of Continuous-State Hidden Markov Models. 7950-7975 - Soham Jana, Ayanendranath Basu:
A Characterization of All Single-Integral, Non-Kernel Divergence Estimators. 7976-7984 - Mohammad Mahdi Mojahedian, Salman Beigi, Amin Gohari, Mohammad Hossein Yassaee, Mohammad Reza Aref:
A Correlation Measure Based on Vector-Valued Lp-Norms. 7985-8004 - Shirin Jalali, Xin Yuan:
Snapshot Compressed Sensing: Performance Bounds and Algorithms. 8005-8024 - Hao Wang, Lisa Vo, Flávio P. Calmon, Muriel Médard, Ken R. Duffy, Mayank Varia:
Privacy With Estimation Guarantees. 8025-8042 - Jiachun Liao, Oliver Kosut, Lalitha Sankar, Flávio du Pin Calmon:
Tunable Measures for Information Leakage and Applications to Privacy-Utility Tradeoffs. 8043-8066 - Jingbo Liu, Mohammad Hossein Yassaee, Sergio Verdú:
Sharp Bounds for Mutual Covering. 8067-8083 - Axel Flinth, Sandra Keiper:
Recovery of Binary Sparse Signals With Biased Measurement Matrices. 8084-8094 - I Eli Chien, Chung-Yi Lin, I-Hsiang Wang:
On the Minimax Misclassification Ratio of Hypergraph Community Detection. 8095-8118 - Aditya Siripuram, William Wu, Brad Osgood:
Discrete Sampling: A Graph Theoretic Approach to Orthogonal Interpolation. 8119-8130 - Asger Kjærulff Jensen:
Asymptotic Majorization of Finite Probability Distributions. 8131-8139 - Roy Timo, Badri N. Vellambi, Alex J. Grant, Khoa D. Nguyen:
Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels. 8140-8163 - Neri Merhav:
Error Exponents of Typical Random Codes for the Colored Gaussian Channel. 8164-8179 - Ohad Elishco, Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
The Entropy Rate of Some Pólya String Models. 8180-8193 - Ryo Nomura:
Overflow Probability of Variable-Length Codes With Codeword Cost. 8194-8206 - Stephan Foldes, Douglas Stott Parker, Sándor Radeleczki:
The Meet Operation in the Imbalance Lattice of Maximal Instantaneous Codes: Alternative Proof of Existence. 8207-8212 - Ryo Nomura, Hideki Yagi:
Optimum Overflow Thresholds in Variable-Length Source Coding Allowing Non-Vanishing Error Probability. 8213-8221 - Yi-Peng Wei, Karim Banawan, Sennur Ulukus:
The Capacity of Private Information Retrieval With Partially Known Private Side Information. 8222-8231 - Karim Banawan, Sennur Ulukus:
Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval. 8232-8249 - Ali Haghi, Neda Mohammadizadeh, Amir K. Khandani:
Delay in Cooperative Communications: Achieving Higher Multiplexing Gain in Gaussian Interference Channels With Full-Duplex Transmitters. 8250-8272 - Xiaojun Yuan, Haiyang Xin, Soung Chang Liew, Yong Li:
Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within ½ Bit. 8273-8304 - Yoshiaki Inoue, Hiroyuki Masuyama, Tetsuya Takine, Toshiyuki Tanaka:
A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues. 8305-8324 - Ashwin Jha, Cuauhtemoc Mancillas-López, Mridul Nandi, Sourav Sen Gupta:
On Random Read Access in OCB. 8325-8344 - Konstantinos Limniotis, Nicholas Kolokotronis:
The Error Linear Complexity Spectrum as a Cryptographic Criterion of Boolean Functions. 8345-8356
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 2025-02-20 19:46 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:
