default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2019: Paris, France
- IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019. IEEE 2019, ISBN 978-1-5386-9291-2
- Kristoffer Stern, Anders E. Kalør
, Beatriz Soret, Petar Popovski:
Massive Random Access with Common Alarm Messages. 1-5 - Justin Khim, Varun S. Jog, Po-Ling Loh:
Adversarial Influence Maximization. 1-5 - Ahmed A. Zewail, Aylin Yener:
Untrusted Caches in Two-layer Networks. 1-5 - Jaume Riba, Ferran De Cabrera:
A Proof of de Bruijn Identity based on Generalized Price's Theorem. 1-5 - Satyajit Thakor, Mohammad Ishtiyaq Qureshi:
Undirected Unicast Network Capacity: A Partition Bound. 1-5 - Chih-Hua Chang, Chih-Chun Wang:
Coded Caching with Heterogeneous File Demand Sets - The Insufficiency of Selfish Coded Caching. 1-5 - Haewon Jeong, Yaoqing Yang, Pulkit Grover:
Systematic Matrix Multiplication Codes. 1-5 - Chih-Hua Chang, Chih-Chun Wang:
Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File Case. 6-10 - Hadi Reisizadeh, Mohammad Ali Maddah-Ali, Soheil Mohajer:
Cache-Aided Two-User Broadcast Channels with State Information at Receivers. 16-20 - Kirill Ivanov, Rüdiger L. Urbanke:
Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel. 21-25 - Mikhail Kamenev, Yulia Kameneva, Oleg Kurmaev, Alexey Maevskiy:
A New Permutation Decoding Method for Reed-Muller Codes. 26-30 - Myna Vajha, V. S. Chaitanya Mukka, P. Vijay Kumar:
Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes. 31-35 - Alex Dytso, Martina Cardone, Mishfad S. Veedu, H. Vincent Poor:
On Estimation under Noisy Order Statistics. 36-40 - Devavrat Shah, Christina Lee Yu:
Iterative Collaborative Filtering for Sparse Noisy Tensor Estimation. 41-45 - Nived Rajaraman, Prafulla Chandra, Andrew Thangaraj, Ananda Theertha Suresh:
Convergence of Chao Unseen Species Estimator. 46-50 - Zsolt Talata:
Context Block Estimation for Random Fields. 51-55 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes. 56-60 - Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Construction of Partial Geometries and LDPC codes based on Reed-Solomon Codes. 61-65 - Ryoichiro Yoshida, Kenta Kasai:
Linear Permutation Polynomial Codes. 66-70 - Xin Xiao, Bane Vasic, Shu Lin, Khaled A. S. Abdel-Ghaffar, William E. Ryan:
Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures. 71-75 - Peng Fei, Zhiying Wang:
LDPC Codes for Portable DNA Storage. 76-80 - Tal Shinkar, Eitan Yaakobi, Andreas Lenz, Antonia Wachter-Zeh:
Clustering-Correcting Codes. 81-85 - Wentu Song, Kui Cai, Kees A. Schouhamer Immink:
Sequence-Subset Distance and Coding for Error Control for DNA-based Data Storage. 86-90 - Yeow Meng Chee, Han Mao Kiah, Hengjia Wei:
Efficient and Explicit Balanced Primer Codes. 91-95 - Huseyin A. Inan, Surin Ahn, Peter Kairouz, Ayfer Özgür:
A Group Testing Approach to Random Access for Short-Packet Communication. 96-100 - Ilya Vorobyev:
A New Algorithm for Two-Stage Group Testing. 101-105 - Mohammad Fereydounian, Xingran Chen, Hamed Hassani, Shirin Saeedi Bidokhti:
Non-asymptotic Coded Slotted ALOHA. 111-115 - Ali Zibaeenejad, Jun Chen:
The Optimal Power Control Policy for an Energy Harvesting System with Look-Ahead: Bernoulli Energy Arrivals. 116-120 - Chang-Sik Choi, François Baccelli, Gustavo de Veciana:
Analysis of Data Harvesting by Unmanned Aerial Vehicles. 121-125 - Daewon Seo, Lav R. Varshney:
Information and Energy Transmission with Experimentally-Sampled Harvesting Functions. 126-130 - Jihad Fahs, Aslan Tchamkerten, Mansoor I. Yousefi:
On the Optimal Input of the Nondispersive Optical Fiber. 131-135 - Morteza Soltani, Zouheir Rezki:
Discrete-Time Poisson Optical Wiretap Channel with Peak Intensity Constraint. 136-140 - Reza Rafie Borujeny, Frank R. Kschischang:
A Variational Signal-Space Distance Measure for Nondispersive Optical Fiber. 141-145 - Siu-Wai Ho:
The Interplay Between Block Design and Channel Estimation in VLC Systems. 146-150 - Keigo Takeuchi:
A Unified Framework of State Evolution for Message-Passing Algorithms. 151-155 - Mahdi Cheraghchi, João Ribeiro:
Simple Codes and Sparse Recovery with Fast Decoding. 156-160 - Mengke Lian, Fabrizio Carpi, Christian Häger, Henry D. Pfister:
Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation. 161-165 - Serdar Sahin, Antonio Maria Cipriano, Charly Poulliat, Marie-Laure Boucheret:
Evolution Analysis of Iterative BICM Receivers with Expectation Propagation over ISI Channels. 166-170 - Ali Gholami, Mohammad Ali Maddah-Ali, Seyed Abolfazl Motahari:
Private Shotgun DNA Sequencing. 171-175 - Praveen Venkatesh, Sanghamitra Dutta, Pulkit Grover:
How should we define Information Flow in Neural Circuits? 176-180 - Sundara Rajan Srinivasavaradhan, Michelle Du, Suhas N. Diggavi, Christina Fragouli:
Symbolwise MAP for Multiple Deletion Channels. 181-185 - Gabriel Schamberg, Todd P. Coleman:
On the Bias of Directed Information Estimators. 186-190 - Fei Wei, Michael Langberg, Michelle Effros:
A Local Perspective on the Edge Removal Problem. 191-195 - Xuan Guang, Raymond W. Yeung:
Local-Encoding-Preserving Secure Network Coding for Fixed Dimension. 201-205 - Yirui Liu, John MacLaren Walsh:
On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region. 206-210 - Michelle Kleckler, Soheil Mohajer:
Secure Determinant Codes: A Class of Secure Exact-Repair Regenerating Codes. 211-215 - Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Qingfeng Zhou:
New Regenerating Codes over Binary Cyclic Codes. 216-220 - Nitish Mital, Katina Kralevska, Cong Ling, Deniz Gündüz:
Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes. 221-225 - Zitan Chen, Alexander Barg:
Explicit constructions of MSR codes for the rack-aware storage model. 226-230 - Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
Second-Order Asymptotically Optimal Statistical Classification. 231-235 - Matthew Aldridge:
Rates of Adaptive Group Testing in the Linear Regime. 236-240 - Peter Harremoës:
The Rate Distortion Test of Normality. 241-245 - Yu Xiang:
Distributed False Discovery Rate Control with Quantization. 246-249 - Dawei Ding, Yihui Quek, Peter W. Shor, Mark M. Wilde:
Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback. 250-254 - Haobo Li, Ning Cai:
A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity. 255-259 - Mario Berta, Francesco Borderi, Omar Fawzi, Volkher B. Scholz:
Quantum Coding via Semidefinite Programming. 260-264 - Michael X. Cao, Pascal O. Vontobel:
Optimizing Bounds on the Classical Information Rate of Quantum Channels with Memory. 265-269 - Mari Kobayashi, Hassan Hamad, Gerhard Kramer, Giuseppe Caire:
Joint State Sensing and Communication over Memoryless Multiple Access Channels. 270-274 - Michael Dikshtein, Anelia Somekh-Baruch, Shlomo Shamai Shitz:
Broadcasting Information subject to State Masking over a MIMO State Dependent Gaussian Channel. 275-279 - Viswanathan Ramachandran, Sibi Raj B. Pillai, Vinod M. Prabhakaran:
Message and State Communication over Channels with Action Dependent States. 280-284 - Yinfei Xu, Jian Lu, Guojun Chen:
Constrained Communication Over the Gaussian Dirty Paper Channel. 285-289 - Ehsan Asadi Kangarshahi, Albert Guillén i Fàbregas:
An Upper Bound to the Mismatch Capacity. 287-2877 - Maria Abu Sini, Eitan Yaakobi:
Reconstruction of Sequences in DNA Storage. 290-294 - Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
The Levenshtein's Channel and the List Size in Information Retrieval. 295-299 - Yuanyuan Tang, Yonatan Yehezkeally, Moshe Schwartz, Farzad Farnoud Hassanzadeh:
Single-Error Detection and Correction for Duplication and Substitution Channels. 300-304 - Bagus Santoso, Yasutada Oohama:
Secure Broadcasting of Two Encrypted Sources under Side-Channel Attacks. 305-309 - Éloi de Chérisey, Sylvain Guilley, Olivier Rioul, Pablo Piantanida:
An Information-Theoretic Model for Side-Channel Attacks in Embedded Hardware. 310-315 - Alireza Poostindouz, Reihaneh Safavi-Naini:
Wiretap Secret Key Capacity of Tree-PIN. 315-319 - Dakota Flanary, Benjamin Jensen, Bradford Clark, Kalin Norman, Nathan Nelson, Michael Rice, Willie K. Harrison:
Manufacturing an Erasure Wiretap Channel from Channel Sounding Measurements. 320-324 - Ali Maatouk, Mohamad Assaad, Anthony Ephremides:
Age of Information With Prioritized Streams: When to Buffer Preempted Packets? 325-329 - Antzela Kosta, Nikolaos Pappas, Anthony Ephremides, Vangelis Angelakis:
Queue Management for Age Sensitive Status Updates. 330-334 - Elie Najm, Emre Telatar, Rajai Nasser:
Optimal Age over Erasure Channels. 335-339 - Rajat Talak, Eytan H. Modiano:
Age-Delay Tradeoffs in Single Server Systems. 340-344 - Rajat Talak, Sertac Karaman, Eytan H. Modiano:
When a Heavy Tailed Service Minimizes Age of Information. 345-349 - Fatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh, Alex Sprintson:
Single-Server Single-Message Online Private Information Retrieval with Side Information. 350-354 - Mohammad Hossein Mousavi, Mohammad Ali Maddah-Ali, Mahtab Mirmohseni:
Private Inner Product Retrieval for Distributed Machine Learning. 355-359 - Nikita Polyanskii, Ilya Vorobyev:
Constructions of Batch Codes via Finite Geometry. 360-364 - Qiwen Wang, Hua Sun, Mikael Skoglund:
Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness. 365-369 - Ruida Zhou, Chao Tian, Tie Liu, Hua Sun:
Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size. 370-374 - Hong Hu, Yue M. Lu:
Asymptotics and Optimal Designs of SLOPE for Sparse Linear Regression. 375-379 - Holger Boche, Ullrich J. Mönich:
Turing Computability of the Fourier Transform of Bandlimited Functions. 380-384 - Nir Shlezinger, Salman Salamatian, Yonina C. Eldar, Muriel Médard:
Joint Sampling and Recovery of Correlated Sources. 385-389 - Salman Salamatian, Nir Shlezinger, Yonina C. Eldar, Muriel Médard:
Task-Based Quantization for Recovering Quadratic Functions Using Principal Inertia Components. 390-394 - Sattar Vakili, Qing Zhao:
A Random Walk Approach to First-Order Stochastic Convex Optimization. 395-399 - Galen Reeves, Vaishakhi Mayya, Alexander Volfovsky:
The Geometry of Community Detection via the MMSE Matrix. 400-404 - Jean Barbier, Chun Lam Chan, Nicolas Macris:
Mutual Information for the Stochastic Block Model by the Adaptive Interpolation Method. 405-409 - Chung Chan, Ali Al-Bashabsheh, Da Sun Handason Tam, Chao Zhao:
Finding Better Web Communities in Digraphs via Max-Flow Min-Cut. 410-414 - Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann:
Exact Recovery for a Family of Community-Detection Generative Models. 415-419 - Mohammad Esmaeili, Hussein Saad, Aria Nosratinia:
Community Detection with Side Information via Semidefinite Programming. 420-424 - Shan Lu, Wei Hou, Jun Cheng, Hiroshi Kamabe:
Multi-User UD k-Ary Codes Recursively Constructed from Short-Length Multiary Codes for Multiple-Access Adder Channel. 425-429 - Ilias Zadik, Yury Polyanskiy, Christos Thrampoulidis:
Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities. 430-434 - Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Multiple Access Channels with Adversarial Users. 435-439 - Suhas S. Kowshik, Yury Polyanskiy:
Quasi-static fading MAC with many users and finite payload. 440-444 - Uzi Pereg, Yossef Steinberg:
The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints. 445-449 - Xuan He, Kui Cai, Wentu Song, Zhen Mei:
Dynamic Programming for Quantization of q-ary Input Discrete Memoryless Channels. 450-454 - Xiaojie Wang, Chulong Liang, Li Ping, Stephan ten Brink:
Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation. 455-459 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire:
Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Networks. 460-464 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire:
On the Multicast Capacity of Full-Duplex 1-2-1 Networks. 465-469 - Holger Boche, Rafael F. Schaefer, H. Vincent Poor:
Identification Capacity of Correlation-Assisted Discrete Memoryless Channels: Analytical Properties and Representations. 470-474 - Robert Graczyk, Amos Lapidoth:
Two-Stage Guessing. 475-479 - Ken R. Duffy, Muriel Médard:
Guessing random additive noise decoding with soft detection symbol reliability information - SGRAND. 480-484 - Neri Merhav, Asaf Cohen:
Universal Randomized Guessing with Application to Asynchronous Decentralized Brute - Force Attacks. 485-489 - Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo:
The Hat Guessing Number of Graphs. 490-494 - Pantelimon George Popescu, Marios Omar Choudary:
Refinement of Massey Inequality : (To Nicolae Ţăpuş on his 70th birthday). 495-496 - Ahmed Douik, Babak Hassibi:
Non-Negative Matrix Factorization via Low-Rank Stochastic Manifold Optimization. 497-501 - Eric Graves, Qiang Ning, Prithwish Basu:
An information theoretic model for summarization, and some basic results. 502-506 - Nandan Sriranga, Chandra R. Murthy, Vaneet Aggarwal:
A Method to Improve Consensus Averaging using Quantized ADMM. 507-511 - Shirin Jalali, Xin Yuan:
Solving linear inverse problems using generative models. 512-516 - Lakshmi Natarajan, Hoang Dau, Prasad Krishnan, V. Lalitha:
Locality in Index Coding for Large Min-Rank. 517-521 - Lawrence Ong, Badri N. Vellambi, Jörg Kliewer:
Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers. 522-526 - Shanuja Sasi, B. Sundar Rajan:
Code Construction for Pliable Index Coding. 527-531 - Tang Liu, Daniela Tuninetti:
Decentralized Pliable Index Coding. 532-536 - Joseph Geumlek, Kamalika Chaudhuri:
Profile-based Privacy for Locally Private Computations. 537-541 - Kangwook Lee, Hoon Kim, Kyungmin Lee, Changho Suh, Kannan Ramchandran:
Synthesizing Differentially Private Datasets using Random Mixing. 542-546 - Yuuya Yoshida, Man-Hong Yung, Masahito Hayashi:
Optimal Mechanism for Randomized Responses under Universally Composable Security Measure. 547-551 - Hsiang Hsu, Shahab Asoodeh, Flávio P. Calmon:
Information-Theoretic Privacy Watchdogs. 552-556 - Maryam Hosseini, Narayana Santhanam:
Tail redundancy and its characterizations of universal compression. 557-561 - Boris Ryabko:
Time-universal data compression and prediction. 562-566 - Jorge F. Silva, Pablo Piantanida:
Universal D-Semifaithfull Coding for Countably Infinite Alphabets. 567-571 - Shashank Vatedka, Aslan Tchamkerten:
Local Decoding and Update of Compressed Data. 572-576 - Hao Wang, Mario Díaz, José Cândido Silveira Santos Filho, Flávio P. Calmon:
An Information-Theoretic View of Generalization via Wasserstein Distance. 577-581 - Ibrahim Issa, Amedeo Roberto Esposito, Michael Gastpar:
Strengthened Information-theoretic Bounds on the Generalization Error. 582-586 - Yuheng Bu, Shaofeng Zou, Venugopal V. Veeravalli:
Tightening Mutual Information Based Bounds on Generalization Error. 587-591 - Hang Zhang, Afshin Abdi, Faramarz Fekri:
Compressive Sensing with a Multiple Convex Sets Domain. 592-596 - Abbas Khalili, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems. 597-601 - Abbas Khalili, Farhad Shirani, Elza Erkip, Yonina C. Eldar:
On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers. 602-606 - Ahmed Arafa, Jing Yang, Sennur Ulukus, H. Vincent Poor:
Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor. 607-611 - Alejandro Lancho, Johan Östman, Giuseppe Durisi, Tobias Koch, Gonzalo Vazquez-Vilar:
Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading Channels. 612-616 - Allison Beemer, Oliver Kosut, Jörg Kliewer, Eric Graves, Paul L. Yu:
Structured Coding for Authentication in the Presence of a Malicious Adversary. 617-621 - Dimiter Ostrev:
Composable, Unconditionally Secure Message Authentication without any Secret Key. 622-626 - Sagnik Bhattacharya, Amitalok J. Budkuley, Sidharth Jaggi:
Shared Randomness in Arbitrarily Varying Channels. 627-631 - Xishi Nicholas Wang, Amitalok J. Budkuley, Andrej Bogdanov, Sidharth Jaggi:
When are large codes possible for AVCs? 632-636 - Seyed Ali Ossia, Borzoo Rassouli, Hamed Haddadi, Hamid R. Rabiee, Deniz Gündüz:
Privacy Against Brute-Force Inference Attacks. 637-641 - Jiachun Liao, Lalitha Sankar, Oliver Kosut, Flávio P. Calmon:
Robustness of Maximal α-Leakage to Side Information. 642-646 - Shigeaki Kuzuoka:
On the Conditional Smooth Rényi Entropy and Its Application in Guessing. 647-651 - Shota Saito, Toshiyasu Matsushima:
Non-Asymptotic Fundamental Limits of Guessing Subject to Distortion. 652-656 - Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai Shitz:
The Dirty Paper Wiretap Feedback Channel with or without Action on the State. 657-661 - Hao Ge, Randall A. Berry:
Quantized Mechanisms for Gaussian Multiple Access Wiretap Channels. 662-666 - Jinyuan Chen, Chunhua Geng:
Optimal Secure GDoF of Symmetric Gaussian Wiretap Channel with a Helper. 667-671 - Rémi A. Chou, Aylin Yener:
The Degraded Gaussian Many-Access Wiretap Channel. 672-676 - Hadi Reisizadeh, Mohammad Ali Maddah-Ali, Soheil Mohajer:
Subspace Coding for Coded Caching: Decentralized and Centralized Placements Meet for Three Users. 677-681 - Hari Hara Suthan Chittoor, Bhavana M, Prasad Krishnan:
Coded Caching via Projective Geometry: A new low subpacketization scheme. 682-686 - Jinbei Zhang, Xiaojun Lin, Chih-Chun Wang:
Closing the Gap for Coded Caching with Distinct File Sizes. 687-691 - Kai Wan, Daniela Tuninetti, Mingyue Ji, Giuseppe Caire:
On Coded Caching with Correlated Files. 692-696 - Emmanuel Abbe, Enric Boix Adserà:
Subadditivity Beyond Trees and the Chi-Squared Mutual Information. 697-701 - Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
An Information Theoretic Approach to Probability Mass Function Truncation. 702-706 - Matthew G. Reyes, David L. Neuhoff:
Monotonicity of Entropy in Positively Correlated Ising Trees. 707-711 - Md Mahmudul Hasan, Shuangqing Wei, Ali Moharrer:
Algebraic Properties of Wyner Common Information Solution under Graphical Constraints. 712-716 - Dong-Jun Han, Jy-yong Sohn, Jaekyun Moon:
Coded Distributed Computing over Packet Erasure Channels. 717-721 - Muah Kim, Jy-yong Sohn, Jaekyun Moon:
Coded Matrix Multiplication on a Group-Based Model. 722-726 - Yasuo Matsuyama:
Divergence Family Attains Blockchain Applications via α-EM Algorithm. 727-731 - Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model at Low Temperature. 732-736 - Seyed Pooya Shariatpanahi, Jingjing Zhang, Osvaldo Simeone, Babak Hossein Khalaj, Mohammad Ali Maddah-Ali:
Cloud-Aided Interference Management with Cache-Enabled Edge Nodes and Users. 737-741 - Nir Shlezinger, Emeka Abakasanga, Ron Dabora, Yonina C. Eldar:
On the Capacity of Sampled Interference-Limited Communications Channels. 742-746 - Jean de Dieu Mutangana, Ravi Tandon:
Interference Channels with Confidential Messages: Leveraging OFDM Transmission to Scale up Secure Degrees of Freedom with No CSIT. 747-751 - Ragini Chaluvadi, Bolli Madhuri, Srikrishna Bhashyam:
Channel Conditions for the Optimality of Interference Decoding Schemes for K-user Gaussian Interference Channels. 752-756 - Andreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh, Eitan Yaakobi:
Anchor-Based Correction of Substitutions in Indexed Sets. 757-761 - Ilan Shomorony, Reinhard Heckel:
Capacity Results for the Noisy Shuffling Channel. 762-766 - Jin Sima, Netanel Raviv, Jehoshua Bruck:
On Coding Over Sliced Information. 767-771 - Yeow Meng Chee, Han Mao Kiah, Tuan Thanh Nguyen:
Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data Storage. 772-776 - Luca Barletta, Stefano Rini:
On the Degrees of Freedom of the Oversampled Wiener Phase Noise Channel. 777-781 - Chirag C. Shetty, Kamal Singh, Sibi Raj B. Pillai:
On Decentralized Power Control for Ergodic MIMO Multiple Access Channels. 782-786 - Liyan Xie, Yao Xie, George V. Moustakides:
Asynchronous Multi-Sensor Change-Point Detection for Seismic Tremors. 787-791 - Jesús Rodríguez Sánchez, Juan Vidal Alegría, Fredrik Rusek:
Decentralized Massive MIMO Systems: Is There Anything to be Discussed? 787-791 - Yunseo Nam, Heedong Do, Yo-Seb Jeon, Namyoon Lee:
Capacity Analysis of MISO Channels with One-Bit Transceiver. 792-796 - Ertem Tuncel:
On Error Exponents Under A Privacy-Preserving Voting Regime. 797-801 - Neri Merhav:
False-Accept/False-Reject Trade-offs for Ensembles of Biometric Authentication Systems. 802-806 - Rémi A. Chou:
Biometric Systems with Multiuser Access Structures. 807-811 - Vamoua Yachongka, Hideki Yagi:
Identification, Secrecy, Template, and Privacy-Leakage of Biometric Identification System under Noisy Enrollment. 812-816 - Carolina Naim, Fangwei Ye, Salim El Rouayheb:
ON-OFF Privacy with Correlated Requests. 817-821 - Moritz Wiese, Holger Boche:
A Graph-Based Modular Coding Scheme Which Achieves Semantic Security. 822-826 - Willie K. Harrison, Matthieu R. Bloch:
Attributes of Generators for Best Finite Blocklength Coset Wiretap Codes over Erasure Channels. 827-831 - Xavier Coiteux-Roy, Stefan Wolf:
Proving Erasure. 832-836 - Ziv Aharoni, Oron Sabag, Haim H. Permuter:
Computing the Feedback Capacity of Finite State Channels using Reinforcement Learning. 837-841 - Parthe Pandit, Mojtaba Sahraee, Sundeep Rangan, Alyson K. Fletcher:
Asymptotics of MAP Inference in Deep Networks. 842-846 - Jin Sima, Jehoshua Bruck:
Optimal k-Deletion Correcting Codes. 847-851 - M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar:
A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures. 852-856 - Beongjun Choi, Jy-yong Sohn, Dong-Jun Han, Jaekyun Moon:
Scalable Network-Coded PBFT Consensus Algorithm. 857-861 - Han Cai, Tuvi Etzion, Moshe Schwartz, Antonia Wachter-Zeh:
Network Coding Solutions for the Combination Network and its Subgraphs. 862-866 - Mahesh Babu Vaddi, B. Sundar Rajan:
Weight Enumerating Function, Number of Full Rank Sub-matrices and Network Coding. 867-871 - Sagnik Bhattacharya, Adrish Banerjee:
A method to find the volume of a sphere in the Lee metric, and its applications. 872-876 - Elsa Dupraz, Lav R. Varshney:
Binary Recursive Estimation on Noisy Hardware. 877-881 - Neri Merhav:
Trading off Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation. 882-886 - Vladislav Z. B. Tadic, Arnaud Doucet:
Asymptotic Properties of Recursive Particle Maximum Likelihood Estimation. 887-891 - Ziv Goldfeld, Kristjan H. Greenewald, Jonathan Weed, Yury Polyanskiy:
Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian Convolutions. 892-896 - Dhruva Kartik, Ashutosh Nayyar, Urbashi Mitra:
Active Hypothesis Testing: Beyond Chernoff-Stein. 897-901 - Jun Muramatsu, Shigeki Miyake:
Stochastic Decision with Stationary Memoryless Sequence. 902-906 - Lele Wang, Ofer Shayevitz:
Adaptive Sequence Phase Detection. 907-911 - Yahya H. Ezzeldin, Christina Fragouli, Suhas N. Diggavi:
Quantizing Signals for Linear Classification. 912-916 - Christopher Rose, I. Saira Mian:
A General Upper Bound on Point-to-Point Particle Timing Channel Capacity Under Constant Particle Emission Intensity. 917-921 - David L. Rodríguez-Sarmiento, M. E. Duarte-González, T. Rodríguez-Quiñones, Reginaldo Palazzo Júnior:
Procedure for Identifying Odd-sized Nucleotide Sequences as Codewords of BCH Codes over GF(4). 922-926 - Mladen Kovacevic, Sanja Brdar, Vladimir S. Crnojevic:
Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement. 927-931 - Ohad Elishco, Ryan Gabrys, Muriel Médard, Eitan Yaakobi:
Repeat-Free Codes. 932-936 - Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel:
Second-Order Characterizations via Partial Smoothing. 937-941 - Cheuk Ting Li, Venkat Anantharam:
A Unified Framework for One-shot Achievability via the Poisson Matching Lemma. 942-946 - Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. 947-951 - Masahito Hayashi:
Semi-Finite Length Analysis for Secure Random Number Generation. 952-956 - Xuehe Wang, Lingjie Duan:
Dynamic Pricing for Controlling Age of Information. 962-966 - Himanshu Tyagi, Shun Watanabe:
A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem. 967-971 - Serkan Sariotakas, Philippe Furrer, Sinan Gezici, Tamás Linder, Serdar Yüksel:
On the Number of Bins in Equilibria for Signaling Games. 972-976 - Ishaque Ashar Kadampot, Mehrdad Tahmasbi, Matthieu R. Bloch:
Codes for Covert Communication over Additive White Gaussian Noise Channels. 977-981 - Mehrasa Ahmadipour, Sadaf Salehkalaibar, Mohammad Hossein Yassaee, Vincent Y. F. Tan:
Covert Communication Over a Compound Discrete Memoryless Channel. 982-986 - Ori Shmuel, Asaf Cohen, Omer Gurewitz, Alejandro Cohen:
Multi-Antenna Jamming in Covert Communication. 987-991 - Qiaosheng Eric Zhang, Matthieu R. Bloch, Mayank Bakshi, Sidharth Jaggi:
Undetectable Radios: Covert Communication under Spectral Mask Constraints. 992-996 - Anshuka Rangi, Massimo Franceschetti:
Towards a Non-Stochastic Information Theory. 997-1001 - Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang:
The Interplay of Causality and Myopia in Adversarial Channel Models. 1002-1006 - Yonglong Li, Guangyue Han, Paul H. Siegel:
On the Capacity of the Flash Memory Channel with Inter-cell Interference. 1007-1011 - Irina E. Bocharova, Boris D. Kudryashov, Maben Rabi, Nikita Lyamin, Wouter Dankers, Erik Frick, Alexey V. Vinel:
Modeling Packet Losses in Communication Networks. 1012-1016 - Roy D. Yates, Jing Zhong, Wuyang Zhang:
Updates with Multiple Service Classes. 1017-1021 - Yi-Hsuan Tseng, Yu-Pin Hsu:
Online Energy-Efficient Scheduling for Timely Information Downloads in Mobile Networks. 1022-1026 - Haoyue Tang, Jintao Wang, Zihan Tang, Jian Song:
Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks with Random Updates. 1027-1031 - Sandeep Banik, Sanjit K. Kaul, P. B. Sujit:
Minimizing Age in Gateway Based Update Systems. 1032-1036 - Zhiyuan Jiang, Sheng Zhou:
Status from a Random Field: How Densely Should One Update? 1037-1041 - Anoosheh Heidarzadeh, Swanand Kadhe, Salim Y. El Rouayheb, Alex Sprintson:
Single-Server Multi-Message Individually-Private Information Retrieval with Side Information. 1042-1046 - Jingke Xu, Yaqian Zhang, Zhifang Zhang:
A Capacity-Achieving T-PIR Scheme Based On MDS Array Codes. 1047-1051 - Nicholas Woolsey, Rong-Rong Chen, Mingyue Ji:
A New Design of Private Information Retrieval for Storage Constrained Databases. 1052-1056 - Umberto Martínez-Peñas:
Private Information Retrieval from Locally Repairable Databases with Colluding Servers. 1057-1061 - Yeow Meng Chee, Han Mao Kiah, Eitan Yaakobi, Hui Zhang:
A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes. 1062-1066 - Jie Li, Xiaohu Tang:
Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth. 1067-1071 - Michel Kulhandjian, Hovannes Kulhandjian, Claude D'Amours:
Improved Soft Decoding of Reed-Solomon Codes on Gilbert-Elliott Channels. 1072-1076 - Venkatesan Guruswami, Haotian Jiang:
Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization. 1077-1081 - Viduranga Bandara Wijekoon, Hoang Dau, Emanuele Viterbo:
Iterative Decoding of Reed-Solomon Codes based on Non-binary Matrices. 1082-1086 - Weiqi Li, Hoang Dau, Zhiying Wang, Hamid Jafarkhani, Emanuele Viterbo:
On the I/O Costs in Repairing Short-Length Reed-Solomon Codes. 1087-1091 - Malihe Aliasgari, Osvaldo Simeone, Jörg Kliewer:
Distributed and Private Coded Matrix Computation with Flexible Communication Load. 1092-1096 - Minchul Kim, Jungwoo Lee:
Private Secure Coded Computation. 1097-1101 - Qian Yu, Amir Salman Avestimehr:
Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation. 1102-1106 - Rafael G. L. D'Oliveira, Salim El Rouayheb, David A. Karpuk:
GASP Codes for Secure Distributed Matrix Multiplication. 1107-1111 - Saeid Sahraei, Amir Salman Avestimehr:
INTERPOL: Information Theoretically Verifiable Polynomial Evaluation. 1112-1116 - Gautam Aishwarya, Mokshay Madiman:
Remarks on Rényi versions of conditional entropy and mutual information. 1117-1121 - Maciej Skórski:
Strong Chain Rules for Min-Entropy under Few Bits Spoiled. 1122-1126 - Massimiliano Rossi:
Greedy additive approximation algorithms for minimum-entropy coupling problem. 1127-1131 - Mohammad Mahdi Mojahedian, Salman Beigi, Amin Gohari, Mohammad Hossein Yassaee, Mohammad Reza Aref:
A Correlation Measure Based on Vector-Valued Lp Norms. 1132-1136 - Jiange Li, Arnaud Marsiglietti, James Melbourne:
Entropic Central Limit Theorem for Rényi Entropy. 1137-1141 - Hao-Chung Cheng, Eric P. Hanson, Nilanjana Datta, Min-Hsiu Hsieh:
Duality between source coding with quantum side information and c-q channel coding. 1142-1146 - Zahra Baghali Khanian, Andreas J. Winter:
Entanglement-Assisted Quantum Data Compression. 1147-1151 - Zahra Baghali Khanian, Andreas J. Winter:
Distributed Compression of Correlated Classical-Quantum Sources. 1152-1156 - Nilanjana Datta, Christoph Hirche, Andreas J. Winter:
Convexity and Operational Interpretation of the Quantum Information Bottleneck Function. 1157-1161 - Mohsen Heidari, Touheed Anwar Atif, S. Sandeep Pradhan:
Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion Theory. 1162-1166 - Ali Bereyhi, Saba Asaad, Bernhard Gäde, Ralf R. Müller:
RLS-Based Detection for Massive Spatial Modulation MIMO. 1167-1171 - Aymen Askri, Ghaya Rekaya-Ben Othman:
DNN assisted Sphere Decoder. 1172-1176 - Fan Zhang, Aria Nosratinia:
The Degrees of Freedom of MIMO Relay under Coherence Diversity. 1177-1181 - Lu Wei:
Ergodic MIMO Mutual Information: Twenty Years After Emre Telatar. 1182-1186 - Mohammad Nur Hasan, Brian M. Kurkoski, Amin Sakzad, Emanuele Viterbo:
Orthogonal Precoder for Integer-Forcing MIMO. 1187-1191 - Mohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan:
Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity. 1192-1196 - Germán Bassi, Mikael Skoglund:
On the Mutual Information of Two Boolean Functions, with Application to Privacy. 1197-1201 - Hengjie Yang, Richard D. Wesel:
On the Most Informative Boolean Functions of the Very Noisy Channel. 1202-1206 - Orhan Ocal, Swanand Kadhe, Kannan Ramchandran:
Low-degree Pseudo-Boolean Function Recovery Using Codes. 1207-1211 - Youle Xu, Qichun Wang:
Searching for Highly Nonlinear DPA-Resistant Balanced Boolean Functions in the Rotation Symmetric Class. 1212-1216 - Nujoom Sageer Karat, Spandan Dey, Anoop Thomas, B. Sundar Rajan:
An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches. 1217-1221 - Mohamed Salman, Mahesh K. Varanasi:
The Exact Capacity-Memory Tradeoff for Caching with Uncoded Prefetching in the Two-Receiver Gaussian Broadcast Channel. 1222-1226 - Shailja Agrawal, K. V. Sushena Sree, Prasad Krishnan:
Coded Caching based on Combinatorial Designs. 1227-1231 - Kota Srinivas Reddy, Nikhil Karamchandani:
Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement. 1232-1236 - Chinmayananda Arunachala, B. Sundar Rajan:
Optimal Scalar Linear Codes for a Class of Jointly Extended Groupcast Index Coding Problems. 1237-1241 - Yucheng Liu, Parastoo Sadeghi:
Generalized Alignment Chain: Improved Converse Results for Index Coding. 1242-1246 - Mahesh Babu Vaddi, B. Sundar Rajan:
Reduced Complexity Index Codes and Improved Upperbound on Broadcast Rate for Neighboring Interference Problems. 1247-1251 - Mahesh Babu Vaddi, B. Sundar Rajan:
A Generalisation of Interlinked Cycle Structures and Their Index Coding Capacity. 1252-1256 - Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
Weakly-Private Information Retrieval. 1257-1261 - Islam Samy, Ravi Tandon, Loukas Lazos:
On the Capacity of Leaky Private Information Retrieval. 1262-1266 - Karim Banawan, Batuhan Arasli, Yi-Peng Wei, Sennur Ulukus:
Private Information Retrieval from Heterogeneous Uncoded Caching Databases. 1267-1271 - Karim Banawan, Sennur Ulukus:
Private Information Retrieval from Non-Replicated Databases. 1272-1276 - Reza Khosravi-Farsani:
New Sum-Rate Capacity Results for Multi-User Interference Channels. 1277-1281 - Subhajit Majhi, Patrick Mitran:
On the Capacity of Gaussian Multiple-Access Interference Channels. 1282-1286 - Xinping Yi, Hua Sun:
Opportunistic Topological Interference Management. 1287-1291 - Amir Leshem, Uri Erez:
Ergodic Spatial Nulling for Achieving Interference Free Rates. 1292-1296 - Burak Çakmak, Manfred Opper:
Convergent Dynamics for Solving the TAP Equations of Ising Models with Arbitrary Rotation Invariant Coupling Matrices. 1297-1301 - Gautam Dasarathy:
Gaussian Graphical Model Selection from Size Constrained Measurements. 1302-1306 - Saurabh Sihag, Ali Tajer:
Structure Learning of Similar Ising Models: Information-theoretic Bounds. 1307-1311 - Vincenzo Matta, Augusto Santos, Ali H. Sayed:
Graph Learning with Partial Observations: Role of Degree Concentration. 1312-1316 - Arezou Rezazadeh, Josep Font-Segura, Alfonso Martinez, Albert Guillén i Fàbregas:
Joint Source-Channel Coding for the Multiple-Access Channel with Correlated Sources. 1317-1321 - Jian-Jian Weng, Fady Alajaji, Tamás Linder:
Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way Channels. 1322-1326 - Yashas Malur Saidutta, Afshin Abdi, Faramarz Fekri:
Joint Source-Channel Coding for Gaussian Sources over AWGN Channels using Variational Autoencoders. 1327-1331 - Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. 1332-1336 - Chentao Yue, Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic:
Hamming Distance Distribution of the 0-reprocessing Estimate of the Ordered Statistic Decoder. 1337-1341 - Christian Senger:
Improved Iterative Decoding of Product Codes Based on Trusted Symbols. 1342-1346 - Tarik Benaddi, Arti D. Yardi, Charly Poulliat, Iryna Andriyanova:
Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes. 1347-1351 - Xiao Ma, Wenchao Lin, Suihua Cai, Baodian Wei:
Statistical Learning Aided Decoding of BMST Tail-Biting Convolutional Code. 1352-1356 - Hikari Koremura, Haruhiko Kaneko:
Successive Cancellation Decoding of Polar Codes for Insertion/Deletion Error Correction. 1357-1361 - Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy:
Polar Codes for the Deletion Channel: Weak and Strong Polarization. 1362-1366 - Jin Sima, Jehoshua Bruck:
Correcting Deletions in Multiple-Heads Racetrack Memories. 1367-1371 - Mahed Abroshan, Ramji Venkataramanan, Lara Dolecek, Albert Guillén i Fàbregas:
Coding for Deletion Channels with Multiple Traces. 1372-1376 - Emirhan Gürpinar, Andrei E. Romashchenko:
How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. 1377-1381 - Lin Ling, Chee-Wei Tan, Siu-Wai Ho, Raymond W. Yeung:
Scalable Automated Proving of Information Theoretic Inequalities with Proximal Algorithms. 1382-1386 - Mohammad Hossein Yassaee:
Almost Exact Analysis of Soft Covering Lemma via Large Deviation. 1387-1391 - Xianming Liu, Ronit Bustin, Guangyue Han, Shlomo Shamai Shitz:
An Elementary Proof of a Classical Information-Theoretic Formula. 1392-1396 - Arman Fazeli, Alexander Vardy, Hanwen Yao:
Convolutional Decoding of Polar Codes. 1397-1401 - Barak Beilin, David Burshtein:
On Polar Coding for Binary Dirty Paper. 1402-1406 - David Tse, Bin Li, Kai Chen, Ling Liu, Jiaqi Gu:
Polar Coding for Parallel Gaussian Channels. 1407-1411 - Grigorii Trofimiuk, Peter Trifonov:
Reduced complexity window processing of binary polarization kernels. 1412-1416 - Shunsuke Horii, Takahiro Yoshida, Manabu Kobayashi, Toshiyasu Matsushima:
Distributed Stochastic Gradient Descent Using LDGM Codes. 1417-1421 - Eleftherios Lampiris, Daniel Jiménez Zorrilla, Petros Elia:
Mapping Heterogeneity Does Not Affect Wireless Coded MapReduce. 1422-1426 - Konstantinos Konstantinidis, Aditya Ramamoorthy:
CAMR: Coded Aggregated MapReduce. 1427-1431 - Mohammad Mohammadi Amiri, Deniz Gündüz:
Machine Learning at the Wireless Edge: Distributed Stochastic Gradient Descent Over-the-Air. 1432-1436 - David Gamarnik, Eren C. Kizildag:
High-Dimensional Linear Regression and Phase Retrieval via PSLQ Integer Relation Algorithm. 1437-1441 - Kohei Miyamoto, Andrew R. Barron, Jun'ichi Takeuchi:
Improved MDL Estimators Using Local Exponential Family Bundles Applied to Mixture Families. 1442-1446 - Puning Zhao, Lifeng Lai:
Minimax Regression via Adaptive Nearest Neighbor. 1447-1451 - Samet Oymak, Mehrdad Mahdavi, Jiasi Chen:
Learning Feature Nonlinearities with Regularized Binned Regression. 1452-1456 - Antonio Bazco Nogueras, Lorenzo Miretti, Paul de Kerret, David Gesbert, Nicolas Gresset:
Achieving Vanishing Rate Loss in Decentralized Network MIMO. 1457-1461 - Igor Burago, Marco Levorato:
Cloud-Assisted On-Sensor Observation Classification in Latency-Impeded IoT Systems. 1462-1466 - Roy Karasik, Osvaldo Simeone, Shlomo Shamai Shitz:
Latency Limits for Content Delivery in a Fog-RAN with D2D Communication. 1467-1471 - Shouvik Ganguly, Young-Han Kim:
Capacity Scaling for Cloud Radio Access Networks with Limited Orthogonal Fronthaul. 1472-1476 - Alexandr V. Kostochka, Xujun Liu, Roberto Assis Machado, Olgica Milenkovic:
Directed Intersection Representations and the Information Content of Digraphs. 1477-1481 - Rashad Eletreby, Osman Yagan:
On the Connectivity of Inhomogeneous Random K-out Graphs. 1482-1486 - Shahab Shams, Nicholas Ruozzi, Péter Csikvári:
Counting Homomorphisms in Bipartite Graphs. 1487-1491 - Shahar Stein Ioushua, Ofer Shayevitz:
Counting Graphs with a Given Degree Sequence: An Information-theoretic Perspective. 1492-1496 - Pin-Hsun Lin, Eduard A. Jorswieck, Carsten R. Janda, Martin Mittelbach, Rafael F. Schaefer:
On Stochastic Orders and Fading Gaussian Multi-User Channels with Statistical CSIT. 1497-1501 - Saeed Karimi-Bidhendi, Jun Guo, Hamid Jafarkhani:
Using Quantization to Deploy Heterogeneous Nodes in Two-Tier Wireless Sensor Networks. 1502-1506 - Shenghao Yang, Jie Wang, Yanyan Dong, Yiheng Zhang:
On the Capacity Scalability of Line Networks with Buffer Size Constraints. 1507-1511 - Takahiro Ota, Ryoji Nakamura, Akiko Manada:
A Fast Node Arrangement Algorithm of Wireless Sensor Networks for Two-dimensional Constraints. 1512-1516 - Krzysztof Turowski, Philippe Jacquet, Wojciech Szpankowski:
Asymptotics of Entropy of the Dirichlet-Multinomial Distribution. 1517-1521 - Hoover H. F. Yin, Ka Hei Ng, Yu Ting Shing, Russell W. F. Lai, Xishi Wang:
Decision Procedure for the Existence of Two-Channel Prefix-Free Codes. 1522-1526 - Kengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto:
Enumeration and Coding of Compact Code Trees for Binary AIFV Codes. 1527-1531 - Yanina Y. Shkel, Rick S. Blum, H. Vincent Poor:
Variable-length compression and secrecy by design. 1532-1536 - Carmen Sippel, Cornelia Ott, Sven Puchinger, Martin Bossert:
Reed-Solomon Codes over Fields of Characteristic Zero. 1537-1541 - Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore:
Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes. 1542-1546 - Jiongyue Xing, Li Chen, Martin Bossert:
Progressive Module Minimization for Re-encoding Transformed Soft Decoding of RS Codes. 1547-1551 - Welington Santos:
On Fractional Decoding of Reed-Solomon Codes. 1552-1556 - Bing Zhu, Kenneth W. Shum, Hui Li, Weiping Wang:
On the Optimal Reconstruction Degree of Fractional Repetition Codes. 1557-1561 - Ohad Elishco, Alexander Barg:
Capacity of dynamical storage systems. 1562-1566 - Bh. Rekha Devi, V. Lalitha:
On Epsilon-MSCR Codes for Two Erasures. 1567-1571 - Roberta Barbi, Pascal Felber, Laurent Hayez, Hugues Mercier:
Convolutional LPDC codes for Distributed Storage Systems. 1572-1576 - Zhengrui Li, Sian-Jheng Lin:
Update Bandwidth for Distributed Storage. 1577-1581 - Lev Yohananov, Yuval Efron, Eitan Yaakobi:
Double and Triple Node-Erasure-Correcting Codes over Graphs. 1582-1586 - Mladen Kovacevic:
Bounds on Codes for the Bit-Shift Channel with (d, k)-Constrained Inputs. 1587-1591 - Navin Kashyap, Ron M. Roth, Paul H. Siegel:
The Capacity of Count-Constrained ICI-Free Systems. 1592-1596 - Yeow Meng Chee, Han Mao Kiah, A. J. Han Vinck, Van Khu Vu, Eitan Yaakobi:
Coding for Write ℓ-step-up Memories. 1597-1601 - Zhijie Huang, Hong Jiang, Hao Che, Nong Xiao, Ning Li:
Efficient MDS Array Codes for Correcting Multiple Column Erasures. 1602-1606 - Giselle Strey, Antonio Campello, João E. Strapasson, Sueli I. R. Costa:
Perfect Codes in Euclidean Lattices: Bounds and Case Studies. 1607-1611 - Henrique K. Miyamoto, Henrique N. Sá Earp, Sueli I. R. Costa:
Constructive spherical codes in 2k dimensions. 1612-1616 - Hiroyoshi Morita:
Double Nearest-Neighbor Error Correcting Codes on Hexagonal Signal Constellation. 1617-1621 - Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel:
On the CVP for the root lattices via folding with deep ReLU neural networks. 1622-1626 - Yihan Zhang, Shashank Vatedka:
List Decoding Random Euclidean Codes and Infinite Constellations. 1627-1631 - Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Networks. 1632-1636 - Arash Gholami Davoodi, Syed Ali Jafar:
Degrees of Freedom Region of the (M, N1, N2) MIMO Broadcast Channel with Partial CSIT: An Application of Sum-set Inequalities. 1637-1641 - Mohamed Salman, Mahesh K. Varanasi:
Capacity Results via Message Merging and Superposition Coding in the K-Receiver Broadcast Channel with General Message Sets. 1642-1646 - Shih-Chun Lin, I-Hsiang Wang, Alireza Vahid:
No Feedback, No Problem: Capacity of Erasure Broadcast Channels with Single-User Delayed CSI. 1647-1651 - Shraga I. Bross:
Broadcasting Correlated Gaussians and Asymmetric Data Transmission. 1652-1656 - Anoosheh Heidarzadeh, Alex Sprintson:
Private Computation with Side Information: The Single-Server Case. 1657-1661 - Anoosheh Heidarzadeh, Fatemeh Kazemi, Alex Sprintson:
Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side Information. 1662-1666 - Behrooz Tahmasebi, Mohammad Ali Maddah-Ali:
Private Sequential Function Computation. 1667-1671 - Netanel Raviv, David A. Karpuk:
Private Polynomial Computation from Lagrange Encoding. 1672-1676 - Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Private Polynomial Computation for Noncolluding Coded Databases. 1677-1681 - Danny Dubé, Hidetoshi Yokoo:
Fast Construction of Almost Optimal Symbol Distributions for Asymmetric Numeral Systems. 1682-1686 - Danny Hucke, Markus Lohrey, Louisa Seelbach Benkner:
Entropy Bounds for Grammar-Based Tree Compressors. 1687-1691 - Shuqing Chen, Michelle Effros, Victoria Kostina:
Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios. 1692-1696 - Tomasz Luczak, Abram Magner, Wojciech Szpankowski:
Compression of Preferential Attachment Graphs. 1697-1701 - Yonatan Gutman, Adam Spiewak:
New Uniform Bounds for Almost Lossless Analog Compression. 1702-1706 - Allison Gagliano, Walter O. Krawec, Hasan Iqbal:
From Classical to Semi-Quantum Secure Communication. 1707-1711 - Farzin Salek, Min-Hsiu Hsieh, Javier R. Fonollosa:
Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast Channel. 1712-1716 - Holger Boche, Gisbert Janßen, Sajad Saeedinaeeni:
Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks. 1717-1721 - Holger Boche, Minglai Cai, Ning Cai:
Message Transmission over Classical Quantum Channels with a Jammer with Side Information, Correlation as Resource and Common Randomness Generating. 1722-1726 - Seunghoan Song, Masahito Hayashi:
Capacity of Quantum Private Information Retrieval with Multiple Servers. 1727-1731 - Enrico Paolini, Gianluigi Liva:
A Lower Bound on the Error Exponent of Linear Block Codes over the Erasure Channel. 1732-1736 - Han Mao Kiah, Anshoo Tandon, Mehul Motani:
Generalized Sphere-Packing Bound for Subblock-Constrained Codes. 1737-1741 - Jinming Wen, Xiao-Wen Chang, Jian Weng:
Improved Upper Bounds on the Hermite and KZ Constants. 1742-1746 - Peter G. Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova:
Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances. 1747-1751 - Yu Tsunoda, Yuichiro Fujiwara:
On the Maximum Number of Codewords of X-Codes of Constant Weight Three. 1752-1756 - Hanwen Yao, Arman Fazeli, Alexander Vardy:
Explicit Polar Codes with Small Scaling Exponent. 1757-1761 - Jaume del Olmo Alòs, Javier R. Fonollosa:
Polar Coding for Common Message Only Wiretap Broadcast Channel. 1762-1766 - Min Jang, Seok-Ki Ahn, Hongsil Jeong, Kyung-Joong Kim, Seho Myung, Sang-Hyo Kim, Kyeongcheol Yang:
Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination. 1767-1771 - Mohammad Rowshan, Emanuele Viterbo:
How to Modify Polar Codes for List Decoding. 1772-1776 - Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel:
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. 1777-1781 - Hyegyeong Park, Jaekyun Moon:
Irregular Product Coded Computation for High-Dimensional Matrix Multiplication. 1782-1786 - Netanel Raviv, Qian Yu, Jehoshua Bruck, Salman Avestimehr:
Download and Access Trade-offs in Lagrange Coded Computing. 1787-1791 - Suayb S. Arslan:
Distributed Matrix Multiplication with MDS Array BP-XOR Codes for Scaling Clusters. 1792-1796 - Gauri Jagatap, Chinmay Hegde:
Linearly Convergent Algorithms for Learning Shallow Residual Networks. 1797-1801 - Longyun Guo, Jean Honorio, John Morgan:
Cost-Aware Learning for Improved Identifiability with Multiple Experiments. 1802-1806 - Vinay A. Vaishampayan:
Classification in a Large Network. 1807-1811 - Youngjae Min, Hye Won Chung:
Shallow Neural Network can Perfectly Classify an Object following Separable Probability Distribution. 1812-1816 - Lin Zhou, Alfred O. Hero III:
Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information. 1817-1821 - Omer Bilgen, Aaron B. Wagner:
A New Proof for the Quadratic Gaussian Two-Encoder Source-Coding Problem. 1822-1826 - Sung Hoon Lim, Chen Feng, Adriano Pastore, Bobak Nazer, Michael Gastpar:
Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions. 1827-1831 - Yinfei Xu, Xuan Guang, Jian Lu:
Vector Gaussian Successive Refinement With Degraded Side Information. 1832-1836 - Mokshay Madiman, Piotr Nayar, Tomasz Tkocz:
On the question of the best additive noise among symmetric log-concave noises. 1837-1841 - Olivier Rioul, Ram Zamir:
Equality in the Matrix Entropy-Power Inequality and Blind Separation of Real and Complex sources. 1842-1846 - Venkat Anantharam, Varun S. Jog, Chandra Nair:
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. 1847-1851 - Nir Weinberger, Yuval Kochman, Michèle A. Wigger:
Exponent Trade-off for Hypothesis Testing Over Noisy Channels. 1852-1856 - Hang Zhang, Martin Slawski, Ping Li:
Permutation Recovery from Multiple Measurement Vectors in Unlabeled Sensing. 1857-1861 - Prafulla Chandra, Andrew Thangaraj:
Concentration and Tail Bounds for Missing Mass. 1862-1866 - Praneeth Narayanamurthy, Vahid Daneshpajooh, Namrata Vaswani:
Provable Subspace Tracking with Missing Entries. 1867-1871 - Emanuele Bellini, Florian Caullery, Philippe Gaborit, Marc Manzano, Víctor Mateu:
Improved Veron Identification and Signature Schemes in the Rank Metric. 1872-1876 - Haoyu Li, Renzhang Liu, Qutaibah M. Malluhi, Yanbin Pan, Yongge Wang, Tianyuan Xie:
Breaking HK17 in Practice. 1877-1881 - Irina E. Bocharova, Thomas Johansson, Boris D. Kudryashov:
Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem. 1882-1886 - Lukas Holzbaur, Hedongliang Liu, Sven Puchinger, Antonia Wachter-Zeh:
On Decoding and Applications of Interleaved Goppa Codes. 1887-1891 - Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz:
Computable Upper Bounds for Unifilar Finite-State Channels. 1892-1896 - Chengyu Wu, Guangyue Han, Brian H. Marcus:
A Deterministic Algorithm for the Capacity of Finite-State Channels. 1897-1901 - Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite States. 1902-1906 - Semih Yagli, Alex Dytso, H. Vincent Poor, Shlomo Shamai Shitz:
An Upper Bound on the Number of Mass Points in the Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel. 1907-1911 - Denis S. Krotov, Patrick Solé:
The punctured Dodecacode is uniformly packed. 1912-1916 - Denis S. Krotov:
On Dual Codes in the Doob Schemes. 1917-1921 - Martianus Frederic Ezerman, San Ling, Buket Özkaya, Jareena Tharnnukhroh:
Spectral Bounds for Quasi-Twisted Codes. 1922-1926 - Rodolfo Canto Torres, Jean-Pierre Tillich:
Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor. 1927-1931 - Peter Trifonov:
On Construction of Polar Subcodes with Large Kernels. 1932-1936 - Rajai Nasser:
On the Polarization Levels of Automorphic-Symmetric Channels. 1937-1941 - Thomas Wiegart, Tobias Prinz, Fabian Steiner, Peihong Yuan:
Design of Polar Codes for Parallel Channels with an Average Power Constraint. 1942-1946 - Valerio Bioglio, Ingmar Land, Carlo Condo:
Improved Hybrid Design of Polar Codes and Multi-Kernel Polar Codes. 1947-1951 - B. R. Vinay Kumar, Navin Kashyap:
Probabilistic Forwarding of Coded Packets on Networks. 1952-1956 - Hoover H. F. Yin, Ka Hei Ng, Xishi Wang, Qi Cao:
On the Minimum Delay of Block Interleaver for Batched Network Codes. 1957-1961 - Hoover H. F. Yin, Bin Tang, Ka Hei Ng, Shenghao Yang, Xishi Wang, Qiaoqiao Zhou:
A Unified Adaptive Recoding Framework for Batched Network Coding. 1962-1966 - Hoover H. F. Yin, Xiaoli Xu, Ka Hei Ng, Yong Liang Guan, Raymond W. Yeung:
Packet Efficiency of BATS Coding on Wireless Relay Network with Overhearing. 1967-1971 - Haoyu Fu, Yuejie Chi, Yingbin Liang:
Local Geometry of Cross Entropy Loss in Learning One-Hidden-Layer Neural Networks. 1972-1976 - Hui Xie, Jirong Yi, Weiyu Xu, Raghu Mudumbai:
An Information-Theoretic Explanation for the Adversarial Fragility of AI Classifiers. 1977-1981 - Shao-Lun Huang, Xiangxiang Xu, Lizhong Zheng, Gregory W. Wornell:
An Information Theoretic Interpretation to Deep Neural Networks. 1984-1988 - Changlong Wu, Narayana Santhanam:
Being correct eventually almost surely. 1989-1993 - Daming Cao, Lin Zhou, Vincent Y. F. Tan:
Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network. 1994-1998 - Minh Thanh Vu, Tobias J. Oechtering, Mikael Skoglund:
Operational Equivalence of Distributed Hypothesis Testing and Identification Systems. 1999-2003 - Sreejith Sreekumar, Deniz Gündüz:
Hypothesis Testing over a Noisy Channel. 2004-2008 - Derya Malak, Muriel Médard, Edmund M. Yeh:
Spatial Soft-Core Caching. 2009-2013 - Eleftherios Lampiris, Aly El Gamal, Petros Elia:
Wyner's Network on Caches: Combining Receiver Caching with a Flexible Backhaul. 2014-2018 - Ke Wang, Youlong Wu, Jiahui Chen, Haoyu Yin:
Reduce Transmission Delay for Caching-Aided Two-Layer Networks. 2019-2023 - Heping Wan, Anders Høst-Madsen, Aria Nosratinia:
Compress-and-Forward via Multilevel Coding. 2024-2028 - Alon Kipnis, Galen Reeves:
Gaussian Approximation of Quantization Error for Estimation from Compressed Data. 2029-2033 - Daewon Seo, Lav R. Varshney:
The CEO Problem with rth Power of Difference Distortion. 2034-2038 - Nirmal V. Shende, Aaron B. Wagner:
Functional Covering of Point Processes. 2039-2043 - Peida Tian, Victoria Kostina:
From Parameter Estimation to Dispersion of Nonstationary Gauss-Markov Processes. 2044-2048 - Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann:
Invariants and Inequivalence of Linear Rank-Metric Codes. 2049-2053 - Chunlei Li:
Interpolation-based Decoding of Nonlinear Maximum Rank Distance Codes. 2054-2058 - Jiun-Hung Yu, Hans-Andrea Loeliger:
Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials. 2059-2063 - Min Ye, Emmanuel Abbe:
Recursive projection-aggregation decoding of Reed-Muller codes. 2064-2068 - Hangjin Liu, Cynthia Rush, Dror Baron:
An Analysis of State Evolution for Approximate Message Passing with Side Information. 2069-2073 - Ehsan Abbasi, Fariborz Salehi, Babak Hassibi:
Sparse Covariance Estimation from Quadratic Measurements: A Precise Analysis. 2074-2078 - Yonatan Shadmi, Peter Jung, Giuseppe Caire:
Sparse Non-Negative Recovery from Shifted Symmetric Subgaussian Measurements using NNLS. 2079-2083 - Zhongxing Sun, Wei Cui, Yulong Liu:
Recovery of Structured Signals From Corrupted Non-Linear Measurements. 2084-2088 - Boaz Shuval, Ido Tal:
Universal Polarization for Processes with Memory. 2089-2093 - Mengfan Zheng, Ling Liu, Cong Ling:
On the Polarization of Rényi Entropy. 2094-2098 - Rajai Nasser:
On the Convergence of the Polarization Process in the Noisiness/Weak-∗ Topology. 2099-2103 - Ruslan Alexandrovich Morozov, Peter Trifonov:
A Lower Bound on Minimum Distance of Convolutional Polar Codes. 2104-2108 - Yuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki:
Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions. 2109-2113 - Yi-Peng Wei, Batuhan Arasli, Karim Banawan, Sennur Ulukus:
Private Information Retrieval from Decentralized Uncoded Caching Databases. 2114-2118 - Tuvi Etzion, Oliver W. Gnilke, David A. Karpuk, Eitan Yaakobi, Yiwei Zhang:
Private Proximity Retrieval. 2119-2123 - Xinyu Yao, Nan Liu, Wei Kang:
The Capacity of Multi-round Private Information Retrieval from Byzantine Databases. 2124-2128 - Yiwei Zhang, Eitan Yaakobi, Tuvi Etzion:
Bounds on the Length of Functional PIR and Batch Codes. 2129-2133 - Yiwei Zhang, Eitan Yaakobi, Tuvi Etzion, Moshe Schwartz:
On the Access Complexity of PIR Schemes. 2134-2138 - Ajaykrishnan Nageswaran, Prakash Narayan:
Predicate Privacy and List Privacy for a ρ-Recoverable Function. 2139-2143 - Joseph M. Renes:
Privacy Amplification, Lossy Compression, and their Duality to Channel Coding. 2144-2148 - Masahito Hayashi:
Secure list decoding. 2149-2153 - Miguel Arrieta, Iñaki Esnaola, Michelle Effros:
Universal Privacy Guarantees for Smart Meters. 2154-2158 - Sreejith Sreekumar, Deniz Gündüz:
Optimal Privacy-Utility Trade-off under a Rate Constraint. 2159-2163 - Kang-Hee Cho, Si-Hyeon Lee, Vincent Y. F. Tan:
Throughput Scaling of Covert Communication over Wireless Adhoc Networks. 2164-2168 - David Kibloff, Samir M. Perlaza, Ligong Wang:
Embedding Covert Information on a Given Broadcast Code. 2169-2173 - Jian Lu, Yinfei Xu, Ping Zhang, Qiao Wang:
Secure Multiterminal Source Coding With Actions. 2174-2178 - Mehrdad Tahmasbi, Matthieu R. Bloch:
Steganography Protocols for Quantum Channels. 2179-2183 - Mehrdad Tahmasbi, Matthieu R. Bloch, Aylin Yener:
In-Band Sensing of the Adversary's Channel for Secure Communication in Wireless Channels. 2184-2188 - Ashwin Verma, R. K. Bansal:
Sequential Change Detection Based on Universal Compression for Markov Sources. 2189-2193 - Javad Heydari, Ali Tajer:
Quickest Search for a Change Point. 2194-2198 - Taposh Banerjee, Prudhvi Gurram, Gene T. Whipps:
Bayesian Quickest Detection of Changes in Statistically Periodic Processes. 2204-2208 - Yu-Jui Huang, Shih-Chun Lin, Yu-Chih Huang:
On Byzantine Distributed Sequential Change Detection with Multiple Hypotheses. 2209-2213 - Cédric Bleuler, Amos Lapidoth, Christoph Pfister:
Gambling and Rényi Divergence. 2214-2218 - Hao-Chung Cheng, Gao Li, Min-Hsiu Hsieh:
Properties of Scaled Noncommutative Rényi and Augustin Information. 2219-2223 - Jiange Li, Arnaud Marsiglietti, James Melbourne:
Rényi Entropy Power Inequalities for s-concave Densities. 2224-2228 - Lei Yu, Vincent Y. F. Tan:
On Exact and ∞-Rényi Common Informations. 2229-2233 - Ryo Nomura:
Source resolvability problem with respect to a certain subclass of f-divergence. 2234-2238 - Anusha Lalitha, Anatoly Khina, Tara Javidi, Victoria Kostina:
Real-time Binary Posterior Matching. 2239-2243 - Christian Deppe, Vladimir S. Lebedev:
Algorithms for Q-ary Error-Correcting Codes with Partial Feedback and Limited Magnitude. 2244-2248 - Kenneth Palacio-Baus, Meysam Asadi, Natasha Devroye:
Error Exponents of Parallel Two-way Discrete Memoryless Channels using Variable Length Coding. 2249-2253 - Kenneth Palacio-Baus, Natasha Devroye:
Variable-length Coding Error Exponents for the AWGN Channel with Noisy Feedback at Zero-Rate. 2254-2258 - Oron Sabag, Haim H. Permuter, Shlomo Shamai Shitz:
Capacity-Achieving Coding Scheme for the MAC with Degraded Message Sets and Feedback. 2259-2263 - Cheng-Yu Pai, Yong-Ting Ni, Yen-Cheng Liu, Meng-Hsien Kuo, Chao-Yu Chen:
Constructions of Two-Dimensional Binary Z-Complementary Array Pairs. 2264-2268 - Dan Zhang:
Zero Correlation Zone Sequences from a Unified Construction of Perfect Polyphase Sequences. 2269-2273 - Min Zeng, Yuan Luo, Min Kyu Song, Hong-Yeop Song:
The FM-linear Complexity of M-ary Sidel'nikov Sequences of Period p - 1 = f • Mλ. 2274-2278 - Palash Sarkar, Sudhan Majhi, Zilong Liu:
A Direct and Generalized Construction of Polyphase Complementary Set With Low PMEPR. 2279-2283 - Shibsankar Das, Udaya Parampalli, Sudhan Majhi, Zilong Liu:
Near-Optimal Zero Correlation Zone Sequence Sets from Paraunitary Matrices. 2284-2288 - Yaniv Fogel, Meir Feder:
Universal Learning of Individual Data. 2289-2293 - Mohsen Ghassemi, Zahra Shakeri, Waheed U. Bajwa, Anand D. Sarwate:
Sample Complexity Bounds for Low-Separation-Rank Dictionary Learning. 2294-2298 - Vidya Muthukumar, Kailas Vodrahalli, Anant Sahai:
Harmless interpolation of noisy data in regression. 2299-2303 - Koby Bibas, Yaniv Fogel, Meir Feder:
A New Look at an Old Problem: A Universal Learning Approach to Linear Regression. 2304-2308 - Debaditya Chaudhuri, Michael Langberg, Michelle Effros:
Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. 2309-2313 - Shanuja Sasi, B. Sundar Rajan:
Optimal Index Codes for Some Interlinked Cycle Structures with Outer Cycles. 2314-2318 - Bhavana M, Prasad Krishnan:
On Index coding for Complementary Graphs with focus on Circular Perfect Graphs. 2319-2323 - Suman Ghosh, Lakshmi Natarajan:
Codes for Updating Linear Functions over Small Fields. 2324-2328 - Elad Romanov, Or Ordentlich:
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. 2329-2333 - Tetsunao Matsuta, Tomohiko Uyematsu:
On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree. 2334-2338 - Wei-Ning Chen, I-Hsiang Wang:
On the Price of Source Anonymity in Heterogeneous Parametric Point Estimation. 2339-2343 - Saurabh Sihag, Ali Tajer:
Secure Estimation under Causative Attacks. 2344-2348 - Chong Shangguan, Itzhak Tamo:
Universally Sparse Hypergraphs with Applications to Coding Theory. 2349-2353 - János Körner, Chandra Nair, David Ng:
On the size of pairwise-colliding permutations. 2354-2358 - Ryan Gabrys, Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. 2359-2363 - Yeow Meng Chee, Han Mao Kiah, Hui Zhang:
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming. 2364-2368 - Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Van Khu Vu, Eitan Yaakobi:
Constrained de Bruijn Codes and their Applications. 2369-2373 - Serge Kas Hanna, Salim El Rouayheb:
List Decoding of Deletions Using Guess & Check Codes. 2374-2378 - Takayuki Nozaki:
Bounded Single Insertion/Deletion Correcting Codes. 2379-2383 - Luca G. Tallini, Nawaf Alqwaifly, Bella Bose:
On Deletion/Insertion of Zeros and Asymmetric Error Control Codes*. 2384-2388 - Aristomenis Tsopelakos, Georgios Fellouris, Venugopal V. Veeravalli:
Sequential anomaly detection with observation control. 2389-2393 - George V. Moustakides:
Detecting Changes in Hidden Markov Models. 2394-2398 - Georgios Rovatsos, Shaofeng Zou, Venugopal V. Veeravalli:
Quickest Detection of a Moving Target in a Sensor Network. 2399-2403 - Yu-Chih Huang, Shih-Chun Lin, Yu-Jui Huang:
A Tight Converse to the Asymptotic Performance of Byzantine Distributed Sequential Change Detection. 2404-2408 - Qin Huang, Simeng Zheng, Yuanhan Ni, Zulin Wang, Shuai Wang:
Querying Policies Based on Sparse Matrices for Noisy 20 Questions. 2409-2413 - Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou:
Relaxed Locally Correctable Codes in Computationally Bounded Channels. 2414-2418 - Ron M. Roth:
Analog Error-Correcting Codes. 2419-2423 - Xinmiao Zhang:
Decoding of Generalized Three-Layer Integrated Interleaved Codes. 2424-2428 - Eshed Ram, Yuval Cassuto:
On Decoding Random-Access SC-LDPC Codes. 2429-2433 - Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
A Modified Min-Sum Algorithm for Quantized LDPC Decoders. 2434-2438 - Pierre Loidreau:
Using algebraic structures to improve LDPC code reconstruction over a noisy channel. 2439-2443 - Tadashi Wadayama, Satoshi Takabe:
Deep Learning-Aided Trainable Projected Gradient Decoding for LDPC Codes. 2444-2448 - Alexios Balatsoukas-Stimming, Aris Filos-Ratsikas:
On the Computational Complexity of Blind Detection of Binary Linear Codes. 2449-2453 - François Cayre, Nicolas Le Bihan:
Complexity and Similarity for Sequences using LZ77-based conditional information measure. 2454-2458 - Holger Boche, Volker Pohl:
On the Algorithmic Solvability of the Spectral Factorization and the Calculation of the Wiener Filter on Turing Machines. 2459-2463 - Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha:
Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial. 2464-2468 - Seyed Mohammadreza Mousavi Kalan, Mahdi Soltanolkotabi, Amir Salman Avestimehr:
Fitting ReLUs via SGD and Quantized SGD. 2469-2473 - Shao-Lun Huang, Xiangxiang Xu:
On the Robustness of Noisy ACE Algorithm and Multi-Layer Residual Learning. 2474-2478 - Tyler Sypherd, Mario Díaz, Lalitha Sankar, Peter Kairouz:
A Tunable Loss Function for Binary Classification. 2479-2483 - Pinar Sen, Michael Gastpar:
Successive Refinement to Caching for Dynamic Content. 2484-2488 - Tayyebeh Jahani-Nezhad, Mohammad Ali Maddah-Ali:
CodedSketch: Coded Distributed Computation of Approximated Matrix Multiplication. 2489-2493 - Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Multicasting Energy and Information Simultaneously. 2494-2498 - Varun S. Jog:
Teaching and learning in uncertainty. 2499-2503 - Dariusz Kalocinski, Tomasz Steifer:
An Almost Perfectly Predictable Process with No Optimal Predictor. 2504-2508 - Joe Suzuki:
Mutual Information Estimation: Independence Detection and Consistency. 2514-2518 - Michal Yemini, Andrea J. Goldsmith:
Optimal Resource Allocation for Cellular Networks with Virtual Cell Joint Decoding. 2519-2523 - Saad Kriouile, Maialen Larrañaga, Mohamad Assaad:
Whittle Index Policy for Multichannel Scheduling in Queueing Systems. 2524-2528 - Sarthak Jain, Mehran Elyasi, Martina Cardone, Soheil Mohajer:
On Simple Scheduling in Half-Duplex Relay Diamond Networks. 2529-2533 - Shahram Shahsavari, Farhad Shirani, Elza Erkip:
On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints. 2534-2538 - Chao Gan, Jing Yang, Ruida Zhou, Cong Shen:
Online Learning with Diverse User Preferences. 2539-2543 - Jonathan Scarlett, Ilija Bogunovic, Volkan Cevher:
Overlapping Multi-Bandit Best Arm Identification. 2544-2548 - Linqi Song, Christina Fragouli, Devavrat Shah:
Interactions Between Learning and Broadcasting in Wireless Recommendation Systems. 2549-2553 - P. N. Karthik, Rajesh Sundaresan:
Learning to Detect an Odd Markov Arm. 2554-2558 - Francisco Revson Fernandes Pereira, Ruud Pellikaan, Giuliano Gadioli La Guardia, Francisco M. de Assis:
Application of Complementary Dual AG Codes to Entanglement-Assisted Quantum Codes. 2559-2563 - Mario Berta, Christoph Hirche, Eneet Kaur, Mark M. Wilde:
Stein's Lemma for Classical-Quantum Channels. 2564-2568 - Omar Fawzi, Johanna Seif, Dániel Szilágyi:
Approximation algorithms for classical-quantum channel coding. 2569-2573 - Toshiki Matsumine, Toshiaki Koike-Akino, Ye Wang:
Channel Decoding with Quantum Approximate Optimization Algorithm. 2574-2578 - Erik Mårtensson:
The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction Factors. 2579-2583 - Li-Ping Wang:
Loong: a new IND-CCA-secure code-based KEM. 2584-2588 - Zheng Wang, Cong Ling:
Slice Sampling for Lattice Gaussian Distribution. 2589-2593 - Paolo Santini, Marco Baldi, Franco Chiaraluce:
Cryptanalysis of a One-Time Code-Based Digital Signature Scheme. 2594-2598 - Massimo Battaglioni, Marco Baldi, Franco Chiaraluce, Michael Lentmaier:
Girth Properties of Time-Varying SC-LDPC Convolutional Codes. 2599-2603 - Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen, Antti Laaksonen:
Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns. 2604-2608 - Alexios Balatsoukas-Stimming, Stefano Rini, Jörg Kliewer:
LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel. 2609-2613 - Qianfan Wang, Suihua Cai, Wenchao Lin, Li Chen, Xiao Ma:
Spatially Coupled LDPC Codes via Partial Superposition. 2614-2618 - Su Wang, Borja Peleato:
Coded Caching with Heterogeneous User Profiles. 2619-2623 - Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Fundamental Limits of Coded Caching: The Memory Rate Pair (K - 1 - 1/K, 1/(K-1)). 2624-2628 - Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Pareto Optimal Schemes in Coded Caching. 2629-2633 - Yousef AlHassoun, Faisal Alotaibi, Aly El Gamal, Hesham El Gamal:
Towards Jointly Optimal Placement and Delivery: To Code or Not to Code in Wireless Caching Networks. 2634-2638 - Kuikui Li, Meixia Tao, Zhiyong Chen:
A Computation-Communication Tradeoff Study for Mobile Edge Computing Networks. 2639-2643 - Nicholas Woolsey, Rong-Rong Chen, Mingyue Ji:
Cascaded Coded Distributed Computing on Heterogeneous Networks. 2644-2648 - Sukjong Ha, Jingjing Zhang, Osvaldo Simeone, Joonhyuk Kang:
Coded Federated Computing in Wireless Networks with Straggling Devices and Imperfect CSI. 2649-2653 - Yaoqing Yang, Matteo Interlandi, Pulkit Grover, Soummya Kar, Saeed Amizadeh, Markus Weimer:
Coded Elastic Computing. 2654-2658 - Baris Nakiboglu:
A Simple Derivation of the Refined SPB for the Constant Composition Codes. 2659-2663 - Lóránt Farkas, Tamás Kói:
Two Contributions to Error Exponents for Asynchronous Multiple Access Channel. 2664-2668 - Neri Merhav:
Error Exponents of Typical Random Codes for the Colored Gaussian Channel. 2669-2673 - Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz:
Error Exponents in Distributed Hypothesis Testing of Correlations. 2674-2678 - Jonathan Scarlett:
An Efficient Algorithm for Capacity-Approaching Noisy Adaptive Group Testing. 2679-2683 - Junhan Kim, Byonghyo Shim:
Nearly Sharp Restricted Isometry Condition of Rank Aware Order Recursive Matching Pursuit. 2684-2688 - Luoluo Liu, Sang Peter Chin, Trac D. Tran:
JOBS: Joint-Sparse Optimization from Bootstrap Samples. 2689-2693 - Niklas Koep, Arash Behboodi, Rudolf Mathar:
The Group Restricted Isometry Property for Subgaussian Block Diagonal Matrices. 2694-2698 - Efe Aras, Kuan-Yun Lee, Ashwin Pananjady, Thomas A. Courtade:
A Family of Bayesian Cramér-Rao Bounds, and Consequences for Log-Concave Priors. 2699-2703 - Leighton Pate Barnes, Yanjun Han, Ayfer Özgür:
Fisher Information for Distributed Estimation under a Blackboard Communication Protocol. 2704-2708 - Lekshmi Ramesh, Chandra R. Murthy, Himanshu Tyagi:
Sample-Measurement Tradeoff in Support Recovery Under a Subgaussian Prior. 2709-2713 - Wenda Zhou, Shirin Jalali:
Towards theoretically-founded learning-based denoising. 2714-2718 - Deepesh Data, Linqi Song, Suhas N. Diggavi:
Data Encoding Methods for Byzantine-Resilient Distributed Optimization. 2719-2723 - Deepesh Data, Suhas N. Diggavi:
Byzantine-Tolerant Distributed Coordinate Descent. 2724-2728 - Emre Ozfatura, Deniz Gündüz, Sennur Ulukus:
Speeding Up Distributed Gradient Descent by Utilizing Non-persistent Stragglers. 2729-2733 - Raj Kumar Maity, Ankit Singh Rawat, Arya Mazumdar:
Robust Gradient Descent via Moment Encoding and LDPC Codes. 2734-2738 - Elena Egorova, Marcel Fernandez, Grigory Kabatiansky:
A Construction of Traceability Set Systems with Polynomial Tracing Algorithm. 2739-2742 - Fan Li, Jinyuan Chen:
How to Break the Limits of Secrecy Constraints in Communication Networks? 2743-2747 - Farhad Shirani, Siddharth Garg, Elza Erkip:
A Concentration of Measure Approach to Database De-anonymization. 2748-2752 - Fuchun Lin, Reihaneh Safavi-Naini, Mahdi Cheraghchi, Huaxiong Wang:
Non-Malleable Codes against Active Physical Layer Adversary. 2753-2757 - Ceren Sevinç, Ertem Tuncel:
On the Analysis of Energy-Distortion Tradeoff for Zero-Delay Transmission over Gaussian Broadcast Channels. 2758-2762 - Jithin Ravi, Tobias Koch:
Capacity per Unit-Energy of Gaussian Many-Access Channels. 2763-2767 - Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy efficient random access for the quasi-static fading MAC. 2768-2772 - Denis S. Krotov, Vladimir N. Potapov:
On two-fold packings of radius-1 balls in Hamming graphs. 2773-2777 - Gabriella Akemi Miyamoto, Marcelo Firer:
Metrics which turn tilings into binary perfect codes. 2778-2782 - Sara D. Cardell, Diego Napp, Marcelo Firer:
Unrestricted Generalized Column Distances: A Wider Definition. 2783-2787 - Roberto Assis Machado, Marcelo Firer:
Weights which respect support and NN-decoding. 2788-2792 - Ankur Mallick, Gauri Joshi:
Rateless Codes for Distributed Computations with Sparse Compressed Matrices. 2793-2797 - Chien-Sheng Yang, Ramtin Pedarsani, Amir Salman Avestimehr:
Timely Coded Computing. 2798-2802 - Qifa Yan, Michèle A. Wigger, Sheng Yang, Xiaohu Tang:
A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes. 2803-2807 - Amirhossein Reisizadeh, Saurav Prakash, Ramtin Pedarsani, Amir Salman Avestimehr:
Tree Gradient Coding. 2808-2812 - Swanand Kadhe, Onur Ozan Koyluoglu, Kannan Ramchandran:
Gradient Coding Based on Block Designs for Mitigating Adversarial Stragglers. 2813-2817 - Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
On Optimal Locally Repairable Codes with Super-Linear Length. 2818-2822 - Bin Chen, Shu-Tao Xia, Jie Hao:
Improved bounds and Optimal Constructions of Locally Repairable Codes with distance 5 and 6. 2823-2827 - Jie Hao, Kenneth W. Shum, Shu-Tao Xia, Yi-Xian Yang:
Classification of Optimal Ternary (r, δ)-Locally Repairable Codes Attaining the Singleton-like Bound. 2828-2832 - Matthias Grezet, Camilla Hollanti:
The Complete Hierarchical Locality of the Punctured Simplex Code. 2833-2837 - Umberto Martínez-Peñas, Diego Napp:
Locally Repairable Convolutional Codes with Sliding Window Repair. 2838-2842 - Alexander Fengler, Peter Jung, Giuseppe Caire:
SPARCs and AMP for Unsourced Random Access. 2843-2847 - Toshiyuki Tanaka:
Phase Transition in Mixed ℓ2/ℓ1-norm Minimization for Block-Sparse Compressed Sensing. 2848-2852 - Vasileios Nakos:
One-Bit ExpanderSketch for One-Bit Compressed Sensing. 2853-2857 - Wonwoo Cho, Nam Yul Yu:
Security Analysis of Compressed Encryption With Sparse Matrices Against Chosen Plaintext Attacks. 2858-2862 - Assaf Ben-Yishai, Ofer Shayevitz, Young-Han Kim:
Shannon Capacity is Achievable for a Large Class of Interactive Markovian Protocols. 2863-2867 - Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz:
The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity. 2868-2872 - Jingbo Liu, Ayfer Özgür:
New Converses for the Relay Channel via Reverse Hypercontractivity. 2878-2882 - Yasutada Oohama:
An Inequality Useful for Proofs of Strong Converse Theorems in Network Information Theory. 2883-2887 - July X. Li, Pascal O. Vontobel:
Pseudocodeword-based Decoding of Quantum Stabilizer Codes. 2888-2892 - Kao-Yueh Kuo, Ching-Yi Lai:
The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes. 2893-2897 - Martianus Frederic Ezerman, San Ling, Buket Özkaya, Patrick Solé:
Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9. 2898-2902 - Tejas Gandhi, Piyush Kurur, Rajat Mittal:
Stabilizer codes from modified symplectic forms. 2903-2907 - Trung Can, Narayanan Rengaswamy, A. Robert Calderbank, Henry D. Pfister:
Kerdock Codes Determine Unitary 2-Designs. 2908-2912 - Dennis Ogbe, Chih-Chun Wang, David J. Love:
On the Optimal Delay Amplification Factor of Multi-Hop Relay Channels. 2913-2917 - Kaiming Shen, Reza Khosravi-Farsani, Wei Yu:
Achievable Rates and Outer Bounds for Full-Duplex Relay Broadcast Channel with Side Message. 2918-2922 - Satoshi Takabe, Tadashi Wadayama, Masahito Hayashi:
Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward Relaying. 2923-2927 - Wasim Huleihel, Yury Polyanskiy, Ofer Shayevitz:
Relaying One Bit Across a Tandem of Binary-Symmetric Channels. 2928-2932 - Ran Averbuch, Neri Merhav, Albert Guillén i Fàbregas:
Large Deviations of Typical Random Codes. 2933-2937 - Anelia Somekh-Baruch, Jonathan Scarlett, Albert Guillén i Fàbregas:
A Recursive Cost-Constrained Construction that Attains the Expurgated Exponent. 2938-2942 - Gonzalo Vazquez-Vilar:
On the Error Probability of Optimal Codes in Gaussian Channels under Maximal Power Constraint. 2943-2946 - Josep Font-Segura, Alfonso Martinez, Albert Guillén i Fàbregas:
Asymptotics of the Random Coding Error Probability for Constant-Composition Codes. 2947-2951 - Benjamin Fuller, Lowen Peng:
Continuous-Source Fuzzy Extractors: Source uncertainty and insecurity. 2952-2956 - Denis S. Krotov:
On (2n/3 - 1)-Resilient (n, 2)-Functions. 2957-2961 - Lilya Budaghyan, Marco Calderini, Claude Carlet, Robert S. Coulter, Irene Villa:
On Isotopic Shift Construction for Planar Functions. 2962-2966 - Patrick Ah-Fat, Michael Huth:
Scalable Information Flow Analysis of Secure Three-Party Affine Computations. 2967-2971 - Serdar Boztas:
On the Complexity of the 3XORSUM Problem. 2972-2976 - Kai Wan, Daniela Tuninetti, Mingyue Ji, Giuseppe Caire:
A Novel Cache-aided Fog-RAN Architecture. 2977-2981 - Amirreza Asadzadeh, Giuseppe Caire:
Coded Caching with Small Subpacketization via Spatial Reuse and Content Base Replication. 2982-2986 - Emanuele Parrinello, Ayse Ünsal, Petros Elia:
Optimal Coded Caching under Statistical QoS Information. 2987-2991 - Çagkan Yapar, Kai Wan, Rafael F. Schaefer, Giuseppe Caire:
On D2D Caching with Uncoded Cache Placement. 2992-2996 - Ching-Yi Lai, Kai-Min Chung:
Interactive Leakage Chain Rule for Quantum Min-entropy. 2997-3001 - Christopher T. Chubb, Kamil Korzekwa, Marco Tomamichel:
Moderate deviation analysis of majorisation-based resource interconversion. 3002-3006 - Eyuri Wakakuwa, Yoshifumi Nakata:
One-Shot Randomized and Nonrandomized Partial Decoupling. 3007-3011 - Jayadev Acharya, Ibrahim Issa, Nirmal V. Shende, Aaron B. Wagner:
Measuring Quantum Entropy. 3012-3016 - Mohammad Fahim, Viveck R. Cadambe:
Numerically Stable Polynomially Coded Computing. 3017-3021 - Anindya Bijoy Das, Aditya Ramamoorthy:
Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach. 3022-3026 - Ziwen Pan, Kaushik P. Seshadreesan, William Clark, Mark R. Adcock, Ivan B. Djordjevic, Jeffrey H. Shapiro, Saikat Guha:
Secret key distillation over a pure loss quantum wiretap channel under restricted eavesdropping. 3032-3036 - Hessam Mahdavifar, Najme Ebrahimi:
Secret Key Generation via Pulse-Coupled Synchronization. 3037-3041 - Johannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost:
Unique Information and Secret Key Decompositions. 3042-3046 - Reo Eriguchi, Noboru Kunihiro, Mitsugu Iwamoto:
Optimal Multiple Assignment Schemes Using Ideal Multipartite Secret Sharing Schemes. 3047-3051 - Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Mean estimation for entangled single-sample distributions. 3052-3056 - Charalambos D. Charalambous, Christos K. Kourtellaris:
Global Optimality of Encoders and MSE Decoders for Communicating Unstable Markov Processes over Unstable Gaussian Recursive Models with Feedback: A Nonanticipative RDF Approach. 3057-3061 - Chengzhuo Ni, Mengdi Wang:
Maximum Likelihood Tensor Decomposition of Markov Decision Process. 3062-3066 - Jing Hao, Varun S. Jog:
Dual Loomis-Whitney inequalities via information theory. 3067-3071 - Amir Saberi, Farhad Farokhi, Girish N. Nair:
State Estimation via Worst-Case Erasure and Symmetric Channels with Memory. 3072-3076 - Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Streaming Erasure Codes over the Three-Node Relay Network. 3077-3081 - Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays. 3082-3086 - Vinayak Ramkumar, P. Vijay Kumar:
Coded MapReduce Schemes Based on Placement Delivery Array. 3087-3091 - Hamdi Joudeh, Xinping Yi, Bruno Clerckx:
On Multi-Cell Uplink-Downlink Duality with Treating Inter-Cell Interference as Noise. 3092-3096 - Mohamed Salman, Mahesh K. Varanasi:
The Symmetric Capacity of the K-Receiver Interleaved Broadcast Channel with Symmetric Side Information. 3097-3101 - Yao-Chia Chan, Syed Ali Jafar:
Towards an Extremal Network Theory - Robust GDoF Gain of Transmitter Cooperation over TIN. 3102-3106 - Yujie Gu, Ofer Shayevitz:
On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel. 3107-3111 - Elad Domanovitz, Uri Erez:
On the Importance of Asymmetry and Monotonicity Constraints in Maximal Correlation Analysis. 3112-3116 - Lei Yu, Vincent Y. F. Tan:
Exact Channel Synthesis. 3117-3121 - Wael Alghamdi, Flávio P. Calmon:
Mutual Information as a Function of Moments. 3122-3126 - Xueyan Niu, Christopher J. Quinn:
A Measure of Synergy, Redundancy, and Unique Information using Information Geometry. 3127-3131
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:40 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:
