default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2022: Espoo, Finland
- IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022. IEEE 2022, ISBN 978-1-6654-2159-1
- Hoover H. F. Yin
, Harry W. H. Wong, Mehrdad Tahernia, Russell W. F. Lai:
Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes. 1-6 - Felicitas Hörmann, Hannes Bartz, Sven Puchinger:
Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank Metric. 7-12 - Tadashi Wadayama:
Fully Analog Noise-Resilient Dynamical Systems Storing Binary Sequence. 13-18 - Ran Tamir, Neri Merhav:
Universal Decoding for the Typical Random Code and for the Expurgated Code. 19-24 - Alejandro Cohen, Muriel Médard, Shlomo Shamai Shitz:
Broadcast Approach Meets Network Coding for Data Streaming. 25-30 - Cheuk Ting Li:
The Undecidability of Network Coding with some Fixed-Size Messages and Edges. 31-36 - Jiaxin Qing, Hoover H. F. Yin, Raymond W. Yeung:
Enhancing the Decoding Rates of BATS Codes by Learning With Guided Information. 37-42 - Sagi Marcovich, Tuvi Etzion, Eitan Yaakobi:
Covering Sequences for ℓ-Tuples. 43-48 - Rebecca Golm, Mina Nahvi, Ryan Gabrys, Olgica Milenkovic:
The Gapped k-Deck Problem. 49-54 - Yunus Can Gültekin, Frans M. J. Willems, Alex Alvarado:
Log-CCDM: Distribution Matching via Multiplication-free Arithmetic Coding. 55-60 - Sayantan Chakraborty, Arun Padakandla, Pranab Sen:
Centralised multi link measurement compression with side information. 61-66 - Hao Lou, Farzad Farnoud:
Universal Compression of Large Alphabets with Constrained Compressors. 67-72 - Tingting Zhu, Jifan Liang, Xiao Ma:
Ternary Convolutional LDGM Codes with Applications to Gaussian Source Compression. 73-78 - Eric Chitambar, Ian George, Brian Doolittle, Marius Junge:
The Communication Value of a Quantum Channel. 79-84 - Manideep Mamindlapally, Andreas J. Winter:
Singleton bounds for entanglement-assisted classical and quantum error correcting codes. 85-90 - Masahito Hayashi:
Analytical calculation formulas for capacities of classical and classical-quantum channels. 91-96 - Mohamed Ridha Znaidi, Gaurav Gupta, Paul Bogdan:
Secure Distributed/Federated Learning: Prediction-Privacy Trade-Off for Multi-Agent System. 97-102 - Tayyebeh Jahani-Nezhad, Mohammad Ali Maddah-Ali, Songze Li, Giuseppe Caire:
SwiftAgg: Communication-Efficient and Dropout-Resistant Secure Aggregation for Federated Learning with Worst-Case Security Guarantees. 103-108 - Chun-Ying Hou, I-Hsiang Wang:
Fundamental Limits of Personalized Federated Linear Regression with Data Heterogeneity. 109-114 - Yunus Inan, Mert Kayaalp, Emre Telatar, Ali H. Sayed:
Social Learning under Randomized Collaborations. 115-120 - Tina Behnia, Ke Wang, Christos Thrampoulidis:
On how to avoid exacerbating spurious correlations when models are overparameterized. 121-126 - Hossein Taheri, Ramtin Pedarsani, Christos Thrampoulidis:
Asymptotic Behavior of Adversarial Training in Binary Linear Classification. 127-132 - Shelvia Wongso, Rohan Ghosh, Mehul Motani:
Understanding Deep Neural Networks Using Sliced Mutual Information. 133-138 - Mohammad Moltafet, Markus Leinonen, Marian Codreanu:
AoI in Source-Aware Preemptive M/G/1/1 Queueing Systems: Moment Generating Function. 139-143 - Muhammed Emrullah Ildiz, Orhan Tahir Yavascan, Elif Uysal, Özkan Tugberk Kartal:
Query Age of Information: Optimizing AoI at the Right Time. 144-149 - Ali Maatouk, Mohamad Assaad, Anthony Ephremides:
Analysis of an Age-Dependent Stochastic Hybrid System. 150-155 - Peng Zou, Jin Zhang, Suresh Subramaniam:
Performance Modeling of Scheduling Algorithms in a Multi-Source Status Update System. 156-161 - Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander. 162-167 - Spencer Compton:
A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling. 168-173 - Yuta Nakahara, Shota Saito, Akira Kamatsuka, Toshiyasu Matsushima:
Probability Distribution on Rooted Trees. 174-179 - Yunqi Wan, Li Chen, Fangguo Zhang:
Algebraic Chase Decoding of Elliptic Codes Through Computing the Gröbner Basis. 180-185 - Kao-Yueh Kuo, Ching-Yi Lai:
Comparison of 2D topological codes and their decoding performances. 186-191 - Liudmila Karakchieva, Peter Trifonov:
Dual-domain recursive SISO decoding of linear block codes. 192-197 - Yajuan Liu, Xuan He, Xiaohu Tang:
Capacity-Achieving Constrained Codes with GC-Content and Runlength Limits for DNA Storage. 198-203 - Krishna Gopal Benerjee, Adrish Banerjee:
On Homopolymers and Secondary Structures Avoiding, Reversible, Reversible-Complement and GC-balanced DNA Codes. 204-209 - Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
Capacity of the Shotgun Sequencing Channel. 210-215 - Brendon McBain, Emanuele Viterbo, James Saunderson:
Finite-State Semi-Markov Channels for Nanopore Sequencing. 216-221 - Siming Sun, Michelle Effros:
Source Coding with Unreliable Side Information in the Finite Blocklength Regime. 222-227 - Ryo Nomura:
Relationship Between Intrinsic Randomness with f-Divergence and Fixed-Length Source Coding. 228-233 - Zhuangfei Wu, Lin Bai, Lin Zhou:
Excess-Distortion Exponents for Successive Refinement Using Gaussian Codebooks. 234-239 - Omri Lev, Anatoly Khina:
Universal Joint Source-Channel Coding Under an Input Energy Constraint. 240-245 - Mordecai J. Golin, Albert John L. Patupat:
Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude. 246-251 - Jun-Kai You, Hao-Chung Cheng, Yen-Huan Li:
Minimizing Quantum Rényi Divergences via Mirror Descent with Polyak Step Size. 252-257 - Uzi Pereg, Johannes Rosenberger, Christian Deppe:
Identification Over Quantum Broadcast Channels. 258-263 - Yeow Meng Chee, Duc Tu Dao, Long Nguyen Tien, Duy Hoang Ta, Van Khu Vu:
Run Length Limited de Bruijn Sequences for Quantum Communications. 264-269 - Yonglong Li, Christoph Hirche, Marco Tomamichel:
Sequential Quantum Channel Discrimination. 270-275 - Gowtham R. Kurri, Monica Welfert, Tyler Sypherd, Lalitha Sankar:
α-GAN: Convergence and Estimation Guarantees. 276-281 - Seyed Mohammadreza Mousavi Kalan, Mahdi Soltanolkotabi, Amir Salman Avestimehr:
Statistical Minimax Lower Bounds for Transfer Learning in Linear Binary Classification. 282-287 - Madison Lee, Shubhanshu Shekhar, Tara Javidi:
Multi-Scale Zero-Order Optimization of Smooth Functions in an RKHS. 288-293 - Amedeo Roberto Esposito, Michael Gastpar:
From Generalisation Error to Transportation-cost Inequalities and Back. 294-299 - Jae Oh Woo:
Analytic Mutual Information in Bayesian Neural Networks. 300-305 - Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia:
Covert Communication in the Presence of an Uninformed, Informed, and Coordinated Jammer. 306-311 - Qiaosheng Eric Zhang, Vincent Y. F. Tan:
Covert Communication with Mismatched Decoders. 312-317 - Shi-Yuan Wang, Tuna Erdogan, Matthieu R. Bloch:
Towards a Characterization of the Covert Capacity of Bosonic Channels under Trace Distance. 318-323 - Meng-Che Chang, Matthieu R. Bloch:
Covert Best Arm Identification of Stochastic Bandits. 324-329 - Ziv Aharoni, Dor Tsur, Haim H. Permuter:
Density Estimation of Processes with Memory via Donsker Vardhan. 330-335 - Qi Chen, Minquan Cheng, Baoming Bai:
Matroidal Entropy Functions: Constructions, Characterizations and Representations. 336-341 - Jiheon Woo, Chanhee Yoo, Young-Sik Kim, Yuval Cassuto, Yongjune Kim:
Generalized Longest Repeated Substring Min-Entropy Estimator. 342-347 - Somya Singh, Fady Alajaji, Bahman Gharesifard:
Modeling Network Contagion Via Interacting Finite Memory Pólya Urns. 348-353 - Utkarsh Gupta, Hessam Mahdavifar:
A New Algebraic Approach for String Reconstruction from Substring Compositions. 354-359 - Serge Kas Hanna:
Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities. 360-365 - Yingyin Pan, Jianghua Zhong, Dongdai Lin:
Nonsingularity of Galois Nonlinear Feedback Shift Registers. 366-371 - Vladimir Edemskiy, Chenhuang Wu:
4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pq. 372-377 - Sima Naseri, Ali Dehghan, Amir H. Banihashemi:
On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes. 378-383 - Xiaomeng Guo, Yongchao Wang:
Efficient ADMM Decoder for Non-binary LDPC Codes based on Bit Embedding Technique. 384-389 - Emily McMillon, Christine A. Kelley:
Cycle-Free Windows of SC-LDPC Codes. 390-395 - Asma Maalaoui, Charly Poulliat, Iryna Andriyanova:
Geometric versus Probabilistic Shaping for Circular-QAM with Nonbinary LDPC Codes. 396-401 - Zhusheng Wang, Sennur Ulukus:
Communication Cost of Two-Database Symmetric Private Information Retrieval: A Conditional Disclosure of Multiple Secrets Perspective. 402-407 - Pengzhen Ke, Liang Feng Zhang:
Two-Server Private Information Retrieval with Result Verification. 408-413 - Anoosheh Heidarzadeh, Alex Sprintson:
The Role of Reusable and Single-Use Side Information in Private Information Retrieval. 414-419 - Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Fundamental Limits of Cache-aided Multiuser PIR: The Two-message Two-user Case. 420-425 - Fatih Furkan Yilmaz, Reinhard Heckel:
Regularization-wise double descent: Why it occurs and how to eliminate it. 426-431 - Chin Wa Ken Lau, Chandra Nair, Chaorui Yao:
Uniqueness of local maximizers for some non-convex log-determinant optimization problems using information theory. 432-437 - Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Sequential vs. Fixed Design Regrets in Online Learning. 438-443 - Philippe Jacquet, Gil I. Shamir, Wojciech Szpankowski:
Precise Minimax Regret for Logistic Regression. 444-449 - Anatoly Khina, Arie Yeredor, Ram Zamir:
Monotonicity of the Trace-Inverse of Covariance Submatrices and Two-Sided Prediction. 450-455 - Shahar Stein Ioushua, Ofer Shayevitz:
On the Number of Graphs with a Given Histogram. 456-461 - Akiharu Omae, Kazuho Watanabe:
Approximate Empirical Bayes Estimation of the Regularization Parameter in ℓ1 Trend Filtering. 462-467 - Marco Bondaschi, Michael Gastpar:
Alpha-NML Universal Predictors. 468-473 - Michael Rudow, K. V. Rashmi:
Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages. 474-479 - Moon Jeong Park, Jungseul Ok, Yo-Seb Jeon, Dongwoo Kim:
MetaSSD: Meta-Learned Self-Supervised Detection. 480-485 - Austin Warner, Georgios Fellouris:
CuSum for sequential change diagnosis. 486-491 - Bashar Huleihel, Oron Sabag, Haim H. Permuter:
Capacity of the Trapdoor Channel with Delayed Feedback. 492-497 - Andrea Grigorescu, Holger Boche, Rafael F. Schaefer, H. Vincent Poor:
Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties. 498-503 - Pranav Joshi, Amritakshya Purkayastha, Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi:
On the Capacity of Additive AVCs with Feedback. 504-509 - Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On the List Size in the Levenshtein's Sequence Reconstruction Problem. 510-515 - Yeow Meng Chee, Nhat Hoang Le, Van Khu Vu:
Robust Locally Positioning Sequences and Codes: Capacity, Constructions and Applications. 516-521 - Shibsankar Das, Adrish Banerjee, Zi Long Liu:
New Family of Cross Z-Complementary Sequences With Large ZCZ Width. 522-527 - Minghui Yang, Shiyuan Qiang, Xiaoyan Jing, Keqin Feng, Dongdai Lin:
The 4-Adic Complexity of Quaternary Sequences of Even Period With Ideal Autocorrelation. 528-531 - Zilong Wang, Qian Chen, Guang Gong:
An Upper Bound of the Set Size of Perfect Sequences with Optimal Cross-correlation. 532-535 - Min Zhu, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
Systematic Doping of SC-LDPC Codes. 536-541 - Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi:
Trade-Based LDPC Codes. 542-547 - Roxana Smarandache, Anthony Gómez-Fonseca, David G. M. Mitchell:
Using Minors to Construct Generator Matrices for Quasi-Cyclic LDPC Codes. 548-553 - Min Jang, Kyeongyeon Kim, Seho Myung, Hongsil Jeong, Kyung-Joong Kim, Sang-Hyo Kim:
A Design of Layered Decoding for QC-LDPC Codes Based on Reciprocal Channel Approximation. 554-559 - Sangwoo Hong, Heecheol Yang, Jungwoo Lee:
Byzantine Attack Identification in Distributed Matrix Multiplication via locally testable codes. 560-565 - Yue Bi, Philippe Ciblat, Michèle A. Wigger, Yue Wu:
DoF of a Cooperative X-Channel with an Application to Distributed Computing. 566-571 - Hongru Cao, Wei Yan, Sian-Jheng Lin, Weiming Zhang:
A New Coding Scheme for Matrix-Vector Multiplication via Universal Decodable Matrices. 572-577 - Prathamesh Mayekar, Shubham K. Jha, Himanshu Tyagi:
Wyner-Ziv compression is (almost) optimal for distributed optimization. 578-583 - Sourbh Bhadane, Aaron B. Wagner:
On One-Bit Quantization. 584-589 - Photios A. Stavrou, Marios Kountouris:
A Rate Distortion Approach to Goal-Oriented Communication. 590-595 - Adeel Mahmood, Aaron B. Wagner:
Lossy Compression with Universal Distortion. 596-601 - Adeel Mahmood, Aaron B. Wagner:
Minimax Rate-Distortion. 602-607 - Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Neural Estimation of the Rate-Distortion Function for Massive Datasets. 608-613 - Ziqi Zhou, Onur Günlü, Rafael G. L. D'Oliveira, Muriel Médard, Parastoo Sadeghi, Rafael F. Schaefer:
Rainbow Differential Privacy. 614-619 - Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund:
Bounds for Privacy-Utility Trade-off with Non-zero Leakage. 620-625 - Sara Saeidian, Giulia Cervia, Tobias J. Oechtering, Mikael Skoglund:
Pointwise Maximal Leakage. 626-631 - Ajaykrishnan Nageswaran:
Gaussian Data Privacy Under Linear Function Recoverability. 632-636 - Shu Hong, Lingjie Duan:
Multi-user Privacy Cooperation Game by Leveraging Users' Service Flexibility. 637-642 - Saeede Enayati, Dennis L. Goeckel, Amir Houmansadr, Hossein Pishro-Nik:
Constrained Obfuscation to Thwart Pattern Matching Attacks. 643-648 - Maki Yoshida:
Hybrid Multiplicative Non-perfect Secret Sharing. 649-653 - Wei Cheng, Yi Liu, Sylvain Guilley, Olivier Rioul:
Attacking Masked Cryptographic Implementations: Information-Theoretic Bounds. 654-659 - Hiroki Koga:
Construction of the Visual Cryptography Scheme with the Maximum Relative Difference under a Strong General Access Structure. 660-665 - Irina E. Bocharova, Henk D. L. Hollmann, Karan Khathuria, Boris D. Kudryashov, Vitaly Skachek:
Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel. 666-671 - Ziyi Chen, Shaocong Ma, Yi Zhou:
Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning. 672-677 - Yiling Luo, Xiaoming Huo, Yajun Mei:
The Directional Bias Helps Stochastic Gradient Descent to Generalize in Kernel Regression Models. 678-683 - Samir M. Perlaza, Gaetan Bisson, Iñaki Esnaola, Alain Jean-Marie, Stefano Rini:
Empirical Risk Minimization with Relative Entropy Regularization: Optimality and Sensitivity Analysis. 684-689 - Ruida Zhou, Chao Tian, Tie Liu:
Stochastic Chaining and Strengthened Information-Theoretic Generalization Bounds. 690-695 - Yiling Luo, Xiaoming Huo, Yajun Mei:
Implicit Regularization Properties of Variance Reduced Stochastic Mirror Descent. 696-701 - Ioannis Papageorgiou, Ioannis Kontoyiannis:
The Posterior Distribution of Bayesian Context-Tree Models: Theory and Applications. 702-707 - Lampros Gavalakis, Ioannis Kontoyiannis:
The Entropic Central Limit Theorem for Discrete Random Variables. 708-713 - Dimitris Achlioptas, Kostas Zampetakis:
A Simpler Proof of the Four Functions Theorem and Some New Variants. 714-717 - Martina Cardone, Alex Dytso, Cynthia Rush:
Entropic CLT for Order Statistics. 718-723 - Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan:
Smoothed InfoNCE: Breaking the log N Curse without Overshooting. 724-729 - Yijun Fan, Yanxiao Liu, Shenghao Yang:
Continuity of Link Scheduling Rate Region for Wireless Networks with Propagation Delays. 730-735 - Babak Badnava, Sravan Reddy Chintareddy, Morteza Hashemi:
QoE-Centric Multi-User mmWave Scheduling: A Beam Alignment and Buffer Predictive Approach. 736-741 - Ouyang Zhou, Junyuan Wang, Fuqiang Liu:
Average Downlink Rate Analysis for Clustered Cell-Free Networks with Access Point Selection. 742-747