default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2018: Vail, CO, USA
- 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018. IEEE 2018, ISBN 978-1-5386-4781-3
- Wentu Song, Kui Cai:
Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices. 1-5 - Christian Senger, Rohit Bohara
:
A Linear Algebraic Approach to Subfield Subcodes of GRS Codes. 6-10 - Jiongyue Xing, Li Chen, Martin Bossert:
Progressive Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization. 11-15 - Hikmet Yildiz, Babak Hassibi:
Further Progress on the GM-MDS Conjecture for Reed-Solomon Codes. 16-20 - Yaniv Fogel, Meir Feder:
Universal Batch Learning with Log-Loss. 21-25 - Zhaoqiang Liu, Vincent Y. F. Tan:
The Informativeness of k-Means for Learning Mixture Models. 26-30 - Zhinus Marzi, Soorya Gopalakrishnan, Upamanyu Madhow, Ramtin Pedarsani:
Sparsity-based Defense Against Adversarial Attacks on Linear Classifiers. 31-35 - Akshay Rangamani, Anirbit Mukherjee, Amitabh Basu, Ashish Arora, Tejaswini Ganapathi, Sang (Peter) Chin, Trac D. Tran:
Sparse Coding and Autoencoders. 36-40 - Ratheesh Kumar Mungara, Giuseppe Caire, Ozgun Y. Bursalioglu, Chenwei Wang, Haralabos C. Papadopoulos:
Fog Massive MIMO with On-the-Fly Pilot Contamination Control. 41-45 - Chang-Sik Choi, François Baccelli:
Coverage Analysis in Cellular Networks with Planar and Vehicular Base Stations. 46-50 - Saeede Enayati, Hamid Saeedi, Hossein Pishro-Nik:
Trajectory Processes that Preserve Uniformity: A Stochastic Geometry Perspective. 51-55 - Ahmad AlAmmouri, Jeffrey G. Andrews, François Baccelli:
Asymptotic Analysis of Area Spectral Efficiency in Dense Cellular Networks. 56-60 - Junhan Kim, Byonghyo Shim:
Multiple Orthogonal Least Squares for Joint Sparse Recovery. 61-65 - Xiao-Wen Chang, Victor Jukic Prevost:
Success Probability of a Suboptimal Solution to the Sparse MAP Detection. 66-70 - Alon Kipnis, Galen Reeves, Yonina C. Eldar:
Single Letter Formulas for Quantized Compressed Sensing with Gaussian Codebooks. 71-75 - Weiyu Xu, Jirong Yi, Soura Dasgupta, Jian-Feng Cai, Mathews Jacob, Myung Cho:
Sep]ration-Free Super-Resolution from Compressed Measurements is Possible: an Orthonormal Atomic Norm Minimization Approach. 76-80 - Manabu Hagiwara, Justin Kong:
Descent Moment Distributions for Permutation Deletion Codes via Levenshtein Codes. 81-85 - Tomohiro Hayashi, Kenji Yasunaga:
On the List Decodability of Insertions and Deletions. 86-90 - Mahed Abroshan, Ramji Venkataramanan, Albert Guillén i Fàbregas:
Efficient Systematic Encoding of Non-binary VT Codes. 91-95 - Yeow Meng Chee, Han Mao Kiah, Alexander Vardy, Van Khu Vu, Eitan Yaakobi:
Codes Correcting Limited-Shift Errors in Racetrack Memories. 96-100 - Erwin Riegler, Helmut Bölcskei, Günther Koliander:
Rate-Distortion Theory for General Sets and Measures. 101-105 - Xiaoqing Fan, Aaron B. Wagner:
Variable Packet-Error Coding: the Point-to-Point Case. 106-110 - Mari Kobayashi, Giuseppe Caire, Gerhard Kramer:
Joint State Sensing and Communication: Optimal Tradeoff for a Memoryless Case. 111-115 - Mustafa Sungkar, Toby Berger:
Discrete Reconstruction Alphabets in Discrete Memoryless Source Rate-Distortion Problems. 116-120 - Ziv Goldfeld, Haim H. Permuter:
A Useful Analogy Between Wiretap and Gelfand - Pinsker Channels. 121-125 - Jake B. Perazzone, Eric Graves, Paul L. Yu, Rick S. Blum:
Inner Bound for the Capacity Region of Noisy Channels with an Authentication Requirement. 126-130 - Hao Wang, Berk Ustun, Flávio P. Calmon:
On the Direction of Discrimination: An Information-Theoretic Analysis of Disparate Impact in Machine Learning. 126-130 - Chong Li, Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
A Coding Scheme for Colored Gaussian Wiretap Channels with Feedback. 131-135 - Alexander Bunin, Ziv Goldfeld, Haim H. Permuter, Shlomo Shamai, Paul Cuff, Pablo Piantanida:
Key-Message Security over State-Dependent Wiretap Channels. 136-140 - Pradeep Kr. Banerjee, Johannes Rauh, Guido Montúfar:
Computing the Unique Information. 141-145 - Yuta Sakai, Ken-ichi Iwata:
Dynamic Programming Approach of Optimal Upgradation Algorithm for an Auxiliary Random Variable of a Bernoulli Random Variable. 146-150 - Badri N. Vellambi, Jörg Kliewer:
New Results on the Equality of Exact and Wyner Common Information Rates. 151-155 - Lei Yu, Vincent Y. F. Tan:
Wyner's Common Information under Renyi Divergence Measures. 156-160 - Jun Chen, Li Xie, Yameng Chang, Jia Wang, Yizhong Wang:
Symmetric Generalized Gaussian Multiterminal Source Coding. 161-165 - Pierre Escamilla, Michèle A. Wigger, Abdellatif Zaidi:
Distributed Hypothesis Testing with Concurrent Detections. 166-170 - Omer Bilgen, Aaron B. Wagner:
The Quadratic Gaussian One-Help-Two Source-Coding Problem with Markovity. 171-175 - AmirEmad Ghassami, Sajad Khodadadian, Negar Kiyavash:
Fairness in Supervised Learning: An Information Theoretic Approach. 176-180 - Sreejith Sreekumar, Deniz Gündüz:
Testing Against Conditional Independence Under Security Constraints. 181-185 - Mehrdad Showkatbakhsh, Can Karakus, Suhas N. Diggavi:
Privacy-Utility Trade-off of Linear Regression under Random Projections and Additive Noise. 186-190 - Philipp Walk, Urbashi Mitra:
Physical Layer Secure Communications over Wireless Channels via Common Zeros. 191-195 - Gaurav Kumar Agarwal, Yahya H. Ezzeldin, Christina Fragouli, Martina Cardone:
Secure Communication over 1-2-1 Networks. 196-200 - Mohamed Seif, Ravi Tandon, Ming Li:
On the Secure Degrees of Freedom of the K-user Interference Channel with Delayed CSIT. 201-205 - Yanina Shkel, Maxim Raginsky, Sergio Verdú:
Universal Compression, List Decoding, and Logarithmic Loss. 206-210 - Changlong Wu, Maryam Hosseini, Narayana Santhanam:
Redundancy of Unbounded Memory Markov Classes with Continuity Conditions. 211-215 - Kedar Tatwawadi, Jiantao Jiao, Tsachy Weissman:
Minimax Redundancy for Markov Chains with Large State Space. 216-220 - Farhad Shirani, Siddharth Garg, Elza Erkip:
Typicality Matching for Pairs of Correlated Graphs. 221-225 - Sergey Tridenski, Ram Zamir:
Channel Input Adaptation via Natural Type Selection. 226-230 - Robert Graczyk, Amos Lapidoth:
Variations on the Guessing Problem. 231-235 - Niranjana Ambadi:
Multicast Networks Solvable over Every Finite Field. 236-240 - Tuvi Etzion, Hui Zhang:
Grassmannian Codes with New Distance Measures for Network Coding. 241-245 - Kai Cai, Guangyue Han:
On the Langberg-Médard k-Unicast Conjecture with $k=3, 4$. 246-250 - Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor:
Superadditivity in Trade-Off Capacities of Quantum Channels. 251-255 - Holger Boche, Rafael F. Schaefer, H. Vincent Poor:
Identification over Channels with Feedback: Discontinuity Behavior and Super-Activation. 256-260 - Yuuya Yoshida, Masahito Hayashi:
Asymptotically Decoupling and Mixing Properties in Quantum System. 261-265 - Jiange Li, Muriel Médard:
Boolean Functions: Noise Stability, Non-Interactive Correlation, and Mutual Information. 266-270 - Nir Weinberger, Ofer Shayevitz:
Guessing with a Boolean Helper. 271-275 - Nir Weinberger, Ofer Shayevitz:
Self-Predicting Boolean Functions. 276-280 - Meysam Asadi, Kenneth Palacio-Baus, Natasha Devroye:
A Relaying Graph and Special Strong Product for Zero-Error Problems in Primitive Relay Channels. 281-285 - Carol Wang, Mladen Kovacevic, Vincent Y. F. Tan:
Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback. 286-290 - Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Separable Codes for the Symmetric Multiple-Access Channel. 291-295 - Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier R. Fonollosa:
One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels. 296-300 - Ajay Mohanan, Aswin Rajagopalan, Andrew Thangaraj:
Dual Capacity Upper Bounds for Binary-input ISI and Constrained BIBO Channels. 301-305 - Erixhen Sula, Michael Gastpar, Gerhard Kramer:
Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels with Feedback. 306-310 - S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke:
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. 311-315 - Elad Domanovitz, Uri Erez:
Diversity Combining via Universal Dimension-Reducing Space-Time Transformations. 316-320 - Sung-En Chiu, Anusha Lalitha, Tara Javidi:
Bit-wise Sequential Coding with Feedback. 321-325 - Jayadev Acharya, Yelun Bao, Yuheng Kang, Ziteng Sun:
Improved Bounds for Minimax Risk of Estimating Missing Mass. 326-330 - Sara Shahi, Daniela Tuninetti, Natasha Devroye:
On Identifying a Massive Number of Distributions. 331-335 - Ayush Bhandari, Felix Krahmer, Ramesh Raskar:
Unlimited Sampling of Sparse Sinusoidal Mixtures. 336-340 - Daewon Seo, Avhishek Chatterjee, Lav R. Varshney:
On Multiuser Systems with Queue-Length Dependent Service Quality. 341-345 - Tao Guo, Raymond W. Yeung:
The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding. 346-350 - Marco Mondelli, S. Hamed Hassani, Rüdiger L. Urbanke:
A New Coding Paradigm for the Primitive Relay Channel. 351-355 - Jonathan Ponniah, Liang-Liang Xie:
A Multi-Hop Framework for Multi-Source Multi-Relay All-Cast Channels. 356-360 - Simon Mak, Yao Xie:
Maximum Entropy Low-Rank Matrix Recovery. 361-365 - Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Low Permutation-Rank Matrices: Structural Properties and Noisy Completion. 366-370 - Mohammadreza Soltani, Chinmay Hegde:
Fast Low-Rank Matrix Estimation for Ill-Conditioned Matrices. 371-375 - Praneeth Narayanamurthy, Namrata Vaswani:
Provable Dynamic Robust PCA or Robust Subspace Tracking. 376-380 - Saeid Haghighatshoar, Peter Jung, Giuseppe Caire:
Improved Scaling Law for Activity Detection in Massive MIMO Systems. 381-385 - Saeid Haghighatshoar, Mahdi Barzegar Khalilsarai, Giuseppe Caire:
Multi-Band Covariance Interpolation with Applications in Massive MIMO. 386-390 - Thomas L. Marzetta:
Spatially-Stationary Propagating Random Field Model for Massive MIMO Small-Scale Fading. 391-395 - Jiwook Choi, Namyoon Lee, Song-Nam Hong, Giuseppe Caire:
Joint User Scheduling, Power Allocation, and Precoding Design for Massive MIMO Systems: A Principal Component Analysis Approach. 396-400 - Toshiyuki Tanaka:
Performance Analysis of L1-Norm Minimization for Compressed Sensing with Non-Zero-Mean Matrix Elements. 401-405 - K. Pavan Srinath, Ramji Venkataramanan:
Empirical Bayes Estimators for Sparse Sequences. 406-410 - Tom Morgan, Jelani Nelson:
A Note on Reductions Between Compressed Sensing Guarantees. 411-415 - Shirin Jalali, Xin Yuan:
Compressive Imaging Via One-Shot Measurements. 416-420 - Jin Sima, Netanel Raviv, Jehoshua Bruck:
Two Deletion Correcting Codes from Indicator Vectors. 421-425 - Ryan Gabrys, Frederic Sala:
Codes Correcting Two Deletions. 426-430 - Khodakhast Bibak, Olgica Milenkovic:
Weight Enumerators of Some Classes of Deletion Correcting Codes. 431-435 - Sundara Rajan Srinivasavaradhan, Michelle Du, Suhas N. Diggavi, Christina Fragouli:
On Maximum Likelihood Reconstruction over Multiple Deletion Channels. 436-440 - Suman Ghosh, Lakshmi Prasad Natarajan:
Linear Codes for Broadcasting with Noisy Side Information: Bounds and Code Constructions. 441-445 - Lakshmi Prasad Natarajan, Prasad Krishnan, V. Lalitha:
On Locally Decodable Index Codes. 446-450 - Yu-Chih Huang, Yi Hong, Emanuele Viterbo, Lakshmi Prasad Natarajan:
Layered Space- Time Index Coding. 451-455 - Yucheng Liu, Parastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim:
Simplified Composite Coding for Index Coding. 456-460 - Uzi Pereg, Yossef Steinberg:
The Arbitrarily Varying Relay Channel. 461-465 - Dan He, Yuan Luo, Wangmei Guo:
Arbitrarily Varying Wiretap Channel: a New Scheme for the Proof of Strong Secrecy. 466-470 - Fatemeh Hosseinigoki, Oliver Kosut:
Capacity of the Gaussian Arbitrarily-Varying Channel with List Decoding. 471-475 - Remi A. Chou:
Explicit Codes for the Wiretap Channel with Uncertainty on the Eavesdropper's Channel. 476-480 - Daniel Rohweder, Jürgen Freudenberger, Sergo Shavgulidze:
Low-Density Parity-Check Codes over Finite Gaussian Integer Fields. 481-485 - Sunghye Cho, Kyungwhoon Cheun, Kyeongcheol Yang:
A Message-Passing Algorithm for Counting Short Cycles in Nonbinary LDPC Codes. 486-490 - Po-Chun Yang, Chung-Hsuan Wang, Chi-Chao Chao:
Rank Analysis of Parity-Check Matrices for Quasi-Cyclic LDPC Codes. 491-495 - Arti D. Yardi, Iryna Andriyanova, Charly Poulliat:
EBP-GEXIT Charts Over the Binary-Input AWGN Channel for Generalized and Doubly-Generalized LDPC Codes. 496-500 - Anshuka Rangi, Massimo Franceschetti, Stefano Maranò:
Decentralized Chernoff Test in Sensor Networks. 501-505 - Yanjun Han, Pritam Mukherjee, Ayfer Özgür, Tsachy Weissman:
Distributed Statistical Estimation of High-Dimensional and Nonparametric Distributions. 506-510 - Uri Hadar, Ofer Shayevitz:
Distributed Estimation of Gaussian Correlations. 511-515 - Anit Kumar Sahu, Dusan Jakovetic, Soummya Kar:
CREDO: A Communication-Efficient Distributed Estimation Algorithm. 516-520 - Or Ordentlich, Yury Polyanskiy:
Entropy Under Additive Bernoulli and Spherical Noises. 521-525 - Georg Pichler, Günther Koliander:
Information Bottleneck on General Alphabets. 526-530 - Hsiang Hsu, Shahab Asoodeh, Salman Salamatian, Flávio P. Calmon:
Generalizing Bottleneck Problems. 531-535 - Xiaoke Yang, Khalil Elkhalil, Abla Kammoun, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini:
Regularized Discriminant Analysis: A Large Dimensional Study. 536-540 - Cheuk Ting Li, Xiugang Wu, Ayfer Özgür, Abbas El Gamal:
Minimax Learning for Remote Prediction. 541-545 - Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Generalization Error Bounds for Noisy, Iterative Algorithms. 546-550 - Arpan Chattopadhyay, Urbashi Mitra:
Optimal Active Sensing for Process Tracking. 551-555 - Wasim Huleihel, Ziv Goldfeld, Tobias Koch, Mokshay M. Madiman, Muriel Médard:
Design of Discrete Constellations for Peak-Power-Limited complex Gaussian Channels. 556-560 - Emmanuel Abbe, João M. Pereira, Amit Singer:
Estimation in the Group Action Channel. 561-565 - Igal Sason, Sergio Verdú:
Improved Bounds on Guessing Moments via Rényi Measures. 566-570 - Atin Gayen, M. Ashok Kumar:
Generalized Estimating Equation for the Student-t Distributions. 571-575 - Ibrahim Issa, Michael Gastpar:
Computable Bounds on the Exploration Bias. 576-580 - Yasutada Oohama, Bagus Santoso:
Information Theoretical Analysis of Side-Channel Attacks to the Shannon Cipher System. 581-585 - Dawei Ding, Saikat Guha:
Noisy Feedback and Loss Unlimited Private Communication. 586-590 - Gowtham R. Kurri, Vinod M. Prabhakaran, Jithin Ravi:
The Role of Interaction and Common Randomness in Two-User Secure Computation. 591-595 - Varun Narayanan, Vinod M. Prabhakaran, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani:
Private Index Coding. 596-600 - Mahesh Babu Vaddi, B. Sundar Rajan:
A New Upperbound on the Broadcast Rate and Near-Optimal Vector Linear Codes for Index Coding Problems with Symmetric Neighboring Interference. 601-605 - Mahesh Babu Vaddi, B. Sundar Rajan:
On the Conjectures on Optimality of Index Codes from Interlinked Cycle Cover Scheme. 606-610 - Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. 611-615 - Amitalok J. Budkuley, Sidharth Jaggi:
Communication over an Arbitrarily Varying Channel under a State-Myopic Encoder. 616-620 - Tongxin Li, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Quadratically Constrained Channels with Causal Adversaries. 621-625 - Paulo Ricardo Branco da Silva, Danilo Silva:
Low-Complexity Multilevel LDPC Lattices and a a Generalization of Construction $\mathrm{D}^{\prime}$. 626-630 - Ahmad Golmohammadi, David G. M. Mitchell:
Concatenated Spatially Coupled LDPC Codes for Joint Source-Channel Coding. 631-635 - Qin Huang, Liyuan Song, Zulin Wang:
Construction of Multiple-Burst-Correction Codes in Transform Domain. 636-640 - Namrata Vaswani, Praneeth Narayanamurthy:
PCA in Sparse Data-Dependent Noise. 641-645 - Shuai Zhang, Meng Wang:
Correction of Simultaneous Bad Measurements by Exploiting the Low-rank Hankel Structure. 646-650 - Daniel Cullina, Prateek Mittal, Negar Kiyavash:
Fundamental Limits of Database Alignment. 651-655 - Hayoung Choi, Yifei Shen, Yuanming Shi:
Comparing Massive Networks via Moment Matrices. 656-660 - Xuming Song, Hayoung Choi, Yuanming Shi:
Permuted Linear Model for Header-Free Communication via Symmetric Polynomials. 661-665 - Jialin Dong, Yuanming Shi:
Nonconvex Demixing from Bilinear Measurements. 666-670 - Ken R. Duffy, Jiange Li, Muriel Médard:
Guessing noise, not code-words. 671-675 - Yunus Can Gultekin, Frans M. J. Willems, Wim J. van Houtum, Semih Serbetli:
Approximate Enumerative Sphere Shaping. 676-680 - Hye Won Chung, Ji Oon Lee, Alfred O. Hero III:
Fundamental Limits on Data Acquisition: Trade-offs Between Sample Complexity and Query Difficulty. 681-685 - Jinming Wen:
Some Properties of Successive Minima and Their Applications. 686-690 - Lei Yu:
Maximal Guessing Coupling and Its Applications. 691-695 - Arun Padakandla, P. R. Kumar, Wojciech Szpankowski:
Preserving Privacy and Fidelity via Ehrhart Theory. 696-700 - Jiachun Liao, Oliver Kosut, Lalitha Sankar, Flávio P. Calmon:
A Tunable Measure for Information Leakage. 701-705 - Hao Wang, Mario Díaz, Flávio P. Calmon, Lalitha Sankar:
The Utility Cost of Robust Privacy Guarantees. 706-710 - Malihe Aliasgari, Jörg Kliewer, Osvaldo Simeone:
Coded Computation Against Straggling Decoders for Network Function Virtualization. 711-715 - Adel M. Elmahdy, Soheil Mohajer:
On the Fundamental Limits of Coded Data Shuffling. 716-720 - Mohamed Adel Attia, Ravi Tandon:
Approximately Optimal Distributed Data Shuffling. 721-725 - Nicholas Woolsey, Rong-Rong Chen, Mingyue Ji:
A New Combinatorial Design of Coded Distributed Computing. 726-730 - Badri N. Vellambi, Marcus Hutter:
Convergence of Binarized Context-tree Weighting for Estimating Distributions of Stationary Sources. 731-735 - Tommaso Catuogno, Menelaos Ralli Camara, Marco Secondini:
Non-parametric Estimation of Mutual Information with Application to Nonlinear Optical Fibers. 736-740 - Neri Merhav:
Lower Bounds on Exponential Moments of the Quadratic Error in Parameter Estimation. 741-745 - M. Ashok Kumar, Kumar Vijay Mishra:
Information Geometric Approach to Bayesian Lower Error Bounds. 746-750 - Hua Sun:
The Capacity of Anonymous Communications. 751-755 - Ligong Wang:
The Continuous-Time Poisson Channel Has Infinite Covert Communication Capacity. 756-760 - Jianhan Song, Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi, Swanand Kadhe:
Multipath Stealth Communication with Jammers. 761-765 - Keerthi Suria Kumar Arumugam, Matthieu R. Bloch, Ligong Wang:
Covert Communication over a Physically Degraded Relay Channel with Non-Colluding Wardens. 766-770 - Thomas Varela Santana, Richard Combes, Mari Kobayashi:
Device-to-Device Aided Multicasting. 771-775 - Kobi Cohen, Amir Leshem:
Density-Based Multiple Access for Detection in Wireless Sensor Networks. 776-780 - Alireza Vahid, A. Robert Calderbank:
ARQ for Interference Packet Networks. 781-785 - Jinfeng Du, Muriel Médard, Shlomo Shamai Shitz:
Cost of Path Loss and Local Cooperation in Capacity Scaling of Extended Wireless Networks. 786-790 - Narayanan Rengaswamy, A. Robert Calderbank, Henry D. Pfister, Swanand Kadhe:
Synthesis of Logical Clifford Operators via Symplectic Geometry. 791-795 - Andrew Nemec, Andreas Klappenecker:
Hybrid Codes. 796-800 - Tejas Gandhi:
A new construction of Quantum Error Correcting codes based on Difference Set. 801-805 - Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao:
Expected Communication Cost of Distributed Quantum Tasks. 806-810 - Wei Liu, Rüdiger L. Urbanke:
The Stability Condition of LDPC Codes Under MAP Decoding. 811-815 - Ji Zhang, Baoming Bai, Dixia Deng, Min Zhu, Hengzhou Xu, Mengsheng Guan:
Non-Uniform Spatially-Coupled LDPC Codes over GF(2m). 816-820 - Anxiao Jiang:
Elimination of Cyclic Stopping Sets for Enhanced Decoding of LDPC Codes. 821-825 - Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets. 826-830 - Mohammed Karmoose, Linqi Song, Martina Cardone, Christina Fragouli:
Privacy in Index Coding: Improved Bounds and Coding Schemes. 831-835 - Wangmei Guo, Dan He, Ning Cai:
Network Error Correction Coding for Time-Varying Adversarial Errors in a Unicast Network. 836-840 - Lawrence Ong, Jörg Kliewer, Badri N. Vellambi:
Secure Network-Index Code Equivalence: Extension to Non-zero Error and Leakage. 841-845 - Debaditya Chaudhuri, Michael Langberg:
Trade-offs between Rate and Security in Linear Multicast Network Coding. 846-850 - Boaz Shuval, Ido Tal:
Fast Polarization for Processes with Memory. 851-855 - Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels. 856-860 - Xiaowei Wu, Lei Yang, Jinhong Yuan:
Information Coupled Polar Codes. 861-865 - Morteza Varasteh, Borzoo Rassouli, Hamdi Joudeh, Bruno Clerckx:
SWIPT Signalling over Complex AWGN Channels with Two Nonlinear Energy Harvester Models. 866-870 - Silas L. Fong, Jing Yang, Aylin Yener:
Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit. 871-875 - Baran Tan Bacinoglu, Yin Sun, Elif Uysal-Biyikoglu, Volkan Mutlu:
Achieving the Age-Energy Tradeoff with a Finite-Battery Energy Harvesting Source. 876-880 - Shota Saito, Toshiyasu Matsushima:
Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression Allowing Positive Excess Distortion Probability. 881-885 - Ni Ding, David Smith, Thierry Rakotoarivelo, Parastoo Sadeghi:
Fairness in Multiterminal Data Compression: Decomposition of Shapley Value. 886-890 - Kedar Tatwawadi, Shirin Saeedi Bidokhti, Tsachy Weissman:
On Universal Compression with Constant Random Access. 891-895 - Christoph Hirche, David Reeb:
Bounds on Information Combining with Quantum Side Information. 896-900 - Maxime Ferreira Da Costa, Wei Dai:
A Tight Converse to the Spectral Resolution Limit via Convex Programming. 901-905 - Siddharth Bhandari, Jaikumar Radhakrishnan:
Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel. 906-910 - Shraga I. Bross:
Causal Asymmetric State Communication Over the Degraded Broadcast Channel. 911-915 - Morteza Soltani, Zouheir Rezki:
The Capacity of the Optical Broadcast Channel with Peak and Average Intensity Constraints. 916-920 - Eric Graves, Tan F. Wong:
Transmitting Arbitrary Sources with Finite Error Over a Broadcast Channel with Confidential Communications. 921-925 - Tho Ngoc Le, Vijay G. Subramanian, Randall A. Berry:
Bayesian Learning with Random Arrivals. 926-930 - Zhili Feng, Po-Ling Loh:
Online Learning with Graph-Structured Feedback against Adaptive Adversaries. 931-935 - Amichai Painsky, Gregory W. Wornell:
On the Universality of the Logistic Loss Function. 936-940 - Jean-Pierre Tillich:
The Decoding Failure Probability of MDPC Codes. 941-945 - Peter Beelen, Martin Bossert, Sven Puchinger, Johan Rosenkilde:
Structural Properties of Twisted Reed-Solomon Codes with Applications to Cryptography. 946-950 - Paolo Santini, Marco Baldi, Giovanni Cancellieri, Franco Chiaraluce:
Hindering Reaction Attacks by Using Monomial Codes in the McEliece Cryptosystem. 951-955 - Yuchong Hu, Xiaoyang Zhang, Patrick P. C. Lee, Pan Zhou:
Generalized Optimal Storage Scaling via Network Coding. 956-960 - Vinay A. Vaishampayan:
Lattice Erasure Codes of Low Rank with Noise Margins. 961-965 - Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes. 966-970 - Karim A. Banawan, Sennur Ulukus:
Private Information Retrieval Through Wiretap Channel II. 971-975 - Fariborz Salehi, Ehsan Abbasi, Babak Hassibi:
A Precise Analysis of PhaseMax in Phase Retrieval. 976-980 - Matthieu Lequesne, Jean-Pierre Tillich:
Attack on the Edon-kKey Encapsulation Mechanism. 981-985 - Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo:
Minimum Guesswork with an Unreliable Oracle. 986-990 - Remi A. Chou:
Secret Sharing over a Public Channel from Correlated Random Variables. 991-995 - Li Gao, Marius Junge, Nicholas LaRacuente:
Uncertainty Principle for Quantum Channels. 996-1000 - Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Minimizing Queue Length Regret. 1001-1005 - Albert Cheu, Ravi Sundaram, Jonathan R. Ullman:
Skyline Identification in Multi-Arm Bandits. 1006-1010 - Amin Jalali, Zhi Ding:
A Joint Detection and Decoding Receiver Design for Polar Coded MIMO Wireless Transmissions. 1011-1015 - Kuan Hsieh, Cynthia Rush, Ramji Venkataramanan:
Spatially Coupled Sparse Regression Codes: Design and State Evolution Analysis. 1016-1020 - Satoshi Takabe, Yuta Ishimatsu, Tadashi Wadayama, Masahito Hayashi:
Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels. 1021-1025 - Laura Luzzi, Roope Vehkalahti:
The DMT Classification of Real and Quaternionic Lattice Codes. 1026-1030 - Germán Bassi, Mikael Skoglund, Pablo Piantanida:
Lossy Communication Subject to Statistical Parameter Privacy. 1031-1035 - Nazanin Takbiri, Amir Houmansadr, Dennis L. Goeckel, Hossein Pishro-Nik:
Privacy Against Statistical Matching: Inter-User Correlation. 1036-1040 - Kazuto Fukuchi, Jun Sakuma:
Minimax Optimal Additive Functional Estimation with Discrete Distribution: Slow Divergence Speed Case. 1041-1045 - Ajaykrishnan Nageswaran, Prakash Narayan:
Data Privacy for a ρ-Recoverable Function. 1046-1050 - Behrooz Tahmasebi, Abolfazl S. Motahari, Mohammad Ali Maddah-Ali:
On the Identifiability of Parameters in the Population Stratification Problem: A Worst-Case Analysis. 1051-1055 - Wei-Ning Chen, Ho-Chun Chen, I-Hsiang Wang:
On the Fundamental Limits of Heterogeneous Distributed Detection: Price of Anonymity. 1056-1060 - Dragana Bajovic, Dusan Jakovetic, Anit Kumar Sahu, Soummya Kar:
Large Deviations for Products of Non-I.i.d. Stochastic Matrices with Application to Distributed Detection. 1061-1065 - Nir Weinberger, Yuval Kochman:
On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection. 1066-1070 - Ayush Jain, Himanshu Tyagi:
Effective Memory Shrinkage in Estimation. 1071-1075 - Yi Hao, Alon Orlitsky:
Adaptive Estimation of Generalized Distance to Uniformity. 1076-1080 - Alex Dytso, H. Vincent Poor, Ronit Bustin, Shlomo Shamai:
On the Structure of the Least Favorable Prior Distributions. 1081-1085 - Marina Riabiz, Tohid Ardeshiri, Ioannis Kontoyiannis, Simon J. Godsill:
Sharp Gaussian Approximation Bounds for Linear Systems with $\alpha$ -stable Noise. 1086-1090 - Rajshekhar Vishweshwar Bhat, Mehul Motani, Teng Joon Lim:
Hybrid NOMA-TDMA for Multiple Access Channels with Non-Ideal Batteries and Circuit Cost. 1091-1095 - Elad Domanovitz, Uri Erez:
Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel. 1096-1100 - Huseyin A. Inan, Peter Kairouz, Ayfer Özgür:
Energy-limited Massive Random Access via Noisy Group Testing. 1101-1105 - Benjamin M. Zaidel, Ori Shental, Shlomo Shamai Shitz:
Sparse NOMA: A Closed-Form Characterization. 1106-1110 - Lan V. Truong, Vincent Y. F. Tan:
The Reliability Function of Lossy Source-Channel Coding of Variable-Length Codes with Feedback. 1111-1115 - Laure Aptel, Aslan Tchamkerten:
Feedback Increases the Capacity of Queues. 1116-1120 - Oron Sabag, Bashar Huleihel, Haim H. Permuter:
Graph-based Encoders and their Achievable Rates for Channels with Feedback. 1121-1125 - Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback. 1126-1130 - Divesh Aggarwal, Tomasz Kazana, Maciej Obremski:
Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters. 1131-1135 - Hiroki Koga:
A Lower Bound on the Joint Capacity of Digital Fingerprinting Codes Using Score Functions Based on Log-Likelihood Ratio. 1136-1140 - Mahdi Soleymani, Hessam Mahdavifar:
Distributed Multi-User Secret Sharing. 1141-1145 - Aswin Rajagopalan, Andrew Thangaraj, Shweta Agrawal:
Wiretap Polar Codes in Encryption Schemes Based on Learning with Errors Problem. 1146-1150 - Eshed Ram, Yuval Cassuto:
LDPC Codes with Local and Global Decoding. 1151-1155 - Rong Sun, Xiaogeng Hou, Jingyuan Sun, Hao Guan, Zhuyan Zhao:
Reliability-Based-Layered Belief Propagation for Iterative Decoding of LDPC Codes. 1156-1160 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Improved Redundant Parity-Check Based BP Decoding of LDPC Codes. 1161-1165 - Sudarsan V. S. Ranganathan, Richard D. Wesel, Dariush Divsalar:
Linear Rate-Compatible Codes with Degree-1 Extending Variable Nodes Under Iterative Decoding. 1166-1170 - Homa Nikbakht, Michèle A. Wigger, Shlomo Shamai Shitz:
Mixed Delay Constraints in Wyner's Soft-Handoff Network. 1171-1175 - Anoosheh Heidarzadeh, Jean-François Chamberland, Parimal Parag, Richard D. Wesel:
A Systematic Approach to Incremental Redundancy over Erasure Channels. 1176-1180 - Anoosheh Heidarzadeh, Ishan Tyagi, Srinivas Shakkottai, Alex Sprintson:
A Monetary Mechanism for Stabilizing Cooperative Data Exchange with Selfish Users. 1181-1185 - Pengfeng Hou, Andrew W. Eckford, Liqiang Zhao:
Signal Transduction for Two-Hop Molecular Communication Networks. 1186-1190 - Bin Chen, Shu-Tao Xia, Jie Hao, Fang-Wei Fu:
On Optimal Pseudo-cyclic ($r, \delta$) Locally Repairable Codes. 1191-1195 - M. Nikhil Krishnan, Anantha Narayanan R., P. Vijay Kumar:
Codes with Combined Locality and Regeneration Having Optimal Rate, $d_{\min}$ and Linear Field Size. 1196-1200 - Sean Ballentine, Alexander Barg:
Codes on Curves with Hierarchical Locality. 1201-1205 - Tomer Gafni, Kobi Cohen:
Learning in Restless Multi-Armed Bandits using Adaptive Arm Sequencing Rules. 1206-1210 - Atsushi Suzuki, Kenji Yamanishi:
Exact Calculation of Normalized Maximum Likelihood Code Length Using Fourier Analysis. 1211-1215 - Saurav Prakash, Amirhossein Reisizadeh, Ramtin Pedarsani, Amir Salman Avestimehr:
Coded Computing for Distributed Graph Analytics. 1221-1225 - Chien-Sheng Yang, Amir Salman Avestimehr, Ramtin Pedarsani:
Communication-Aware Scheduling of Serial Tasks for Dispersed Computing. 1226-1230 - Hanzaleh Akbari Nodehi, Mohammad Ali Maddah-Ali:
Limited-Sharing Multi-Party Computation for Massive Matrix Operations. 1231-1235 - Mario Holldack:
Max-Product for Maximum Weight Matching - Revisited. 1236-1240 - Mehran Elyasi, Soheil Mohajer:
A Cascade Code Construction for (n, k, d) Distributed Storage Systems. 1241-1245 - Prathamesh Mayekar, Parimal Parag, Himanshu Tyagi:
Optimal Lossless Source Codes for Timely Updates. 1246-1250 - Yonglong Li, Paul H. Siegel:
On the Capacity of 2-Dimensional Channels. 1251-1255 - Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligihle Cooperation Increase Capacity? The Average-Error Case. 1256-1260 - Michelle Effros, Victoria Kostina, Recep Can Yavas:
Random Access Channel Coding in the Finite Blocklength Regime. 1261-1265 - Mohamad Dia, Vahid Aref, Laurent Schmalen:
A Compressed Sensing Approach for Distribution Matching. 1266-1270 - Hussein Saad, Aria Nosratinia:
Belief Propagation with Side Information for Recovering a Single Community. 1271-1275 - Burak Çakmak, Manfred Opper:
Expectation Propagation for Approximate Inference: Free Probability Framework. 1276-1280 - Sundara Rajan Srinivasavaradhan, Linqi Song, Christina Fragouli:
Distributed Computing Trade-offs with Random Connectivity. 1281-1285 - Fan Li, Jinyuan Chen, Zhiying Wang:
Wireless MapReduce Distributed Computing. 1286-1290 - Emanuele Parrinello, Eleftherios Lampiris, Petros Elia:
Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors. 1291-1295 - Elia Santi, Christian Häger, Henry D. Pfister:
Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks. 1296-1300 - Jürgen Freudenberger, Mohammed Rajab, Sergo Shavgulidze:
A soft-Input Bit-Flipping Decoder for Generalized Concatenated Codes. 1301-1305 - July X. Li, Pascal O. Vontobel:
LP Decoding of Quantum Stabilizer Codes. 1306-1310 - Leijun Wang, Suihua Cai, Huixiao Ma, W. K. Leung, Xiao Ma:
Bit-Labeling for Delayed BICM with Iterative Decoding. 1311-1315 - Suayb S. Arslan:
Asymptotically MDS Array BP-XOR Codes. 1316-1320 - Thomas Mittelholzer:
Performance Analysis of Iteratively Decoded 3- Dimensional Product Codes. 1321-1325 - Jie Hao, Yi-Xian Yang, Kenneth W. Shum, Shu-Tao Xia:
On the Maximal Code Length of Optimal Linear Locally Repairable Codes. 1326-1330 - Lukas Holzbaur, Antonia Wachter-Zeh:
List Decoding of Locally Repairable Codes. 1331-1335 - Stanislav Kruglik, Kamilla Nazirkhanova, Alexey A. Frolov:
On Distance Properties of $(r, t, x)$-LRC Codes. 1336-1339 - Prasanna Ramakrishnan, Mary Wootters:
On Taking Advantage of Multiple Requests in Error Correcting Codes. 1340-1344 - Gen Li, Jingkai Yan, Yuantao Gu:
Outage Probability Conjecture Does Not Hold for Two-Input-Multiple-Output (TIM 0) System. 1345-1349 - Nir Shlezinger, Roee Shaked, Ron Dabora:
Bounds on the Capacity of MIMO Broadband Power Line Communications Channels. 1350-1354 - Abbas Khalili, Stefano Rini, Luca Barletta, Elza Erkip, Yonina C. Eldar:
On MIMO Channel Capacity with Output Quantization Constraints. 1355-1359 - Anas Chaaban, Zouheir Rezki, Mohamed-Slim Alouini:
MIMO Optical Intensity Channels with Peak Intensity Constraints: Low-SNR Capacity. 1360-1364 - Shancheng Zhao, Xiao Ma, Qin Huang, Baoming Bai:
A Class of Low-Complexity Codes Based on Doubly Recursive Block Markov Superposition Transmission. 1365-1369 - 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. 1370-1374 - Muhammad Umar Farooq, Saeedeh Moloudi, Michael Lentmaier:
Thresholds of Braided Convolutional Codes on the AWGN Channel. 1375-1379 - Min Zhu, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr., Baoming Bai:
Combating Error Propagation in Window Decoding of Braided Convolutional Codes. 1380-1384 - Ali Bereyhi, Saeid Haghighatshoar, Ralf R. Müller:
Theoretical Bounds on MAP Estimation in Distributed Sensing Networks. 1385-1389 - Jean Barbier, Nicolas Macris, Antoine Maillard, Florent Krzakala:
The Mutual Information in Random Linear Estimation Beyond i.i.d. Matrices. 1390-1394 - Peter Harremoës:
Statistical Inference and Exact Saddle Point Approximations. 1395-1399 - Jayadev Acharya:
Profile Maximum Likelihood is Optimal for Estimating KL Divergence. 1400-1404 - Ke Wang, Youlong Wu, Yingying Ma:
Capacity Region of Degraded Relay Broadcast Channel. 1405-1409 - Jian-Jia Weng, Fady Alajaji, Tamás Linder, Lin Song:
Sufficient Conditions for the Tightness of Shannon's Capacity Bounds for Two-Way Channels. 1410-1414 - Mohamed Salman, Mahesh K. Varanasi:
An Achievable Rate Region for the K-Receiver Two Nested Groupcast DM Broadcast Channel and a Capacity Result for the Combination Network. 1415-1419 - Mohamed Salman, Mahesh K. Varanasi:
The Capacity Region of the Three-Receiver Less Noisy Broadcast Channel with Message Cognition. 1420-1424 - Jingjing Zhang, Osvaldo Simeone:
Fundamental Limits of Cloud and Cache-Aided Interference Management with Multi-Antenna Base Stations. 1425-1429 - Fan Xu, Meixia Tao:
Fundamental Limits of Decentralized Caching in Fog-RANs with Wireless Fronthaul. 1430-1434 - Eleftherios Lampiris, Petros Elia:
Adding Transmitters Allows Unbounded Coded-Caching Gains with Bounded File Sizes. 1435-1439 - Eleftherios Lampiris, Petros Elia:
Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources. 1440-1444 - Farhad Shirani, Siddharth Garg, Elza Erkip:
Optimal Active social Network De-anonymization Using Information Thresholds. 1445-1449 - Jean-Christophe Deneuville, Philippe Gaborit, Qian Guo, Thomas Johansson:
Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol. 1450-1454 - Neri Merhav:
Ensemble Performance of Biometric Authentication Systems Based on Secret Key Generation. 1455-1459 - Henk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh, Ludo Tolhuizen, Paul Gorissen:
A Multi-layer Recursive Residue Number System. 1460-1464 - Sebastian Cammerer, Moustafa Ebada, Ahmed Elkelesh, Stephan ten Brink:
Sparse Graphs for Belief Propagation Decoding of Polar Codes. 1465-1469 - Peter Trifonov:
A Score Function for Sequential Decoding of Polar Codes. 1470-1474 - Peter Trifonov:
Algebraic Matching Techniques for Fast Decoding of Polar Codes with Reed-Solomon Kernel. 1475-1479 - Hamid Saber, Yiqun Ge, Ran Zhang, Wuxian Shi, Wen Tong:
Convolutional Polar Codes: LLR-based Successive Cancellation Decoder and List Decoding Performance. 1480-1484 - Nirmal V. Shende, Aaron B. Wagner, Yucel Altug:
When Does Feedback Improve the Second-Order Coding Rate in Discrete Memoryless Channels? 1485-1489 - Peida Tian, Victoria Kostina:
The Dispersion of the Gauss-Markov Source. 1490-1494 - Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
Second-Order Asymptotics of Rate-Distortion using Gaussian Codebooks for Arbitrary Sources. 1495-1499 - Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
Second-Order Asymptotics of Universal JSCC for Arbitrary Sources and Additive Channels. 1500-1504 - Venkatesan Guruswami, Nicolas Resch:
On the List-Decodability of Random Linear Rank-Metric Codes. 1505-1509 - Ryohei Goto, Kenta Kasai:
High-rate Spatially Coupled Codes for Channels with Synchronous Errors. 1510-1514 - Ryota Konabe, Kazuho Watanabe:
Sparse Regression Code with Sparse Dictionary for Absolute Error Criterion. 1515-1519 - Fan Zhang, Aria Nosratinia:
Spatially Correlated MIMO Broadcast Channel with Partially Overlapping Correlation Eigenspaces. 1520-1524 - Manik Singhal, Aly El Gamal:
Optimal Cell Associations and Degrees of Freedom of Locally Connected Interference Networks with Message Passing Decoding. 1525-1529 - Hamdi Joudeh, Bruno Clerckx:
On the Optimality of Treating Interference as Noise for Interfering Multiple Access Channels. 1530-1534 - Yao Wang, Mahesh K. Varanasi:
A New Approach to Linear Degrees of Freedom: the MIMO Broadcast Channel with Hybrid CSIT. 1535-1539 - Enrico Piovano, Hamdi Joudeh, Bruno Clerckx:
Robust Cache-Aided Interference Management Under Full Transmitter Cooperation. 1540-1544 - Daming Cao, Deyao Zhang, Pengyao Chen, Nan Liu, Wei Kang, Deniz Gündüz:
Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case. 1545-1549 - Kai Wan, Mingyue Ji, Pablo Piantanida, Daniela Tuninetti:
On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches. 1550-1554 - Qifa Yan, Michèle A. Wigger, Sheng Yang:
Placement Delivery Array Design for Combination Networks with Edge Caching. 1555-1559 - Sam Safavi, Bikash Joshi, Guilherme França, José Bento:
An Explicit Convergence Rate for Nesterov's Method from SDP. 1560-1564 - Jingbo Liu, Sergio Verdú:
Rejection Sampling and Noncausal Sampling Under Moment Constraints. 1565-1569 - Maialen Larrañaga, Mohamad Assaad, Koen De Turck:
Queue-Aware Energy Efficient Control for Dense Wireless Networks. 1570-1574 - Yaoqing Yang, Pulkit Grover, Soummya Kar:
Coding for a Single Sparse Inverse Problem. 1575-1579 - Matías Vera, Pablo Piantanida, Leonardo Rey Vega:
The Role of the Information Bottleneck in Representation Learning. 1580-1584 - Sanghamitra Dutta, Ziqian Bai, Haewon Jeong, Tze Meng Low, Pulkit Grover:
A Unified Coded Deep Neural Network Training Strategy based on Generalized PolyDot codes. 1585-1589 - Christian Häger, Henry D. Pfister:
Deep Learning of the Nonlinear Schrödinger Equation in Fiber-Optic Communications. 1590-1594 - Amir Bennatan, Yoni Choukroun, Pavel Kisilev:
Deep Learning for Decoding of Linear Codes - A Syndrome-Based Approach. 1595-1599 - Jing Hao, Varun S. Jog:
An Entropy Inequality for Symmetric Random Variables. 1600-1604 - Xiaobing Zhang, Venkat Anantharam, Yanlin Geng:
Gaussian Extremality for Derivatives of Differential Entropy under the Additive Gaussian Noise Flow. 1605-1609 - Thomas A. Courtade:
A Quantitative Entropic CLT for Radially Symmetric Random Vectors. 1610-1614 - Andre Wibisono, Varun S. Jog:
Convexity of Mutual Information Along the Heat Flow. 1615-1619 - Nuwan S. Ferdinand, Stark C. Draper:
Hierarchical Coded Computation. 1620-1624 - Farzin Haddadpour, Viveck R. Cadambe:
Codes for Distributed Finite Alphabet Matrix-Vector Multiplication. 1625-1629 - Hyegyeong Park, Kangwook Lee, Jy-yong Sohn, Changho Suh, Jaekyun Moon:
Hierarchical Coding for Distributed Computing. 1630-1634 - Yoones Hashemi, Amir H. Banihashemi:
Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets. 1635-1639 - Ali Dehghan, Amir H. Banihashemi:
From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. 1640-1644 - Ali Dehghan, Amir H. Banihashemi:
Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is Hard. 1645-1649 - Ali Dehghan, Amir H. Banihashemi:
Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles. 1650-1654 - Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy, Hengjia Wei:
Low-Power Cooling Codes with Efficient Encoding and Decoding. 1655-1659 - Amit Solomon, Yuval Cassuto:
Error-Correcting WOM Constructions through Concatenation and Joint Design. 1660-1664 - Luca G. Tallini, Bella Bose:
On Some New $\mathbb{Z}_{m}$ Linear Codes Based on Elementary Symmetric Functions. 1665-1669 - Yongjune Kim, Mingu Kang, Lav R. Varshney, Naresh R. Shanbhag:
SRAM Bit-line Swings Optimization using Generalized Waterfilling. 1670-1674 - Neri Merhav:
Error Exponents of Typical Random Codes. 1675-1679 - Semih Yagli, Paul Cuff:
Exact Soft-Covering Exponent. 1680-1684 - Kenneth Palacio-Baus, Natasha Devroye:
Two-Way AWGN Channel Error Exponents at Zero Rate. 1685-1689 - Daming Cao, Vincent Y. F. Tan:
Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel. 1690-1694 - Fangwei Ye, Shiqiu Liu, Kenneth W. Shum, Raymond W. Yeung:
On a Simple Characterization of Secure Exact-repair Regenerating Codes. 1695-1699 - Hoang Dau, Iwan M. Duursma, Hien Chu:
On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon Codes. 1700-1704 - Saeid Sahraei, Michael Gastpar:
Increasing Availability in Distributed Storage Systems via Clustering. 1705-1709 - Nujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan:
Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers. 1710-1714 - Hadi Reisizadeh, Mohammad Ali Maddah-Ali, Soheil Mohajer:
Erasure Coding for Decentralized Coded Caching. 1715-1719 - Ahmed A. Zewail, Aylin Yener:
The Wiretap Channel with a Cache. 1720-1724 - Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering. 1725-1729 - Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh, Alex Sprintson:
A Simple and Efficient Strategy for the Coin Weighing Problem with a Spring Scale. 1730-1734 - Yu Cheng, Wade Hann-Caruthers, Omer Tamuz:
A Deterministic Protocol for Sequential Asymptotic Learning. 1735-1738 - Netanel Raviv, Itzhak Tamo:
Private Information Retrieval is Graph Based Replication Systems. 1739-1743 - Rafael G. L. D'Oliveira, Salim El Rouayheb:
Lifting Private Information Retrieval from Two to any Number of Messages. 1744-1748 - Jingke Xu, Zhifang Zhang:
Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields. 1749-1753 - Galen Reeves, Henry D. Pfister, Alex Dytso:
Mutual Information as a Function of Matrix SNR for Linear Gaussian Channels. 1754-1758 - Terence Chan, Satyajit Thakor, Alex J. Grant:
A Minimal Set of Shannon-type Inequalities for MRF Structures with Functional Dependencies. 1759-1763 - Ferdinando Cicalese, Ugo Vaccaro:
Maximum Entropy Interval Aggregations. 1764-1768 - Mahdi Cheraghchi, João Ribeiro:
Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel. 1769-1773 - Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
Ozarow- Type Outer Bounds for Memoryless Sources and Channels. 1774-1778 - Yimin Pang, Mahesh K. Varanasi:
Bounds on the Capacity Region of the Three-User One-to-Three MIMO Interference Channel. 1779-1783 - Matthias Christandl, Roberto Ferrara, Cecilia Lancien:
Random Private Quantum States. 1784-1788 - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Building Blocks for Communication Over Noisy Quantum Nerworks. 1789-1793 - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum Channel. 1794-1798 - Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Skip-Sliding Window Codes. 1799-1803 - Ron M. Roth, Paul H. Siegel:
On Parity-Preserving Constrained Coding. 1804-1808 - M. Nikhil Krishnan, P. Vijay Kumar:
Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures. 1809-1813 - Shun Watanabe:
A Classification of Functions in Multiterminal Distributed Computing. 1814-1818 - Xuan Guang, Raymond W. Yeung, Shenghao Yang, Congduan Li:
An Enhanced Capacity Bound for Network Function Computation. 1819-1823 - Jie Wang, Shenghao Yang, Congduan Li:
On the Tightness of a Cut-Set Bound on Network Function Computation. 1824-1828 - Anders Høst-Madsen, June Zhang:
Coding of Graphs with Application to Graph Anomaly Detection. 1829-1833 - Maciej Obremski, Maciej Skorski:
Inverted Leftover Hash Lemma. 1834-1838 - Augusto Santos, Vincenzo Matta, Ali H. Sayed:
Consistent Tomography over Diffusion Networks under the Low-Observability Regime. 1839-1843 - Junya Honda:
Exact Asymptotics of Random Coding Error Probability for General Memoryless Channels. 1844-1848 - Himanshu Tyagi, Shun Watanabe:
Strong Converse using Change of Measure Arguments. 1849-1853 - Jingbo Liu:
Dispersion Bound for the Wyner-Ahlswede-Körner Network via Reverse Hypercontractivity on Types. 1854-1858 - Min-Oh Jung, Song-Nam Hong:
Construction of Rate-Compatible Punctured Polar Codes Using Hierarchical Puncturing. 1859-1863 - Ishaque Ashar Kadampot, Mehrdad Tahmasbi, Matthieu R. Bloch:
Multilevel-Coded Pulse-Position Modulation for Covert Communications. 1864-1868 - Kuangda Tian, Arman Fazeli, Alexander Vardy:
Polar Coding for Deletion Channels: Theory and Implementation. 1869-1873 - Ahmed El Alaoui, Florent Krzakala:
Estimation in the Spiked Wigner Model: A Short Proof of the Replica Formula. 1874-1878 - Jean Barbier, Chun Lam Chan, Nicolas Macris:
Adaptive Path Interpolation for Sparse Systems: Application to a Simple Censored Block Model. 1879-1883 - Alyson K. Fletcher, Sundeep Rangan, Philip Schniter:
Inference in Deep Networks in High Dimensions. 1884-1888 - Sara Mousavi, Tianli Zhou, Chao Tian:
Delayed Parity Generation in MDS Storage Codes. 1889-1893 - Jie Li, Xiaohu Tang, Chao Tian:
An Alternative Generic Transformation for Optimal Repair Bandwidth and Rebuilding Access in MDS Codes. 1894-1898 - Shuo Shao, Tie Liu, Chao Tian, Cong Shen:
New Results on Multilevel Diversity Coding with Secure Regeneration. 1899-1903 - Chao Tian, Hua Sun, Jun Chen:
A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems. 1904-1908 - Mohammad Mohammadi Amiri, Deniz Gündüz:
On the Capacity Region of a Cache-Aided Gaussian Broadcast Channel with Multi-Layer Messages. 1909-1913 - Antti Tölli, Seyed Pooya Shariatpanahi, Jarkko Kaleva, Babak Hossein Khalaj:
Multicast Beamformer Design for Coded Caching. 1914-1918 - Richard Combes, Asma Ghorbel, Mari Kobayashi, Sheng Yang:
Utility Optimal Scheduling for Coded Caching in General Topologies. 1919-1923 - Jing Zhong, Roy D. Yates, Emina Soljanin:
Two Freshness Metrics for Local Cache Refresh. 1924-1928 - Mehmet Fatih Aktas, Emina Soljanin:
Heuristics for Analyzing Download Time in MDS Coded Storage Systems. 1929-1933 - Ramy E. Ali, Viveck R. Cadambe, Jaime Llorca, Antonia M. Tulino:
Multi-version Coding with Side Information. 1934-1938 - Min Ye, Alexander Barg:
Optimal Regenerating Codes for Cooperative Repair. 1939-1943 - Ameera Chowdhury, Alexander Vardy:
New Constructions of MDS Codes with Asymptotically Optimal Repair. 1944-1948 - Yi-Peng Wei, Karim A. Banawan, Sennur Ulukus:
Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching. 1949-1953 - Su Li, Michael Gastpar:
Single-server Multi-user Private Information Retrieval with Side Information. 1954-1958 - Mohamed Adel Attia, Deepak Kumar, Ravi Tandon:
The Capacity of Uncoded Storage Constrained PIR. 1959-1963 - Arnaud Marsiglietti, James Melbourne:
A Renyi Entropy Power Inequality for Log-Concave Vectors and Parameters in [0, 1]. 1964-1968 - Jiange Li, James Melbourne:
Further Investigations of the Maximum Entropy of the Sum of Two Dependent Random Variables. 1969-1972 - James Melbourne, Saurav Talukdar, Shreyas Bhaban, Murti V. Salapaka:
Error Bounds on a Mixed Entropy Inequality. 1973-1977 - Arnaud Marsiglietti, Victoria Kostina:
New Connections Between the Entropy Power Inequality and Geometric Inequalities. 1978-1982 - Netanel Raviv, Yuval Cassuto, Rami Cohen, Moshe Schwartz:
Erasure Correction of Scalar Codes in the Presence of Stragglers. 1983-1987 - Shahrzad Kiani, Nuwan S. Ferdinand, Stark C. Draper:
Exploitation of Stragglers in Coded Computation. 1988-1992 - Tavor Baharav, Kangwook Lee, Orhan Ocal, Kannan Ramchandran:
Straggler-Proofing Massive-Scale Distributed Matrix Multiplication with D-Dimensional Product Codes. 1993-1997 - Zachary Charles, Dimitris S. Papailiopoulos:
Gradient Coding Using the Stochastic Block Model. 1998-2002 - Tibor Keresztfalvi, Amos Lapidoth:
Partially-Robust Communications over a Noisy Channel. 2003-2006 - Oliver Kosut, Jörg Kliewer:
Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying Channel. 2007-2011 - Holger Boche, Christian Deppe, Janis Nötzel, Andreas J. Winter:
Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy. 2012-2016 - Holger Boche, Minglai Cai, Ning Cai:
Message Transmission over Classical Quantum Channels with a Jammer with Side Information. 2017-2021 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding. 2022-2026 - Wael Halbawi, Navid Azizan Ruhi, Fariborz Salehi, Babak Hassibi:
Improving Distributed Gradient Descent Using Reed-Solomon Codes. 2027-2031 - Songze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Compressed Coded Distributed Computing. 2032-2036 - Matthias Frey, Igor Bjelakovic, Slawomir Stanczak:
Resolvability on Continuous Alphabets. 2037-2041 - Ryo Nomura:
Source Resolvability with Kullback-Leibler Divergence. 2042-2046 - Hideki Yagi, Te Sun Han:
Variable-Length Channel Resolvability for Discrete Memoryless Sources and Channels. 2047-2051 - Noha M. Helal, Matthieu R. Bloch, Aria Nosratinia:
Multiple-Access Channel Resolvability with Cribbing. 2052-2056 - Marina Haikin, Ram Zamir, Matan Gavish:
Frame Moments and Welch Bound with Erasures. 2057-2061 - Ji Wang, Jun Sun, Weimin Wu, Yingzhuang Liu, Xiaodong Wang:
Non-Orthogonal Training Sequence Design in Two-Cell Interference Networks Based on an Extended Welch Bound. 2062-2066 - Marwen Zorgui, Zhiying Wang:
On the Achievability Region of Regenerating Codes for Multiple Erasures. 2067-2071 - Alexandra M. Porter, Shashwat Silas, Mary Wootters:
Load-Balanced Fractional Repetition Codes. 2072-2076 - Yi-Sheng Su:
Optimal Pliable Fractional Repetition Codes. 2077-2081 - Jesús Gómez-Vilardebó:
A Novel Coded Caching Scheme with Coded Prefetching. 2082-2086 - Kai Zhang, Chao Tian:
From Uncoded Prefetching to Coded Prefetching in Coded Caching Systems. 2087-2091 - Nujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan:
Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching. 2092-2096 - Bruce E. Hajek, Suryanarayana Sankagiri:
Recovering a Hidden Community in a Preferential Attachment Graph. 2097-2101 - Muni Sreenivas Pydi, Ambedkar Dukkipati:
On Consistency of Compressive Spectral Clustering. 2102-2106 - Hussein Saad, Aria Nosratinia:
Side Information in Recovering a Single Community: Information Theoretic Limits. 2107-2111 - David A. Karpuk:
Private Computation of Systematically Encoded Data with Colluding Servers. 2112-2116 - Sarah A. Obead, Jörg Kliewer:
Achievable Rate of Private Function Retrieval from MDS Coded Databases. 2117-2121 - Zhen Chen, Zhiying Wang, Syed Ali Jafar:
The Asymptotic Capacity of Private Search. 2122-2126 - Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model at Zero Temperature. 2127-2131 - Alexey Gronskiy, Joachim M. Buhmann, Wojciech Szpankowski:
Free Energy Asymptotics for Problems with Weak Solution Dependencies. 2132-2136 - Mihai-Alin Badiu, Justin P. Coon:
On the Distribution of Random Geometric Graphs. 2137-2141 - Lan V. Truong:
Performance of Viterbi Decoding on Interleaved Rician Fading Channels. 2142-2146 - Hadi Sarieddeen, Mohammad M. Mansour, Ali Chehab:
Channel-Punctured Large MIMO Detection. 2147-2151 - Holger Boche, Ullrich J. Mönich:
Solvability of the PAPR Problem for OFDM with Reduced Compensation Set. 2152-2156 - Xin Wang, Kun Fang, Marco Tomamichel:
On Finite Blocklength Converse Bounds for Classical Communication Over Quantum Channels. 2157-2161 - Hao-Chung Cheng, Eric P. Hanson, Nilanjana Datta, Min-Hsiu Hsieh:
Error Exponents and Strong Converse Exponents for Classical Data Compression with Quantum Side Information. 2162-2166 - Mario Berta, Mark M. Wilde:
Strong Converse Bound on the Two-Way Assisted Quantum Capacity. 2167-2171 - Alisepta Vahid:
Finite Field X-Channels with Delayed CSIT and Common Messages. 2172-2176 - Shih-Yi Yeh, I-Hsiang Wang:
Degrees of Freedom of the Bursty MIMO X Channel with Instantaneous Topological Information. 2177-2181 - Tomotaka Hiraoka, Hirosuke Yamamoto:
Alphabetic AIFV Codes Constructed from Hu- Tucker codes. 2182-2186 - Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
An Optimality Proof of the Iterative Algorithm for AIFV-m Codes. 2187-2191 - Danny Dubé, Fatma Haddad:
Individually Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes. 2192-2196 - Ron M. Roth:
Fault- Tolerant Dot-Product Engines. 2197-2201 - Minghai Qin:
Hamming-Distance-Based Binary Representation of Numbers. 2202-2205 - Jingwei Zhang, Changan Zhao:
Linear Complexity and Trace Presentation of Sequences with Period 2P2. 2206-2210 - Igal Sason, Sergio Verdú:
Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints. 2211-2215 - Payam Delgosha, Venkat Anantharam:
Distributed Compression of Graphical Data. 2216-2220 - Ni Ding, Parastoo Sadeghi, David Smith, Thierry Rakotoarivelo:
Distributed Data Compression in Sensor Clusters: A Maximum Independent Flow Approach. 2221-2225 - Yehuda Dar, Michael Elad, Alfred M. Bruckstein:
System-Aware Compression. 2226-2230 - Behrooz Tahmasebi, Mohammad Ali Maddah-Ali, Abolfazl S. Motahari:
Genome-Wide Association Studies: Information Theoretic Limits of Reliable Learning. 2231-2235 - Christopher Rose, Sherief Reda, Brenda M. Rubenstein, Jacob K. Rosenstein:
Computing with Chemicals: Perceptrons Using Mixtures of Small Molecules. 2236-2240 - Siddharth Jain, Netanel Raviv, Jehoshua Bruck:
Attaining the 2nd Chargaff Rule by Tandem Duplications. 2241-2245 - Hao Lou, Moshe Schwartz, Farzad Farnoud Hassanzadeh:
Evolution of N-Gram Frequencies Under Duplication and Substitution Mutations. 2246-2250 - Gabriel Schamberg, Todd P. Coleman:
A Sample Path Measure of Causal Influence. 2251-2255 - Victoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke:
Stabilizing a System with an Unbounded Random Gain Using Only Finitely Many Bits. 2256-2260 - Jaeyoung Choi, Yung Yi:
Necessary and Sufficient Budgets in Information Source Finding with Querying: Adaptivity Gap. 2261-2265 - Elie Najm, Rajai Nasser, Emre Telatar:
Content Based Status Updates. 2266-2270 - Abdulrahman Baknina, Sennur Ulukus, Omur Ozel, Jing Yang, Aylin Yener:
Sening Information Through Status Updates. 2271-2275 - Zhiyuan Jiang, Bhaskar Krishnamachari, Xi Zheng, Sheng Zhou, Zhisheng Niu:
Decentralized Status Update for Age-of-Information Optimization in Wireless Multiaccess Channels. 2276-2280 - Roy D. Yates:
Status Updates through Networks of Parallel Servers. 2281-2285 - Andrew Thompson, A. Robert Calderbank:
Compressed Neighbour Discovery using Sparse Kerdock Matrices. 2286-2290 - Milad Bakhshizadeh, Arian Maleki, Shirin Jalali:
Compressive Phase Retrieval of Structured Signals. 2291-2295 - Gauri Jagatap, Chinmay Hegde:
Towards Sample-Optimal Methods for Solving Random Quadratic Equations with Structure. 2296-2300 - Yi Li, Vasileios Nakos:
Sublinear- Time Algorithms for Compressive Phase Retrieval. 2301-2305 - Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Tobias Koch, Alejandro Lancho:
Saddlepoint Approximation of the Error Probability of Binary Hypothesis Testing. 2306-2310 - Jonathan Scarlett, Volkan Cevher:
Near-Optimal Noisy Group Testing via Separate Decoding of Items. 2311-2315 - K. R. Sahasranand, Himanshu Tyagi:
Extra Samples can Reduce the Communication for Independence Testing. 2316-2320 - Javad Heydari, Ali Tajer:
Controlled Sensing for Multi-Hypothesis Testing with Co-Dependent Actions. 2321-2325 - Kun Fang, Xin Wang, Marco Tomamichel, Mario Berta:
Quantum Channel Simulation and the Channel's Smooth Max-Information. 2326-2330 - Mark M. Wilde:
Recoverability for Holevo's Just-as-Good Fidelity. 2331-2335 - Jihao Fan, Min-Hsiu Hsieh, Hanwu Chen, He Chen, Yonghui Li:
Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors. 2336-2340 - Wei Xie, Xin Wang, Runyao Duan:
Converse Bounds for Classical Communication Over Quantum Broadcast Channels and Quantum Multi-Access Channels. 2341-2345 - Gaojun Luo, Xiwang Cao:
New Constructions of Codebooks Asymptotically Achieving the Welch Bound. 2346-2350 - Pinar Sen, Sung Hoon Lim, Young-Han Kim:
Optimal Achievable Rates for Computation With Random Homologous Codes. 2351-2355 - Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Lattices from Linear Codes and Fine Quantization: General Continuous Sources and Channels. 2356-2360 - Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillen i Fabregas:
The Error Exponent of Generalized Random-Gilbert Varshamov Codes. 2361-2365 - Jy-yong Sohn, Beongjun Choi, Jaekyun Moon:
A Class of MSR Codes for Clustered Distributed Storage. 2366-2370 - Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman:
∊-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. 2371-2375 - Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar:
Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d=k+1, k+2, k+3$. 2376-2380 - Balaji Srinivasan Babu, P. Vijay Kumar:
A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes. 2381-2385 - Minh Thanh Vu, Tobias J. Oechtering, Mikael Skoglund, Holger Boche:
Uncertainty in Identification Systems. 2386-2390 - Hideki Yagi, Te Sun Han:
Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding. 2391-2395 - R. Srivastava, Rakesh Kumar Bansal:
Sequential Change Detection Through Universal Compression - An Asymptotic Study. 2396-2400 - Dixita Limbachiya, Krishna Gopal Benerjee, Bansari Rao, Manish K. Gupta:
On DNA Codes using the Ring Z4 + wZ4. 2401-2405 - Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah, Tuan Thanh Nguyen:
Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications. 2406-2410 - Andreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh, Eitan Yaakobi:
Coding over Sets for DNA Storage. 2411-2415 - Theo Fanuela Prabowo, Chik How Tan:
Almost Orthogonal MDS Matrices over GR(2n, k). 2416-2420 - Nicolas Aragon, Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich:
A New Algorithm for Solving the Rank Syndrome Decoding Problem. 2421-2425 - Antonia Wachter-Zeh, Sven Puchinger, Julian Renner:
Repairing the Faure-Loidreau Public-Key Cryptosystem. 2426-2430 - Songtao Feng, Jing Yang:
Minimizing Age of Information for an Energy Harvesting Source with Updating Failures. 2431-2435 - Shahab Farazi, Andrew G. Klein, D. Richard Brown:
Age of Information in Energy Harvesting Status Update Systems: When to Preempt in Service? 2436-2440 - Jia Zhang, Chih-Chun Wang:
On The Rate-Cost of Gaussian Linear Control Systems with Random Communication Delays. 2441-2445 - Karim A. Banawan, Sennur Ulukus:
Private Information Retrieval Under Asymmetric Traffic Constraints. 2446-2450 - Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers. 2451-2455 - Qiwen Wang, Mikael Skoglund:
Secure Private Information Retrieval from Colluding Databases with Eavesdroppers. 2456-2460 - Roy Karasik, Osvaldo Simeone, Shlomo Shamai:
Fundamental Latency Limits for D2D- Aided Content Delivery in Fog Wireless Networks. 2461-2465 - Ioannis Kontoyiannis, Stavros Toumpis, Riccardo Cavallari, Roberto Verdone:
Asymptotics of the Packet Speed and Cost in a Mobile Wireless Network Model. 2466-2470 - Rahul Devassy, Giuseppe Durisi, Guido Carlo Ferrante, Osvaldo Simeone, Elif Uysal-Biyikoglu:
Delay and Peak-Age Violation Probability in Short-Packet Transmissions. 2471-2475 - Yuxiang Yang, Giulio Chiribella, Masahito Hayashi:
Compression for Qubit Clocks. 2476-2480 - Mark M. Wilde:
Optimized Quantum F-Divergences. 2481-2485 - Eugenia-Maria Kontopoulou, Ananth Grama, Wojciech Szpankowski, Petros Drineas:
Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices. 2486-2490 - Gonzalo Vazquez-Vilar, Albert Guillén i Fàbregas, Sergio Verdú:
The Error Probability of Generalized Perfect Codes. 2491-2495 - Li-Ping Wang:
Linearized Goppa Codes. 2496-2500 - Chao Chen, Haiyang Liu, Baoming Bai:
Finite Hyperplane Codes: Minimum Distance and Majority-Logic Decoding. 2500-2504 - Ohad Elishco, Ryan Gabrys, Eitan Yaakobi:
Bounds and Constructions of Codes over Symbol-Pair Read Channels. 2505-2509 - Hajir Roozbehani, Yury Polyanskiy:
Input-Output Distance Properties of Good Linear Codes. 2510-2514 - Yu Tsunoda, Yuichiro Fujiwara:
Bounds and Polynomial-Time Construction Algorithm for X-Codes of Constant Weight Three. 2515-2519 - Mahdi Cheraghchi:
Expressions for the Entropy of Binomial-Type Distributions. 2520-2524 - Aditya Siripuram, Brad Osgood:
LP relaxations and Fuglede's conjecture. 2525-2529 - Holger Boche, Volker Pohl:
On the Approximability of the Hilbert Transform. 2530-2534 - Yonatan Yehezkeally, Moshe Schwartz:
Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication Errors. 2535-2539 - Ryan Gabrys, Olgica Milenkovic:
Unique Reconstruction of Coded Sequences from Multiset Substring Spectra. 2540-2544 - Andrew W. Eckford, Benjamin Kuznets-Speck, Michael Hinczewski, Peter J. Thomas:
Thermodynamic Properties of Molecular Communication. 2545-2549 - Gowtham R. Kurri, Vinod M. Prabhakaran, Anand D. Sarwate:
Coordination Using Individually Shared Randomness. 2550-2554 - Borzoo Rassouli, Deniz Gündüz:
On Perfect Privacy. 2551-2555 - Amey Bhangale, Aditya Potukuchi:
A Note on the Joint Entropy of N/2-Wise Independence. 2560-2564 - Rajat Talak, Igor Kadota, Sertac Karaman, Eytan H. Modiano:
Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State. 2564-2568 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire:
Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications. 2569-2573 - Recep Gül, Helmut Bölcskei, Shlomo Shamai:
Necessary Conditions for K/2 Degrees of Freedom. 2574-2578 - Abhishek Agarwal, Sidharth Jaggi, Arya Mazumdar:
Novel Impossibility Results for Group-Testing. 2579-2583 - Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen:
Efficiently Decodable Non-Adaptive Threshold Group Testing. 2584-2588 - Alejandro Cohen, Asaf Cohen, Sidharth Jaggi, Omer Gurewitz:
Secure Adaptive Group Testing. 2589-2593 - Wasim Huleihel, Ohad Elishco, Muriel Médard:
Blind Group Testing. 2594-2598 - Ceren Sevinç, Ertem Tuncel:
On Asymptotic Analysis of Energy-Distortion Tradeoff for Low-Delay Transmission over Gaussian Channels. 2599-2603 - Ceren Sevinç, Ertem Tuncel:
On Energy-Distortion Exponents for Low-Delay Gaussian Broadcasting. 2604-2608 - Vasuki Narasimha Swamy, Paul Rigge, Gireeja Ranade, Borivoje Nikolic, Anant Sahai:
Predicting Wireless Channels for Ultra-Reliable Low-Latency Communications. 2609-2613 - Masahito Hayashi, Takeshi Koshiba:
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication. 2614-2618 - Ravi Kiran Raman, Lav R. Varshney:
Dynamic Distributed Storage for Blockchains. 2619-2623 - Lieneke Kusters, Frans M. J. Willems:
Capacity of a Multiple Enrollment System Based on an SRAM-PUF: Forgetful Setting. 2624-2628 - Slim Bettaieb, Loïc Bidoux, Yann Connan, Philippe Gaborit, Adrien Hauteville:
The Learning with Rank Errors problem and an application to symmetric authentication. 2629-2633 - Yu-Pin Hsu:
Age of Information: Whittle Index for Scheduling Stochastic Arrivals. 2634-2638 - Yoshiaki Inoue:
Analysis of the Age of Information with Packet Deadline and Infinite Buffer Capacity. 2639-2643 - Sanjit K. Kaul, Roy D. Yates:
Age of Information: Updates with Priority. 2644-2648 - Reihaneh Safavi-Naini, Pengwei Wang:
Secure Key Agreement over Partially Corrupted Channels. 2649-2653 - Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. 2654-2658 - Amin Gohari, Onur Günlü, Gerhard Kramer:
On Achieving a Positive Rate in the Source Model Key Agreement Problem. 2659-2663 - Qiaoqiao Zhou, Chung Chan:
Secrecy Capacity under Limited Discussion Rate for Minimally Connected Hypergraphical Sources. 2664-2668 - Walter O. Krawec:
Key-Rate Bound of a Semi-Quantum Protocol Using an Entropic Uncertainty Relation. 2669-2673 - Holger Boche, Christian Deppe, Andreas J. Winter:
Secure and Robust Identification via Classical-Quantum Channels. 2674-2678 - Anurag Anshu, Masahito Hayashi, Naqueeb Ahmad Warsi:
Secure Communication Over Fully Quantum Gel' Fand-Pinsker Wiretap Channel. 2679-2683
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-11-06 00:18 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:
