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