default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2023: Taipei, Taiwan
- IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25-30, 2023. IEEE 2023, ISBN 978-1-6654-7554-9
- Hassan ZivariFard, Xiaodong Wang:
Covert Communication When Action-Dependent States is Available Non-Causally at the Transmitter. 1-6 - K. R. Sahasranand, Aslan Tchamkerten:
Feedback Increases the Capacity of Queues with Finite Support Service Times. 7-12 - Amos Lapidoth, Baohua Ni:
The Identification Capacity of the Modulo-Additive Noise Channel with Help. 13-14 - Jan Hazla:
Optimal List Decoding from Noisy Entropy Inequality. 15-18 - Yunqi Wan, Jiongyue Xing, Yuliang Huang, Ting-Yi Wu, Bo Bai, Gong Zhang:
The Re-encoding Transform in Algebraic List Decoding of Algebraic Geometric Codes. 19-24 - Haojie Gu, Hong Lu, Jun Zhang:
Improved Singleton-type bounds for list-decoding and average-radius list-decoding. 25-29 - V Arvind Rameshwar
, Navin Kashyap:
A Version of Delsarte's Linear Program for Constrained Systems. 30-35 - Anzo Teh, Yury Polyanskiy:
Comparing Poisson and Gaussian channels. 36-41 - Lampros Gavalakis:
Discrete Generalised Entropy Power Inequalities for Log-Concave Random Variables. 42-47 - Romain Chor, Milad Sefidgaran, Abdellatif Zaidi:
More Communication Does Not Result in Smaller Generalization Error in Federated Learning. 48-53 - Maximilian Egger, Christoph Hofmeister, Antonia Wachter-Zeh, Rawad Bitar:
Private Aggregation in Wireless Federated Learning with Heterogeneous Clusters. 54-59 - Shuangyi Chen, Anuja Modi, Shweta Agrawal, Ashish Khisti:
Quadratic Functional Encryption for Secure Training in Vertical Federated Learning. 60-65 - Yanina Y. Shkel, Anuj Kumar Yadav:
Information Spectrum Converse for Minimum Entropy Couplings and Functional Representations. 66-71 - Anuran Makur, Japneet Singh:
On Properties of Doeblin Coefficients. 72-77 - Shaocheng Liu, Qi Chen:
Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four. 78-83 - Paula Belzig, Matthias Christandl, Alexander Müller-Hermes:
Fault-Tolerant Coding for Entanglement-Assisted Communication. 84-89 - Hao-Chung Cheng:
A Simple and Tighter Derivation of Achievability for Classical-Quantum Channel Coding. 90-95 - Ian George, Min-Hsiu Hsieh, Eric Chitambar:
One-Shot Bounds on State Generation using Correlated Resources and Local Encoders. 96-101 - Anirudh Sridhar, Tirza Routtenberg, H. Vincent Poor:
Quickest Inference of Susceptible-Infected Cascades in Sparse Networks. 102-107 - Jianjun Zhu, Fan Li, Jinyuan Chen:
Communication-Efficient and Error-Free Gradecast with Optimal Resilience. 108-113 - Gustavo Kasper Facenda, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Streaming Erasure Codes over Multicast Relayed Networks. 114-119 - Jianlin Guo, Toshiaki Koike-Akino, Pu Wang, Kieran Parsons, Philip V. Orlik, Jothi Prasanna Shanmuga Sundaram, Takenori Sumi, Yukimasa Nagai:
Rateless Coding for Multi-Hop Broadcast Transmission in Wireless IoT Networks. 120-125 - Elizabath Peter, B. Sundar Rajan:
Multi-antenna Coded Caching with Combinatorial Multi-access Networks. 126-131 - Milad Abolpour, Mohammad Javad Salehi, Antti Tölli:
Cache-Aided Communications in MISO Networks with Dynamic User Behavior: A Universal Solution. 132-137 - Minquan Cheng, Jinwei Xu, Mingming Zhang, Youlong Wu:
Coded Caching Scheme for Two-Dimensional Caching-Aided Ultra-Dense Networks. 138-143 - Minquan Cheng, Kai Wan, Petros Elia, Giuseppe Caire:
Coded Caching Schemes for Multi-Access Topologies via Combinatorial Design Theory. 144-149 - Keenan J. A. Down, Pedro A. M. Mediano:
A Logarithmic Decomposition for Information. 150-155 - Yufan Li, Zhou Fan, Subhabrata Sen, Yihong Wu:
Random linear estimation with rotationally-invariant designs: Asymptotics at high temperature. 156-161 - Andreas Bluhm, Ángela Capel, Paul Gondolf, Antonio Pérez-Hernández:
General Continuity Bounds for Quantum Relative Entropies. 162-167 - Kaan Ozkara, Bruce Huang, Suhas N. Diggavi:
Personalized PCA for Federated Heterogeneous Data. 168-173 - Rajarshi Saha, Mohamed Seif, Michal Yemini, Andrea J. Goldsmith, H. Vincent Poor:
Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy. 174-179 - Renpu Liu, Jing Yang, Cong Shen:
Exploiting Feature Heterogeneity for Improved Generalization in Federated Multi-task Learning. 180-185 - Hasin Us Sami, Basak Güler:
Secure Aggregation for Clustered Federated Learning. 186-191 - Hao-Chung Cheng, Li Gao:
Tight Analysis of Convex Splitting with Applications in Quantum Information Theory. 192-197 - Elyakim Zlotnick, Boulat A. Bash, Uzi Pereg:
Entanglement-Assisted Covert Communication via Qubit Depolarizing Channels. 198-203 - Christoph Hirche, Xinyue Guan, Marco Tomamichel:
Chain Rules for Rényi Information Combining. 204-209 - Saurabh Kumar Gupta, Abhishek K. Gupta:
Characterizing Acceptance in Post-Selection One-Shot Quantum Hypothesis Testing. 210-215 - Jingfan Meng, Ziheng Liu, Yiwei Wang, Jun (Jim) Xu:
RECIPE: Rateless Erasure Codes Induced by Protocol-Based Encoding. 216-221 - Dor Elimelech, Moshe Schwartz:
The Optimal Rate of Second-Order Generalized-Covering Codes. 222-227 - Sijie Li, Prasad Krishnan, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Computationally Efficient Codes for Adversarial Binary-Erasure Channels. 228-233 - Daniel Byrne, Lawrence Ong, Parastoo Sadeghi, Badri N. Vellambi:
Preferential Pliable Index Coding. 234-239 - Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche:
A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity. 240-245 - Sebastian Bitzer, Alessio Pavoni, Violetta Weger, Paolo Santini, Marco Baldi, Antonia Wachter-Zeh:
Generic Decoding of Restricted Errors. 246-251 - Hari Krishnan P. Anilkumar, Aayush Rajesh, Varun Narayanan, Manoj M. Prabhakaran, Vinod M. Prabhakaran:
Randomness Requirements for Three-Secret Sharing. 252-257 - Maki Yoshida:
On the Communication Complexity of Private Function Sharing and Computation. 258-263 - Peng Wang, Yong Liang Guan, Lipo Wang, Peng Cheng:
Fast Blind Recovery of Linear Block Codes over Noisy Channels. 264-269 - Irina E. Bocharova, Boris D. Kudryashov, Sander Mikelsaar, Vitaly Skachek:
Bound on the ML Decoding Error Probability for Coded QAM Signals with Shaping. 270-275 - Dipak Kumar Bhunia, Cristina Fernández-Córdoba, Mercè Villanueva:
On ℤ2ℤ4ℤ8-Additive Hadamard Codes. 276-281 - Talha Arikan, Baran Düzgün, Kamil Otal, Ferruh Özbudak:
A New Construction of Asymptotically Optimal Almost Affinely Disjoint Spaces. 282-285 - Qin Huang, Bin Zhang:
Minimal Derivative Descendants of Cyclic Codes. 286-291 - Fabian Göttsch, Noboru Osawa, Takeo Ohseki, Yoshiaki Amano, Issei Kanno, Kosuke Yamazaki, Giuseppe Caire:
User-Centric Clustering Under Fairness Scheduling in Cell-Free Massive MIMO. 292-297 - Bharath Shamasundar, Aria Nosratinia:
Spatial Modulation vs. Single-Antenna Transmission: When is Indexing Helpful? 298-303 - Deokhwan Han, Jeonghun Park, Namyoon Lee:
Achieving Massive MIMO Gains in FDD Downlink Systems Without CSI Feedback. 304-309 - Chan Xu, Shuowen Zhang:
MIMO Radar Transmit Signal Optimization for Target Localization Exploiting Prior Information. 310-315 - Jiuyu Liu, Yi Ma, Rahim Tafazolli:
Achieving Maximum-likelihood Detection Performance with Square-order Complexity in Large Quasi-Symmetric MIMO Systems. 316-321 - Mason DiCicco, Daniel Reichman:
The Learning and Communication Complexity of Subsequence Containment. 322-327 - Samir M. Perlaza, Iñaki Esnaola, Gaetan Bisson, H. Vincent Poor:
On the Validation of Gibbs Algorithms: Training Datasets, Test Datasets and their Aggregation. 328-333 - David Xing Wu, Anant Sahai:
Lower Bounds for Multiclass Classification with Overparameterized Linear Models. 334-339 - Francisco Daunas, Iñaki Esnaola, Samir M. Perlaza, H. Vincent Poor:
Analysis of the Relative Entropy Asymmetry in the Regularization of Empirical Risk Minimization. 340-345 - Kanumuri Nithin Varma, Sahin Lale, Babak Hassibi:
The Asymptotic Distribution of the Stochastic Mirror Descent Iterates in Linear Models. 346-351 - Johan Chrisnata, Han Mao Kiah, Van Long Phuoc Pham:
Deletion Correcting Codes for Efficient DNA Synthesis. 352-357 - Adrian Vidal, Viduranga Bandara Wijekoon, Emanuele Viterbo:
Union Bound for Generalized Duplication Channels with DTW Decoding. 358-363 - Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh, Eitan Yaakobi:
Error-Correcting Codes for Nanopore Sequencing. 364-369 - Daniella Bar-Lev, Omer Sabary, Ryan Gabrys, Eitan Yaakobi:
Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems. 370-375 - Brendon McBain, Emanuele Viterbo, James Saunderson:
Homophonic Coding for the Noisy Nanopore Channel with Constrained Markov Sources. 376-381 - Narayana Prasad Santhanam, Mayank Bakshi:
Universal Compression of High Dimensional Gaussian Vectors with James-Stein shrinkage. 382-387 - Sara Saeidian, Giulia Cervia, Tobias J. Oechtering, Mikael Skoglund:
Pointwise Maximal Leakage on General Alphabets. 388-393 - Peter Harremoës, Tyron Lardy, Peter Grünwald:
Universal Reverse Information Projections and Optimal E-statistics. 394-399 - Amedeo Roberto Esposito, Marco Mondelli:
Concentration without Independence via Information Measures. 400-405 - Osama A. Hanna, Xinlin Li, Suhas N. Diggavi, Christina Fragouli:
Common Information Dimension. 406-411 - Aravind V. R, Pradeep Kiran Sarvepalli, Andrew Thangaraj:
Generalizations and Extensions to Lifting Constructions for Coded Caching. 412-417 - Kota Srinivas Reddy, Nikhil Karamchandani:
Multi-access Coded Caching with Linear Subpacketization. 418-423 - Yinbin Ma, Daniela Tuninetti:
Demand Privacy in Hotplug Caching Systems. 424-429 - Xianzhang Wu, Minquan Cheng, Li Chen, Congduan Li:
Coded Caching Design for Dynamic Networks with Reduced Subpacketizations. 430-435 - Zhengrui Li, Wai Ho Mow, Yunghsiang S. Han, Ting-Yi Wu:
Cache-Aided Distributed Storage Systems. 436-441 - Wafa Labidi, Christian Deppe, Holger Boche:
Joint Identification and Sensing for Discrete Memoryless Channels. 442-447 - Mohammad Javad Salariseddigh, Vahid Jamali, Holger Boche, Christian Deppe, Robert Schober:
Deterministic Identification for MC Binomial Channel. 448-453 - Gergely Flamich, Lucas Theis:
Adaptive Greedy Rejection Sampling. 454-459 - Ryo Nomura:
Optimum Self-Random Number Generation Rate and Its Application to RDP Function. 460-465 - Han Wu, Hamdi Joudeh:
Soft Guessing Under Logarithmic Loss. 466-471 - Go Kato, Mikio Fujiwara, Toyohiro Tsurumaru:
Information-theoretically secure equality-testing protocol with dispute resolution. 472-476 - Thomas Johansson, Willi Meier, Vu Nguyen:
Differential cryptanalysis of Mod-2/Mod-3 constructions of binary weak PRFs. 477-482 - Amitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally, Anuj Kumar Yadav:
On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels. 483-488 - Alessandro Budroni, Erik Mårtensson:
Improved Estimation of Key Enumeration with Applications to Solving LWE. 495-500 - Agostino Capponi, Mihailo Stojnic:
Causal Inference - closed form expressions for worst case typical phase transitions. 501-506 - Agostino Capponi, Mihailo Stojnic:
Phase Transitions: Explicit relations for sparse vector and low rank recovery. 507-512 - Yigit Efe Erginbas, Justin Singh Kang, Amirali Aghazadeh, Kannan Ramchandran:
Efficiently Computing Sparse Fourier Transforms of q-ary Functions. 513-518 - Lei Liu, Yuhao Chi, Ying Li, Zhaoyang Zhang:
Generalized Linear Systems with OAMP/VAMP Receiver: Achievable Rate and Coding Principle. 519-524 - Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Federated Neural Compression Under Heterogeneous Data. 525-530 - Giuseppe Serra, Photios A. Stavrou, Marios Kountouris:
Computation of Rate-Distortion-Perception Function under f-Divergence Perception Constraints. 531-536 - Yuta Nakahara, Shota Saito, Koshi Shimada, Toshiyasu Matsushima:
Hyperparameter Learning of Bayesian Context Tree Models. 537-542 - Emrah Akyol, Anju Anand:
Strategic Quantization. 543-548 - Lucas Monteiro Paes, Rodrigo Cruz, Flávio P. Calmon, Mario Díaz:
On the Inevitability of the Rashomon Effect. 549-554 - Sattar Vakili, Michael Bromberg, Jezabel R. Garcia, Da-Shan Shiu, Alberto Bernacchia:
Information Gain and Uniform Generalization Bounds for Neural Kernel Models. 555-560 - Navjot Singh, Suhas N. Diggavi:
Representation Transfer Learning via Multiple Pre-trained models for Linear Regression. 561-566 - Dganit Hanania, Daniella Bar-Lev, Yevgeni Nogin, Yoav Shechtman, Eitan Yaakobi:
On the Capacity of DNA Labeling. 567-572 - Tuan Thanh Nguyen, Kui Cai, Han Mao Kiah, Duc Tu Dao, Kees A. Schouhamer Immink:
On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes. 573-578 - Avital Boruchovsky, Daniella Bar-Lev, Eitan Yaakobi:
DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems. 579-584 - Maria Abu Sini, Andreas Lenz, Eitan Yaakobi:
DNA Synthesis Using Shortmers. 585-590 - Akram Saleh, M. Reza Soleymani:
A Novel Construction Technique for Some Classes of Quasi-Cyclic Codes. 591-595 - Sudarshan Adiga, Xin Xiao, Ravi Tandon, Bane Vasic, Tamal Bose:
Generalization Bounds for Neural Belief Propagation Decoders. 596-601 - Jean-François Biasse, Giacomo Micheli:
A Search-to-Decision Reduction for the Permutation Code Equivalence Problem. 602-607 - Yixin Wang, Xiao Ma:
On Reliably Decodable Information Bits of Linear Codes. 608-612 - Avijit Mandal, Sarah Brandsen, Henry D. Pfister:
Belief-Propagation with Quantum Messages for Polar Codes on Classical-Quantum Channels. 613-618 - Varsha Tiwari, Pramod Kumar Kewat:
CSS codes and QSCs from Whiteman's Generalized Cyclotomy of order four. 619-624 - Wouter Rozendaal, Gilles Zémor:
A Worst-Case Analysis of a Renormalisation Decoder for Kitaev's Toric Code. 625-629 - Eric Chitambar, Felix Leditzky:
On the Duality of Teleportation and Dense Coding. 630-635 - Zuo Ye, Ohad Elishco:
Codes Over Absorption Channels. 636-641 - Tamoghno Nath, Adrish Banerjee:
On Novel ISI-Reducing Channel Codes for Molecular Communication via Diffusion. 642-647 - Cheuk Ting Li, Sherman S. M. Chow:
Unconditionally Secure Access Control Encryption. 648-653 - Julien Béguinot, Yi Liu, Olivier Rioul, Wei Cheng, Sylvain Guilley:
Maximal Leakage of Masked Implementations Using Mrs. Gerber's Lemma for Min-Entropy. 654-659 - Yifeng Chu, Maxim Raginsky:
Majorizing Measures, Codes, and Information. 660-665 - Jingbo Liu:
From Soft-Minoration to Information-Constrained Optimal Transport and Spiked Tensor Models. 666-671 - Cheng-Yu Pai, Zi Long Liu, Chunlei Li, Chao-Yu Chen:
Sparse Complementary Pairs with Additional Aperiodic ZCZ Property. 672-677 - Yu Tsunoda, Yuichiro Fujiwara:
The Asymptotics of Difference Systems of Sets for Synchronization and Phase Detection. 678-683 - Yeow Meng Chee, Tien Long Nguyen, Vinh Duc Tran, Van Khu Vu:
Maximal Length Constrained de Bruijn Sequences. 684-689 - Dan Zhang, Staal Amund Vinterbo:
A New Family of Perfect Polyphase Sequences with Low Cross-Correlation. 690-694 - Dor Tsur, Bashar Huleihel, Haim H. Permuter:
Rate Distortion via Constrained Estimated Mutual Information Minimization. 695-700 - Ezgi Özyilkan, Johannes Ballé, Elza Erkip:
Learned Wyner-Ziv Compressors Recover Binning. 701-706 - Teng-Hui Huang, Hesham El Gamal:
Efficient Alternating Minimization Solvers for Wyner Multi-View Unsupervised Learning. 707-712 - Hesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti:
Compression with Unlabeled Graph Side Information. 713-718 - Heng Zhu, Avishek Ghosh, Arya Mazumdar:
Optimal Compression of Unit Norm Vectors in the High Distortion Regime. 719-724 - Zhusheng Wang, Sennur Ulukus:
Private Set Union Based Approach to Enable Private Federated Submodel Learning. 725-730 - Francesco Pase, Szymon Kobus, Deniz Gündüz, Michele Zorzi:
Semantic Communication of Learnable Concepts. 731-736 - Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Differentially-Private Collaborative Online Personalized Mean Estimation. 737-742 - Mohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan:
A New Formulation of Lossy Quantum-Classical and Classical Source Coding based on a Posterior Channel. 743-748 - Zahra Baghali Khanian, Kohdai Kuroiwa, Debbie W. Leung:
Rate-Distortion Theory for Mixed States. 749-754 - Kaiyuan Ji, Eric Chitambar:
Entropic and Operational Characterizations of Dynamic Quantum Resources. 755-760 - Sayantan Chakraborty, Upendra Kapshikar:
A novel chain rule for one-shot entropic quantities via operational methods. 761-766 - Takashi Takahashi:
Role of Bootstrap Averaging in Generalized Approximate Message Passing. 767-772 - Pablo Pascual Cobo, Kuan Hsieh, Ramji Venkataramanan:
Bayes-Optimal Estimation in Generalized Linear Models via Spatial Coupling. 773-778 - Dang Qua Nguyen, Taejoon Kim:
On The Stability of Approximate Message Passing with Independent Measurement Ensembles. 779-784 - Yizhou Xu, Yuhao Liu, Shansuo Liang, Ting-Yi Wu, Bo Bai, Jean Barbier, TianQi Hou:
Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing. 785-790 - Kel Levick, Ilan Shomorony:
Fundamental Limits of Multiple Sequence Reconstruction from Substrings. 791-796 - Shubhransh Singhvi, Avital Boruchovsky, Han Mao Kiah, Eitan Yaakobi:
Data-Driven Bee Identification for DNA Strands. 797-802 - Kayvon Mazooji, Ilan Shomorony:
Substring Density Estimation from Traces. 803-808 - Krishna Gopal Benerjee, Adrish Banerjee:
Bounds on Size of Homopolymer Free Codes. 809-814 - Chao Chen, Yunghsiang S. Han, Nianqi Tang, Sian-Jheng Lin, Baoming Bai, Xiao Ma:
An Early-Termination Method for the Welch-Berlekamp Algorithm. 815-819 - Thomas Jerkovits, Hannes Bartz, Antonia Wachter-Zeh:
Randomized Decoding of Linearized Reed-Solomon Codes Beyond the Unique Decoding Radius. 820-825 - Zhongwei Li, Yunghsiang Sam Han, Sian-Jheng Lin, Chao Chen:
An Efficient Reed-Solomon Erasure Code over Cantor-constructed Binary Extension Finite Fields. 826-831 - Yizhou Zhao, Hua Sun:
The Optimal Rate of MDS Variable Generation. 832-837 - Zihui Yan, Guanjin Qu, Huaming Wu:
A Novel Soft-In Soft-Out Decoding Algorithm for VT Codes on Multiple Received DNA Strands. 838-843 - Ben Langton, Netanel Raviv:
A Generalized Covering Algorithm for Chained Codes. 844-849 - Lang He, Min Ye:
The size of Levenshtein ball with radius 2: Expectation and concentration bound. 850-855 - Chih Wei Ling, Cheuk Ting Li:
Vector Quantization with Error Uniformly Distributed over an Arbitrary Set. 856-861 - Naruki Shinohara, Hideki Yagi:
Utility-Privacy Trade-Offs with Limited Leakage for Encoder. 862-867 - Szymon Kobus, Tze-Yang Tung, Deniz Gündüz:
Goal-oriented Compression with a Constrained Decoder. 868-873 - Ruze Zhang, Xuan Guang:
Zero-Error Distributed Function Compression. 874-879 - Shibsankar Das, Adrish Banerjee, Udaya Parampalli:
Two-Dimensional Z-Complementary Array Quads with Low Column Sequence PMEPRs. 880-885 - Jin Sima, Yun-Han Li, Ilan Shomorony, Olgica Milenkovic:
On Constant-Weight Binary B2-Sequences. 886-891 - Xiaoxiang Jin, Sangwon Chae, Hyunwoo Cho, Hyojeong Choi, Gangsan Kim, Hong-Yeop Song:
Zero-Correlation-Zone Sonar Sequences. 892-896 - Gangsan Kim, Hyojeong Choi, Daekyeong Kim, Won Jun Kim, Xiaoxiang Jin, Hong-Yeop Song:
Optimal Uncorrelated Polyphase ZCZ Sequences over an Alphabet of Minimum size. 897-902 - Ruida Zhou, Chao Tian, Tie Liu:
Exactly Tight Information-Theoretic Generalization Error Bound for the Quadratic Gaussian Problem. 903-908 - Yu-Jui Huang, Shih-Chun Lin, Yu-Chih Huang, Kuan-Hui Lyu, Hsin-Hua Shen, Wan-Yi Sabrina Lin:
On characterizing optimal Wasserstein GAN solutions for non-Gaussian data. 909-914 - Monica Welfert, Kyle Otstot, Gowtham R. Kurri, Lalitha Sankar:
(αD, αG)-GANs: Addressing GAN Training Instabilities via Dual Objectives. 915-920 - Xingyu Lu, Basak Güler:
Breaking the Quadratic Communication Overhead of Secure Multi-Party Neural Network Training. 921-926 - Ittai Rubinstein, Roni Con:
Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel. 927-932 - William Lu, Anuran Makur:
Permutation Sum-Capacity of Binary Adder Multiple-Access Channels. 933-938 - Michael Langberg, Oron Sabag:
Competitive Channel-Capacity. 939-944 - Jun Su, Guangyue Han, Shlomo Shamai Shitz:
Feedback Capacity of OU-Colored AWGN Channels. 945-950 - Siqi Fan, Yuxin Zhong, I-Hong Hou, Clement Kam:
Minimizing Moments of AoI for Both Active and Passive Users through Second-Order Analysis. 951-956 - Priyanka Kaswan, Sennur Ulukus:
Age of Information With Non-Poisson Updates in Cache-Updating Networks. 957-962 - Priyanka Kaswan, Sennur Ulukus:
Reliable and Unreliable Sources in Age-Based Gossiping. 963-968 - Zhiling Yue, Howard H. Yang, Meng Zhang, Nikolaos Pappas:
Age of Information Under Frame Slotted ALOHA in Random Access Networks. 969-974 - Sayantan Chakraborty, Aditya Nema, Francesco Buscemi:
Generalized resource theory of purity: one-shot purity distillation with local noisy operations and one way classical communication. 980-984 - Matthias Christandl, Mads Friis Frand-Madsen:
On the Relation between Quantum Data Hiding and Quantum Key Distribution. 985-990 - Yu-Chen Shen, Li Gao, Hao-Chung Cheng:
Optimal Second-Order Rates for Quantum Information Decoupling. 991-996 - Wrya K. Kadir, Hsuan-Yin Lin, Eirik Rosnes:
Efficient Interpolation-Based Decoding of Reed-Solomon Codes. 997-1002 - Stanislav Kruglik, Gaojun Luo, Wilton Kim, Shubhransh Singhvi, Han Mao Kiah, San Ling, Huaxiong Wang:
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes. 1003-1008 - Harshithanjani Athi, Rasagna Chigullapally, Prasad Krishnan, V. Lalitha:
On the Structure of Higher Order MDS Codes. 1009-1014 - Chao Chen, Sian-Jheng Lin, Zhongwei Li, Suihua Cai, Yunghsiang S. Han, Bo Bai:
Reduced-Complexity Erasure Decoding of Low-Rate Reed-Solomon Codes Based on LCH-FFT. 1015-1019 - Ying Jin:
Upper bounds on the Natarajan dimensions of some function classes. 1020-1025 - Akshayaa Magesh, Venugopal V. Veeravalli, Anirban Roy, Susmit Jha:
Principled OOD Detection via Multiple Testing. 1026-1031 - Xiangxiang Xu, Lizhong Zheng:
Kernel Subspace and Feature Extraction. 1032-1037 - Mehdi Molkaraie:
The Exact Determinant of a Specific Class of Sparse Positive Definite Matrices. 1038-1043 - Ahmed Elshafiy, Mahmoud Namazi, Kenneth Rose:
A Stochastic Rate-Distortion Approach to Supervised Learning Systems. 1044-1049 - Photios A. Stavrou, Yanina Shkel, Marios Kountouris:
Indirect Rate Distortion Functions with f-Separable Distortion Criterion. 1050-1055 - Yassine Hamdi, Deniz Gündüz:
The Rate-Distortion-Perception Trade-off with Side Information. 1056-1061 - Nir Weinberger, Ilan Shomorony:
Fundamental Limits of Reference-Based Sequence Reordering. 1062-1067 - Xueyan Niu, Deniz Gündüz, Bo Bai, Wei Han:
Conditional Rate-Distortion-Perception Trade-Off. 1068-1073 - Chunhui Chen, Xueyan Niu, Wenhao Ye, Shitong Wu, Bo Bai, Weichao Chen, Sian-Jheng Lin:
Computation of Rate-Distortion-Perception Functions With Wasserstein Barycenter. 1074-1079 - Wei An, Muriel Médard, Ken R. Duffy:
Soft decoding without soft demapping with ORBGRAND. 1080-1084 - Zeynep Ece Kizilates, Arslan Riaz, Giacomo F. Coraluppi, Muriel Médard, Ken R. Duffy, Rabia Tugce Yazicigil:
Leveraging Noise Recycling in Soft Detection Decoding Using ORBGRAND. 1085-1089 - Hadi Sarieddeen, Peihong Yuan, Muriel Médard, Ken R. Duffy:
Soft-input, soft-output joint data detection and GRAND: A performance and complexity analysis. 1090-1095 - Marwan Jalaleddine, Huayi Zhou, Jiajie Li, Warren J. Gross:
Partial Ordered Statistics Decoding with Enhanced Error Patterns. 1096-1100 - Michael Rudow, K. V. Rashmi:
Learning-augmented streaming codes for variable-size messages under partial burst losses. 1101-1106 - Takayuki Nozaki:
Rate-Optimal Streaming Codes over Small Finite Fields for Burst/Random Erasure Channels. 1107-1111 - M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar:
Explicit Information-Debt-Optimal Streaming Codes With Small Memory. 1112-1117 - Vinayak Ramkumar, Shobhit Bhatnagar, P. Vijay Kumar:
Near-Optimal Streaming Codes with Linear Field Size. 1118-1123 - Pin-Wen Su, Yu-Chih Huang, Shih-Chun Lin, I-Hsiang Wang, Chih-Chun Wang:
Detailed Asymptotics of the Delay-Reliability Tradeoff of Random Linear Streaming Codes. 1124-1129 - Tuan Thanh Nguyen, Panpan Li, Kui Cai, Kees A. Schouhamer Immink:
Locally Mitigating Sneak-Path Interference in Resistive Memory Arrays. 1130-1135 - Yuval Ben-Hur, Yuval Cassuto:
Construction and Decoding of Codes over the Dual-Parameter Barrier Error Model. 1136-1141 - Jiaojiao Wang, Zitan Chen:
Low-access repair of Reed-Solomon codes in rack-aware storage. 1142-1147 - Shuche Wang, Van Khu Vu, Vincent Y. F. Tan:
Codes for Correcting t Limited-Magnitude Sticky Deletions. 1148-1153 - Arian Eamaz, Farhang Yeganegi, Deanna Needell, Mojtaba Soltanalian:
One-Bit Quadratic Compressed Sensing: From Sample Abundance to Linear Feasibility. 1154-1159 - Sravan Kumar Ankireddy, S. Ashwin Hebbar, Yihan Jiang, Pramod Viswanath, Hyeji Kim:
Compressed Error HARQ: Feedback Communication on Noise-Asymmetric Channels. 1160-1165 - Mahdi Soleymani, Qiang Liu, Hessam Mahdavifar, Laura Balzano:
Matrix Completion over Finite Fields: Bounds and Belief Propagation Algorithms. 1166-1171 - Saikiran Bulusu, Venkata Gandikota, Pramod K. Varshney:
1-Bit Compressed Sensing with Local Sparsity Patterns. 1172-1177 - Teng Fu, Yuhao Liu, Jean Barbier, Marco Mondelli, Shansuo Liang, TianQi Hou:
Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noise. 1178-1183 - Jian-Jia Weng, Fady Alajaji, Tamás Linder:
Capacity of Finite-State Two-Way Channels. 1184-1189 - Jonathan Ponniah, Liang-Liang Xie:
A Framework for Information-Theoretic Converses. 1190-1195 - Mohammad Kazemi, Tolga M. Duman:
Capacity Bounds for the Poisson-Repeat Channel. 1196-1201 - Johannes Rosenberger, Abdalla Ibrahim, Boulat A. Bash, Christian Deppe, Roberto Ferrara, Uzi Pereg:
Capacity Bounds for Identification With Effective Secrecy. 1202-1207 - Amos Lapidoth, Yiming Yan:
On the Zero-Error Capacity with Helper. 1208-1212 - Vanlalruata Ralte, Amitalok J. Budkuley, Stefano Rini:
Optimal Strategies for Distributed Sampling and Detection of Poisson Processes. 1213-1218 - Xiao-Wen Chang, Qincheng Lu, Yingzi Xu:
Success Probabilities of L2-norm Regularized Babai Detectors and Maximization. 1219-1224 - Eeshan Modak, Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents. 1225-1230 - Ran Tamir:
On Correlation Detection of Gaussian Databases via Local Decision Making. 1231-1236 - Asaf Rotenberg, Wasim Huleihel, Ofer Shayevitz:
Detecting a Planted Bipartite Graph. 1237-1242 - Joshua Brakensiek, Manik Dhar, Sivakanth Gopi:
Improved Field Size Bounds for Higher Order MDS Codes. 1243-1248 - Jingjie Lv, Weijun Fang, Bin Chen, Shu-Tao Xia, Xiangyu Chen:
Binary MDS Array Codes with Flexible Array Dimensions and Their Fast Encoding. 1249-1254 - Fuqiang Sun, Qin Huang, Jiayi Rui, Ting-Yi Wu, Yunghsiang Sam Han:
Side Encoding for MDS Array Codes. 1255-1260 - Abdullah Murad, Wai Ho Mow:
Some New Constructions of AFER-Optimal Binary Linear Block Codes. 1261-1265 - Ilya Vorobyev, Vladimir S. Lebedev, Alexey V. Lebedev:
Correcting One Error in Non-Binary Channels with Feedback. 1266-1270 - Zita Abreu, Julia Lieb, Joachim Rosenthal:
Binary convolutional codes with optimal column distances. 1271-1276 - Xiaomeng Chen, Aimin Li, Shaohua Wu:
Tight Upper Bounds on the Error Probability of Spinal Codes over Fading Channels. 1277-1282 - Praveen Kumar, Sudhan Majhi, Subhabrata Paul:
A Direct Construction of Optimal Symmetrical Z-Complementary Code Sets of Prime Power Lengths. 1283-1287 - Nishant Kumar, Sudhan Majhi, Subhabrata Paul:
A New and Direct Construction of Asymptotically Optimal Multiple Sets of Multiple Zero-Correlation Zone Sequence Sets. 1288-1293 - Michel Rigo, Manon Stipulanti, Markus A. Whiteland:
Gapped Binomial Complexities in Sequences. 1294-1299 - Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
Levenshtein's Reconstruction Problem with Different Error Patterns. 1300-1305 - Amaury Gouverneur, Borja Rodríguez Gálvez, Tobias J. Oechtering, Mikael Skoglund:
Thompson Sampling Regret Bounds for Contextual Bandits with sub-Gaussian rewards. 1306-1311 - Osama A. Hanna, Merve Karakas, Lin F. Yang, Christina Fragouli:
Multi-Arm Bandits over Action Erasure Channels. 1312-1317 - Meng-Che Chang, Matthieu R. Bloch:
Distributed Stochastic Bandits with Corrupted and Defective Input Commands. 1318-1323 - Rémi A. Chou, Jörg Kliewer:
Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage. 1324-1329 - Roni Con, Noah Shutty, Itzhak Tamo, Mary Wootters:
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums. 1330-1335 - Maximilian Egger, Serge Kas Hanna, Rawad Bitar:
Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load. 1336-1341 - Chen Wang, Yiwei Zhang:
PIR array codes: the optimality of Blackburn-Etzion construction. 1342-1347 - Srikar Kale, Keshav Agarwal, Prasad Krishnan:
t-PIR Schemes with Flexible Parameters via Star Products of Berman Codes. 1348-1353 - Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah, Huaxiong Wang:
Two-Server Private Information Retrieval with Optimized Download Rate and Result Verification. 1354-1359 - Chih-Chun Wang, David J. Love:
Optimal Learning Rate of Sending One Bit Over Arbitrary Acyclic BISO-Channel Networks. 1360-1365 - Daisuke Takeuchi, Shun Watanabe:
Tight Exponential Strong Converse for Source Coding Problem with Encoded Side Information. 1366-1371 - Yutaka Jitsumatsu:
Computation of Marton's Error Exponent for Discrete Memoryless Sources. 1372-1377 - Greg Fields, Tara Javidi:
Sequential Hypothesis Testing for Markov Chains. 1378-1383 - Wen-Hsuan Li, Yu-Chih Huang:
Bandwidth-Constrained Distributed Quickest Change Detection in Heterogeneous Sensor Networks: Anonymous vs Non-Anonymous Settings. 1384-1389 - Anuran Makur, Japneet Singh:
Testing for the Bradley-Terry-Luce Model. 1390-1395 - Vipul Arora, Arnab Bhattacharyya, Clément L. Canonne, Joy Qiping Yang:
Near-Optimal Degree Testing for Bayes Nets. 1396-1401 - Jiaxin Wang, Yadi Wei, Zhe Sun, Fang-Wei Fu:
MacWilliams-Like Identities for Certain Vectorial Bent Functions. 1402-1407 - Ron M. Roth:
On the Implementation of Boolean Functions on Content-Addressable Memories. 1408-1413 - Fei Guo, Zilong Wang, Guang Gong:
Constructing Quadratic and Cubic Negabent Functions over Finite Fields. 1414-1418 - Zhi Gu, Avik Ranjan Adhikary, Zhengchun Zhou, Meng Yang:
A Computational Design of Unimodular Complementary and Z-complementary Sets. 1419-1424 - Daisaburo Yoshioka:
Periodic Properties of Commutative Polynomials Defined by Fourth Order Recurrence Relations with Two Variables Over Z2k. 1425-1429 - Michael X. Cao, Navneeth Ramakrishnan, Mario Berta, Marco Tomamichel:
Broadcast Channel Simulation. 1430-1435 - Baris Göktepe, Cornelius Hellge, Tatiana Rykova, Thomas Schierl, Slawomir Stanczak:
On the Limits of HARQ Prediction for Short Deterministic Codes with Error Detection in Memoryless Channels. 1436-1441 - Adeel Mahmood, Aaron B. Wagner:
Timid/Bold Coding for Channels with Cost Constraints. 1442-1447 - James Y. Chen, Recep Can Yavas, Victoria Kostina:
Variable-Length Codes with Bursty Feedback. 1448-1453 - Chengshuai Shi, Wei Xiong, Cong Shen, Jing Yang:
Reward Teaching for Federated Multi-armed Bandits. 1454-1459 - Chengshuai Shi, Cong Shen, Nicholas D. Sidiropoulos:
On High-dimensional and Low-rank Tensor Bandits. 1460-1465 - Kota Srinivas Reddy, P. N. Karthik, Nikhil Karamchandani, Jayakrishnan Nair:
Best Arm Identification in Bandits with Limited Precision Sampling. 1466-1471 - Ranga Shaarad Ayyagari, Ambedkar Dukkipati:
Risk-Averse Combinatorial Semi-Bandits. 1472-1477 - Etam Benger, Shahab Asoodeh, Jun Chen:
The Cardinality Bound on the Information Bottleneck Representations is Tight. 1478-1483 - Yi Song, Hao Xu, Kai-Kit Wong, Giuseppe Caire, Shlomo Shamai Shitz:
Distributed Information Bottleneck for a Primitive Gaussian Diamond MIMO Channel. 1484-1489 - Lingyi Chen, Shitong Wu, Wenhao Ye, Huihui Wu, Hao Wu, Wenyi Zhang, Bo Bai, Yining Sun:
Information Bottleneck Revisited: Posterior Probability Perspective with Optimal Transport. 1490-1495 - Jiangnan Cheng, Sandeep Chinchali, Ao Tang:
Task-aware Network Coding over Butterfly Network. 1496-1501 - Oliver Kosut, Michelle Effros, Michael Langberg:
Perfect vs. Independent Feedback in the Multiple-Access Channel. 1502-1507 - Yossef Steinberg:
Relay Channels with Unreliable Helpers. 1508-1513 - Reza Khosravi-Farsani, Wei Yu:
Gaussian Broadcast Channels with Bidirectional Conferencing Decoders and Correlated Noises. 1514-1519 - Sajani Vithana, Sennur Ulukus:
Private Read Update Write (PRUW) With Heterogeneous Databases. 1520-1525 - Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes:
Single-Server Pliable Private Information Retrieval With Side Information. 1526-1531 - Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah, Huaxiong Wang:
k-server Byzantine-Resistant PIR Scheme with Optimal Download Rate and Optimal File Size. 1532-1537 - Hassan ZivariFard, Rémi A. Chou:
Private Information Retrieval When Private Noisy Side Information is Available. 1538-1543 - Hsin-Po Wang, Chi-Wei Chin:
Density Devolution for Ordering Synthetic Channels. 1544-1549 - Ting-Chun Lin, Hsin-Po Wang:
Optimal Self-Dual Inequalities to Order Polarized BECs. 1550-1555 - Hsin-Po Wang, Venkatesan Guruswami:
How Many Matrices Should I Prepare To Polarize Channels Optimally Fast? 1556-1561 - Hsin-Po Wang, Vlad-Florin Dragoi:
Fast Methods for Ranking Synthetic BECs. 1562-1567 - Jun Diao, Lin Zhou, Lin Bai:
Achievable Error Exponents for Almost Fixed-Length M-ary Classification. 1568-1573 - Jingbo Liu:
Stability Analysis of the Gaussian Han-Kobayashi Region for Z-Interference Channels. 1574-1579 - Chunsong Sun, Lin Zhou:
Achievable Resolution Limits of Noisy Adaptive 20 Questions Estimation for Multiple Targets. 1580-1585 - Haobo Jia, Zhuqing Jia:
X-Secure T-Private Linear Computation With Graph Based Replicated Storage. 1586-1591 - Tianyou Pei, Wei Kang, Nan Liu:
The Capacity of Oblivious Transfer with Replicated Databases and Binary Erasure Multiple Access Channel. 1592-1596 - Zirui Deng, Netanel Raviv:
Approximate Private Inference in Quantized Models. 1597-1602 - Yuhang Yao, Syed Ali Jafar:
The Capacity of 4-Star-Graph PIR. 1603-1608 - Hsin-Po Wang, Ryan Gabrys, Venkatesan Guruswami:
Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett's Nonadaptive Splitting with Explicit Scalars. 1609-1614 - Sarthak Jain, Martina Cardone, Soheil Mohajer:
Probabilistic Group Testing in Distributed Computing with Attacked Workers. 1615-1620 - Surin Ahn, Wei-Ning Chen, Ayfer Özgür:
Noisy Adaptive Group Testing for Community-Oriented Models. 1621-1626 - Nicholas Kwan, Lele Wang:
Constructions for Nonadaptive Tropical Group Testing. 1627-1632 - Foo Yee Yeo, Jason H. M. Ying:
Third-Party Private Set Intersection. 1633-1638 - Syomantak Chaudhuri, Thomas A. Courtade:
Mean Estimation Under Heterogeneous Privacy: Some Privacy Can Be Free. 1639-1644 - Hyun-Young Park, Seung-Hyun Nam, Si-Hyeon Lee:
Block Design-Based Local Differential Privacy Mechanisms. 1645-1650 - Mahshad Shariatnasab, Farhad Shirani, S. Sitharama Iyengar:
The Privacy-Utility Tradeoff in Rank-Preserving Dataset Obfuscation. 1651-1656 - Daniella Bar-Lev, Avi Mizrahi, Tuvi Etzion, Ori Rottenstreich, Eitan Yaakobi:
Coding for IBLTs with Listing Guarantees. 1657-1662 - Kordag Mehmet Kilic, Jin Sima, Jehoshua Bruck:
On the Information Capacity of Nearest Neighbor Representations. 1663-1668 - Ran Tamir:
Reaching Consensus in Dense Erdős-Rényi Graphs. 1669-1674 - Holger Boche, Yannik N. Böck:
Arithmetic Complexity of Frequency-Domain Representations of Time-Computable Signals. 1675-1680 - Adriano Pastore, Sung Hoon Lim, Chen Feng, Bobak Nazer, Michael Gastpar:
Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources. 1681-1686 - Michael Dikshtein, Nir Weinberger, Shlomo Shamai Shitz:
On Mismatched Oblivious Relaying. 1687-1692 - Sagnik Bhattacharya, Prakash Narayan:
Shared Information for the Cliqueylon Graph. 1693-1698 - Johannes Rosenberger, Abdalla Ibrahim, Christian Deppe, Roberto Ferrara:
Deterministic Identification Over Multiple-Access Channels. 1699-1704 - Cheng-Yu Kao, Chung-Hsuan Wang, Chi-Chao Chao:
Improved Belief Propagation Decoders for Polar Codes. 1705-1710 - Dar Arava, Ido Tal:
Stronger Polarization for the Deletion Channel. 1711-1716 - Anatolii Ashikhmin, Peter Trifonov:
Efficient Evaluation of Polarization Behavior for Large Kernels. 1717-1722 - Abdullah Murad, Wai Ho Mow:
New Search for the Polarization-Adjusted Convolutional Codes with Respect to the AFER-Optimality Criterion. 1723-1728 - Roberto Assis Machado, Gretchen L. Matthews, Welington Santos:
HerA Scheme: Secure Distributed Matrix Multiplication via Hermitian Codes. 1729-1734 - Ilan Tennenhouse, Netanel Raviv:
Transaction Confirmation in Coded Blockchain. 1735-1740 - Liyuan Song, Li Tang, Yi Wu:
An Optimal Coded Matrix Multiplication Scheme for Leveraging Partial Stragglers. 1741-1746 - Dong Wang, Weijun Fang, Sihuang Hu:
Optimal (2, δ) Locally Repairable Codes via Punctured Simplex Codes. 1747-1752 - Manik Dhar, Sivakanth Gopi:
A construction of Maximally Recoverable LRCs for small number of local groups. 1753-1757 - Hengfeng Jin, Yao Tian, Fang-Wei Fu:
Some Constructions of Perfect and k-optimal (r,δ)-LRCs. 1758-1763 - Smarajit Das:
Codes on Matrices and Some Applications. 1764-1769 - Riddhi Ghosal, Amit Sahai:
Building Hard Problems by Combining Easy Ones. 1770-1775 - Shelvia Wongso, Rohan Ghosh, Mehul Motani:
Pointwise Sliced Mutual Information for Neural Network Explainability. 1776-1781 - Ziao Wang, Nadim Ghaddar, Banghua Zhu, Lele Wang:
Variable-Length Insertion-Based Noisy Sorting. 1782-1787 - Banghua Zhu, Ziao Wang, Nadim Ghaddar, Jiantao Jiao, Lele Wang:
On the Optimal Bounds for Noisy Computing. 1788-1793 - Behnoosh Zamanlooy, Shahab Asoodeh:
Strong Data Processing Inequalities for Locally Differentially Private Mechanisms. 1794-1799 - Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka:
Data Compression with Private Local Decodability. 1800-1805 - Elena Ghazi, Ibrahim Issa:
Total Variation with Differential Privacy: Tighter Composition and Asymptotic Bounds. 1806-1811 - Carolina Naim, Fangwei Ye, Salim El Rouayheb:
On the Privacy of Social Networks with Personal Privacy Choices. 1812-1817 - Mehrasa Ahmadipour, Michèle A. Wigger, Shlomo Shamai:
Strong Converses for Memoryless Bi-Static ISAC. 1818-1823 - Max H. M. Costa, Amin Gohari, Chandra Nair, David Ng:
A Proof of the Noiseberg Conjecture for the Gaussian Z-Interference Channel. 1824-1829 - Lanwei Zhang, Jamie S. Evans, Jingge Zhu:
CFMA for Gaussian MIMO Multiple Access Channels. 1830-1835 - Yinfei Xu, Tao Guo, Daming Cao, Wei Xu:
Capacity-Distortion Tradeoff of Noisy Gaussian State Amplification. 1836-1841 - Chaorui Yao, Pavlos Nikolopoulos, Christina Fragouli:
A Diagonal Splitting Algorithm for Adaptive Group Testing. 1842-1847 - Yun-Han Li, Ryan Gabrys, Jin Sima, Ilan Shomorony, Olgica Milenkovic:
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing. 1848-1853 - Mahdi Soleymani, Hessam Mahdavifar, Tara Javidi:
Non-adaptive Quantitative Group Testing via Plotkin-Type Constructions. 1854-1859 - Mgeni Makambi Mashauri, Alexandre Graell i Amat, Michael Lentmaier:
Low-Density Parity-Check Codes and Spatial Coupling for Quantitative Group Testing. 1860-1865 - H. S. Melihcan Erol, Erixhen Sula, Lizhong Zheng:
On Semi-Supervised Estimation of Distributions. 1866-1871 - Leighton Pate Barnes, Alex Dytso, H. Vincent Poor:
L1 Estimation in Gaussian Noise: On the Optimality of Linear Estimators. 1872-1877 - Xinyi Tong, Tianren Peng, Shao-Lun Huang:
An Information Theoretic Approach for Collaborative Distributed Parameter Estimation. 1878-1883 - Puning Zhao, Lifeng Lai:
Entropy Rate Estimation for Markov Chains with Continuous Distributions. 1884-1889 - Ziv Aharoni, Bashar Huleihel, Henry D. Pfister, Haim H. Permuter:
Data-Driven Polar Codes for Unknown Channels With and Without Memory. 1890-1895 - Tyler Kann, Shrinivas Kudekar, Matthieu R. Bloch:
Source Polarization-Adjusted Convolutional Codes. 1896-1901 - Jaswanthi Mandalapu, Avhishek Chatterjee, Krishna P. Jagannathan, Andrew Thangaraj:
Capacity Achieving Codes for an Erasure Queue-channel. 1902-1907 - Zuoxin Cai, Li Chen, Wenxin Liu, Huazi Zhang:
Modified PAC Codes. 1908-1913 - Youyi Huang, Lu Wei:
Exact variances of von Neumann entropy over fermionic Gaussian states. 1914-1918 - Aadil Oufkir:
Sample-Optimal Quantum Process Tomography with non-adaptive Incoherent Measurements. 1919-1924 - Hafez M. Garmaroudi, S. Sandeep Pradhan, Jun Chen:
Rate-limited Quantum-to-Classical Optimal Transport: A Lossy Source Coding Perspective. 1925-1930 - Guangkuo Liu, Peixue Wu, Haneul Kim, Marius Junge:
Quantum secret sharing and tripartite information. 1931-1936 - Yuchen Zeng, Hongxu Chen, Kangwook Lee:
Federated Learning with Local Fairness Constraints. 1937-1942 - Yilei Xue, Xi Lin, Jun Wu, Jianhua Li:
Wireless Coded Distributed Learning with Gaussian-based Local Differential Privacy. 1943-1948 - Mehrdad Pournaderi, Yu Xiang:
Sample-and-Forward: Communication-Efficient Control of the False Discovery Rate in Networks. 1949-1954 - Olusola Tolulope Odeyomi:
Differentially Private Online Federated Learning With Personalization and Fairness. 1955-1960 - Rumia Sultana, Vidhi Rana, Rémi A. Chou:
Secret Sharing Over a Gaussian Broadcast Channel: Optimal Coding Scheme Design and Deep Learning Approach at Short Blocklength. 1961-1966 - Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Access-Redundancy Tradeoffs in Quantized Linear Computations. 1967-1972 - Han Mao Kiah, Wilton Kim, Stanislav Kruglik, San Ling, Huaxiong Wang:
Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols. 1973-1978 - Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Distributed Matrix Computations with Low-weight Encodings. 1979-1984 - Christoph Hofmeister, Luis Maßny, Eitan Yaakobi, Rawad Bitar:
Trading Communication for Computation in Byzantine-Resilient Gradient Coding. 1985-1990 - George Vershinin, Asaf Cohen, Omer Gurewitz:
Order-Optimal Joint Transmission and Identification in Massive Multi-User MIMO via Group Testing. 1991-1996 - Cheng-En Lee, Hsiao-Wen Yu, Cheng-Shang Chang, Duan-Shin Lee:
Upper Bounds for the Stability Regions of Coded Poisson Receivers. 1997-2002 - Li Qiao, Zhen Gao, Zhongxiang Li, Deniz Gündüz:
Unsourced Massive Access-Based Digital Over-the-Air Computation for Efficient Federated Edge Learning. 2003-2008 - Lina Liu, Dongning Guo:
An Asynchronous Massive Access Scheme with Dynamic Range Considerations. 2009-2014 - Ryan Song, Kareem M. Attiah, Wei Yu:
Coded Downlink Massive Random Access. 2015-2020 - Clifton Garrison, Giacomo Micheli, Logan Nott, Vincenzo Pallozzi Lavorante, Phillip Waitkevich:
On a Class of Optimal Locally Recoverable Codes with Availability. 2021-2026 - Dinh Thi Xinh, Serdar Boztas, Son Hoang Dau, Emanuele Viterbo:
Designing Compact Repair Groups for Reed-Solomon Codes. 2027-2032 - Francisco Maturana, K. V. Rashmi:
Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and Conversion. 2033-2038 - Zhou Li, Hua Sun:
On Extremal Rates of Storage over Graphs. 2039-2044 - Lei Li, Chenhao Ying, Liang Chen, Yuanyuan Dong, Yuan Luo:
New Constructions of Binary MDS Array Codes with Optimal Repair Bandwidth. 2045-2050 - Jiun-Ting Huang, Young-Han Kim:
Parallel Monte Carlo Markov Chain Decoding of Linear Codes. 2051-2056 - Galen Reeves, Henry D. Pfister:
Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes. 2057-2062 - Luca G. Tallini, Bella Bose:
On Some Zm Linear Goppa/BCH like Error Control Codes and Elementary Symmetric Functions*. 2063-2068 - Suihua Cai, Chao Chen, Yunqi Wan, Xiao Ma:
Fast Encoding of Hermitian Codes Based on Lin-Chung-Han Fast Fourier Transform. 2069-2074 - Jianguo Zhao, Li Chen:
Systematic Encoding of Elliptic Codes with Dynamic Information Sets. 2075-2080 - Farzad Pourkamali, Nicolas Macris:
Rectangular Rotational Invariant Estimator for General Additive Noise Matrices. 2081-2086 - Min-Oh Jeong, Alex Dytso, Martina Cardone:
Functional Properties of the Ziv-Zakai bound with Arbitrary Inputs. 2087-2092 - Clément L. Canonne, Ziteng Sun, Ananda Theertha Suresh:
Concentration Bounds for Discrete Distribution Estimation in KL Divergence. 2093-2098 - Yuyang Shi, Aditya Deshmukh, Yajun Mei, Venugopal V. Veeravalli:
Robust High-Dimensional Linear Discriminant Analysis under Training Data Contamination. 2099-2104 - Noam Gavish, Or Ordentlich:
Minimax Risk Upper Bounds Based on Shell Analysis of a Quantized Maximum Likelihood Estimator. 2105-2110 - Hao-Chung Cheng, Baris Nakiboglu:
The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions. 2111-2116 - Ioannis Papoutsidakis, Angela Doufexi, Robert J. Piechocki:
Efficient Evaluation of the Probability of Error of Random Coding Ensembles. 2117-2122 - Marcel Mross, Pin-Hsun Lin, Eduard A. Jorswieck:
Second-Order Performance of Early Decoding with Shell Codes in Gaussian Broadcast Channels. 2123-2128 - Neil Irwin Bernardo, Jingge Zhu, Jamie S. Evans:
Learning Channel Codes from Data: Performance Guarantees in the Finite Blocklength Regime. 2129-2134 - Yanyan Dong, Shenghao Yang:
Characterization of All Optimal Finite-length Codes of Size Four for Binary Symmetric Channels. 2135-2140 - Emna Ben Yacoub:
Weight and Trapping Set Distributions for Non-Binary Regular Low-Density Parity-Check Code Ensembles. 2141-2146 - Guodong Li, Min Ye, Sihuang Hu:
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits. 2147-2152 - Yuan Li, Zicheng Ye, Huazi Zhang, Jun Wang, Guiying Yan, Zhiming Ma:
On the Weight Spectrum Improvement of Pre-transformed Reed-Muller Codes and Polar Codes. 2153-2158 - Yanqing Liu, Yanan Dou, Yanlin Geng:
Blahut-Arimoto Algorithm for Marton's Inner Bound. 2159-2164 - Zhichao Shao, Xiaojun Yuan:
Delay-Calibrated User Activity Detection for Asynchronous Massive Random Access. 2165-2170 - Michael Rudow, Venkatesan Guruswami, K. V. Rashmi:
On expanding the toolkit of locality-based coded computation to the coordinates of inputs. 2171-2176 - Michael Rudow, Neophytos Charalambides, Alfred O. Hero III, K. V. Rashmi:
Compression-Informed Coded Computing. 2177-2182 - Kyungrak Son, Aditya Ramamoorthy:
Coded matrix computation with gradient coding. 2183-2188 - Hsuan-Po Liu, Mahdi Soleymani, Hessam Mahdavifar:
Differentially Private Coded Computing. 2189-2194 - Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Juan Felipe Gómez, Oliver Kosut, Lalitha Sankar:
Optimal Multidimensional Differentially Private Mechanisms in the Large-Composition Regime. 2195-2200 - Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Juan Felipe Gómez, Oliver Kosut, Lalitha Sankar:
Schrödinger Mechanisms: Optimal Differential Privacy Mechanisms for Small Sensitivity. 2201-2206 - Viveck R. Cadambe, Haewon Jeong, Flávio P. Calmon:
Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise. 2207-2212 - Amir-Reza Asadi, Po-Ling Loh:
On the Gibbs Exponential Mechanism and Private Synthetic Data Generation. 2213-2218 - Takeshi Kakizaki, Masanori Nakamura, Fukutaro Hamaoka, Yoshiaki Kisaka:
Theoretical analysis of achievable rates for channel-polarized multilevel coding under binary-input AWGN channels. 2219-2224 - Wei Liu, Tom Richardson, Hao Xu, Changlong Xu, Liangming Wu, Ori Shental:
Approximation Methods for Enumerating Sequences for Probabilistic Amplitude Shaping. 2225-2230 - Longguang Li, Ru-Han Chen, Jing Zhou:
On the Sum-Capacity of Two-User Optical Intensity Multiple Access Channels. 2231-2235 - Alankrita Bhatt:
Universal Prediction of m-ary Sequences. 2236-2241 - Moses Won, Gireeja Ranade:
Control of a Multiplicative Observation Noise System: MAP-based Achievable Strategy. 2242-2247 - Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger:
Maximal-Capacity Discrete Memoryless Channel Identification. 2248-2253 - Ke Sun, Samir M. Perlaza, Alain Jean-Marie:
2×2 Zero-Sum Games with Commitments and Noisy Observations. 2254-2259 - Jimmy Ming-Tai Wu, Ke Wang, Huizhen Yan, Chao-Chun Chen, Pei-Wei Chen, Jerry Chun-Wei Lin:
Updating Top-k Dominate Individuals with Incomplete Data Addition. 2260-2265 - Chanho Park, Namyoon Lee:
S3GD-MV: Sparse-SignSGD with Majority Vote for Communication-Efficient Distributed Learning. 2266-2271 - Aditya Pradeep, Michael Gastpar:
Personalized Privacy-Preserving Distributed Learning on Heterogeneous Data. 2272-2277 - Jin Sima, Chao Pan, Olgica Milenkovic:
Perturbation-Resilient Sets for Dynamic Service Balancing. 2278-2283 - Adway Patra, Alexander Barg:
Node Repair for Adversarial Graphical Networks. 2284-2289 - Derya Malak:
Weighted Graph Coloring for Quantized Computing. 2290-2295 - Wenbo Huang, Kai Wan, Hua Sun, Mingyue Ji, Robert Caiming Qiu, Giuseppe Caire:
Fundamental Limits of Distributed Linearly Separable Computation under Cyclic Assignment. 2296-2301 - Zhuangfei Wu, Lin Bai, Lin Zhou:
Successive Refinement of Shannon Cipher System Under Maximal Leakage. 2302-2307 - Shixin Tian, Zhili Dong, Kunpeng Wang, Chang Lv:
Subfield Attack on NTRU by using symmetric function map. 2308-2313 - Somnath Panja, Shaoquan Jiang, Reihaneh Safavi-Naini:
A One-way Secret Key Agreement with Security Against Active Adversaries. 2314-2319 - Amin Gohari, Gerhard Kramer:
An Upper Bound on Secret Key Rates for General Multiterminal Wiretap Channels. 2320-2325 - Fan Liu, Yifeng Xiong, Kai Wan, Tony Xiao Han, Giuseppe Caire:
Deterministic-Random Tradeoff of Integrated Sensing and Communications in Gaussian Channels: A Rate-Distortion Perspective. 2326-2331 - Xi Zhang, Jingqing Wang, H. Vincent Poor:
Modeling Statistical Delay, Error-Rate, and Joint-Delay/Error-Rate QoS-Exponents Over M-MIMO Mobile Wireless Networks Using FBC. 2332-2337 - Jesús Gómez-Vilardebó, Xavier Mestre, Mònica Navarro, Jorge Quintanilla:
Capacity of Noncoherent FSK with Doppler Frequency Uncertainty. 2338-2343 - Wenjun Jiang, Xiaojun Yuan:
RIS-Aided MIMO Systems with Simultaneous Active and Passive Information Transfer: Iterative Decoding and Evolution Analysis. 2344-2349 - Jamison R. Ebert, Jean-François Chamberland, Krishna R. Narayanan:
On Sparse Regression LDPC Codes. 2350-2355 - Anthony Gómez-Fonseca, Roxana Smarandache, David G. M. Mitchell:
On the Tanner Cycle Distribution of QC-LDPC Codes from Polynomial Parity-Check Matrices. 2356-2361 - Hsiao-Wen Yu, Cheng-En Lee, Ruhui Zhang, Cheng-Shang Chang, Duan-Shin Lee:
Degree-degree Correlated Low-density Parity-check Codes Over a Binary Erasure Channel. 2362-2367 - Ermes Franch, Chunlei Li:
Two new algorithms for error support recovery of low rank parity check codes. 2368-2373 - Natasha Devroye, Abhijeet Mulgund, Raj Shekhar, György Turán, Milos Zefran, Yingyao Zhou:
Interpreting Training Aspects of Deep-Learned Error-Correcting Codes. 2374-2379 - Bashar Huleihel, Dor Tsur, Ziv Aharoni, Oron Sabag, Haim H. Permuter:
Neural Estimation of Multi-User Capacity Regions. 2380-2385 - Zhiwei Shan, Xinping Yi, Han Yu, Chung-Shou Liao, Shi Jin:
Learning to Code on Graphs for Topological Interference Management. 2386-2391 - Jiaxiang Tang, Jinbao Zhu, Songze Li, Lichao Sun:
Secure Embedding Aggregation for Federated Representation Learning. 2392-2397 - Zhou Li, Yizhou Zhao, Hua Sun:
Weakly Secure Summation with Colluding Users. 2398-2403 - Zhenhao Huang, Songze Li, Kai Liang, Youlong Wu:
Secure Gradient Aggregation for Wireless Multi-Server Federated Learning. 2404-2409 - Songting Ji, Zhaoyang Zhang, Zhaohui Yang, Richeng Jin, Qianqian Yang:
Coded Parallelism for Distributed Deep Learning. 2410-2415 - Christian Arendt, Janis Nötzel, Holger Boche:
Detectability of Denial-of-Service Attacks on Arbitrarily Varying Channels with State Constraints. 2416-2421 - Mayank Bakshi, Oliver Kosut:
On Authentication against a Myopic Adversary using Stochastic Codes. 2422-2427 - Mustafa Doger, Sennur Ulukus:
Security Bounds for Bitcoin Under Network Delay. 2428-2433 - Hongna Yang, Yujie Gu, Yiwei Zhang:
Bounds for Binary Multimedia Codes with the Identifiable Parent Property. 2434-2439 - Abhishek Roy, Sudhan Majhi:
Direct Constructions of Multiple Shift Complementary Sets of Flexible Lengths. 2440-2445 - Nicolas Charpenay, Maël Le Treust, Aline Roumy:
Complementary Graph Entropy, AND Product, and Disjoint Union of Graphs. 2446-2451 - Chin Wa Ken Lau, Chandra Nair:
Information Inequalities via Ideas from Additive Combinatorics. 2452-2457 - Keshav Goyal, Duc Tu Dao, Han Mao Kiah, Mladen Kovacevic:
Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics. 2458-2463 - Ioannis Papageorgiou, Ioannis Kontoyiannis:
Context-tree weighting for real-valued time series: Bayesian inference with hierarchical mixture models. 2464-2469 - Ioannis Kontoyiannis:
Time Series Analysis with Bayesian Context Trees: Classical Asymptotics and Finite-n Bounds. 2470-2475 - Qian Yu, Yury Polyanskiy:
Uniqueness of Distributional BP Fixed Point in Ising Model on Trees. 2476-2481 - Cheng Chen, Jiawei Zhang, Jie Ding, Yi Zhou:
Assisted Unsupervised Domain Adaptation. 2482-2487 - Yuheng Bu, Harsha Vardhan Tetali, Gholamali Aminian, Miguel R. D. Rodrigues, Gregory W. Wornell:
On the Generalization Error of Meta Learning for the Gibbs Algorithm. 2488-2493 - Andreas Lenz, Stephen Melczer, Cyrus Rashtchian, Paul H. Siegel:
Exact Asymptotics for Discrete Noiseless Channels. 2494-2498 - Miklós Z. Rácz, Anirudh Sridhar:
Matching Correlated Inhomogeneous Random Graphs using the k-core Estimator. 2499-2504 - Alexander Mariona, Homa Esfahanizadeh, Rafael G. L. D'Oliveira, Muriel Médard:
A Non-Asymptotic Analysis of Mismatched Guesswork. 2505-2510 - Manolis C. Tsakiris:
Matrix Recovery from Permutations: An Algebraic Geometry Approach. 2511-2516 - Jocelyn Bourduge, Charly Poulliat, Benjamin Gadat:
Non Binary LDPC Coded Orthogonal Modulation Schemes based on Non Binary Multilevel Coding. 2517-2522 - Alexander Fengler, Alejandro Lancho, Krishna Narayanan, Yury Polyanskiy:
On the Advantages of Asynchrony in the Unsourced MAC. 2523-2528 - Lev Tauz, Lara Dolecek:
Fully Private Grouped Matrix Multiplication with Colluding Workers. 2529-2534 - Maximilian Egger, Marvin Xhemrishi, Antonia Wachter-Zeh, Rawad Bitar:
Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance. 2535-2540 - Haojun Li, Yi Chen, Kenneth W. Shum, Chi Wan Sung:
Data Allocation for Approximate Gradient Coding in Edge Networks. 2541-2546 - M. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan:
Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes. 2547-2552 - Samiru Gayan, Hazer Inaltekin, Rajitha Senanayake, Jamie S. Evans:
Differential MPSK with n-Bit Phase Quantization. 2553-2558 - Ya-Chun Liang, Chung-Shou Liao, Xinping Yi:
A Primal-Dual Algorithmic Aspect of Link Scheduling in Dynamic Wireless Networks. 2559-2564 - Yen-Cheng Chu, Alireza Vahid, Sheng-Kai Chung, Shih-Chun Lin:
Broadcast Packet Erasure Channels with Alternating Single-User Feedback. 2565-2570 - Siyao Li, Giuseppe Caire:
On the Capacity and State Estimation Error of Binary "Beam-Pointing" Channels with Block Memory and Feedback. 2571-2576 - Abdelaziz Bounhar, Mireille Sarkiss, Michèle A. Wigger:
Mixing a Covert and a Non-Covert User. 2577-2582 - Soumita Hazra, Jagadeesh Harshan:
On Distribution-Preserving Mitigation Strategies for Communication under Cognitive Adversaries. 2583-2588 - Moritz Wiese, Holger Boche:
ε-Almost Collision-Flat Universal Hash Functions Motivated by Information-Theoretic Security. 2589-2594 - Yun-Mei Liao, I-Hsiang Wang:
On the Benefit of Single-User Feedback for Secret Communication over Broadcast Erasure Channels. 2595-2600 - Sean O'Rourke, Van Vu, Ke Wang:
Optimal Subspace Perturbation Bounds under Gaussian Noise. 2601-2606 - Sreejith Sreekumar, Ziv Goldfeld, Kengo Kato:
Limit Distribution Theory for KL divergence and Applications to Auditing Differential Privacy. 2607-2612 - Kristjan H. Greenewald, Brian Kingsbury, Yuancheng Yu:
High-Dimensional Smoothed Entropy Estimation via Dimensionality Reduction. 2613-2618 - Yun Ma, Yihong Wu, Pengkun Yang:
On the best approximation by finite Gaussian mixtures. 2619-2624 - Xumei Xi, Christina Lee Yu, Yudong Chen:
Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling. 2625-2630 - Praveen Venkatesh, Keerthana Gurushankar, Gabriel Schamberg:
Capturing and Interpreting Unique Information. 2631-2636 - Ruizhi Zhang, Shanshan Cao:
Differentially Private Detection of Sparse Gaussian Mixtures. 2637-2642 - Qi Zhang, Zhongchang Sun, Luis C. Herrera, Shaofeng Zou:
Data-Driven Quickest Change Detection in Hidden Markov Models. 2643-2648 - Ashwin Verma, Alireza Sharbafchi, Behrouz Touri, Soheil Mohajer:
Distributed Fact Checking. 2649-2654 - Amir Weiss, Alejandro Lancho, Yuheng Bu, Gregory W. Wornell:
A Bilateral Bound on the Mean-Square Error for Estimation in Model Mismatch. 2655-2660 - Yeow Meng Chee, Tuvi Etzion, Kees A. Schouhamer Immink, Tuan Thanh Nguyen, Van Khu Vu, Jos H. Weber, Eitan Yaakobi:
Thermal-Aware Channel Capacity. 2661-2666 - V Arvind Rameshwar, Navin Kashyap:
Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. 2667-2672 - Dor Elimelech, Tom Meyerovitch, Moshe Schwartz:
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems. 2673-2678 - Dor Elimelech, Tom Meyerovitch, Moshe Schwartz:
Bounds on the Essential Covering Radius of Constrained Systems. 2679-2684 - Dariusz R. Kowalski, Miguel A. Mosteiro:
The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference. 2685-2690 - Funing Xia, Junyuan Wang:
Complexity-Constrained Clustered Cell-Free Networking for Sum Capacity Maximization. 2691-2696 - Yijun Fan, Yanxiao Liu, Yi Chen, Shenghao Yang, Raymond W. Yeung:
Reliable Throughput of Generalized Collision Channel without Synchronization. 2697-2702 - Yuting Li, Farzad Farnoud:
Linial's Algorithm and Systematic Deletion-Correcting Codes. 2703-2707 - Daniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev:
Codes Correcting a Single Long Duplication Error. 2708-2713 - Alexander R. Block, Jeremiah Blocki:
Computationally Relaxed Locally Decodable Codes, Revisited. 2714-2719 - Yuanyuan Tang, Sarvin Motamen, Hao Lou, Kallie Whritenour, Shuche Wang, Ryan Gabrys, Farzad Farnoud:
Correcting a substring edit error of bounded length. 2720-2725 - Wentu Song, Kui Cai:
Non-binary Codes Correcting Two Deletions. 2726-2731 - Hamid Ghourchian, Tobias J. Oechtering, Mikael Skoglund:
Secure Block Joint Source-Channel Coding with Sequential Encoding. 2732-2737 - Mehrasa Ahmadipour, Michèle A. Wigger, Shlomo Shamai:
Integrated Communication and Receiver Sensing with Security Constraints on Message and State. 2738-2743 - Yiqi Chen, Tobias J. Oechtering, Mikael Skoglund, Yuan Luo:
On Strong Secrecy for Multiple Access Channel with States and causal CSI. 2744-2749 - Hao Xu, Kai-Kit Wong, Giuseppe Caire:
Achievable Region of the K-User MAC Wiretap Channel Under Strong Secrecy. 2750-2755 - Emma Pollard, Mokshay Madiman:
Submodular Function Inequalities Indexed by Chordal Graphs. 2756-2761 - Anda Skeja, Sofia C. Olhede:
Measuring the Complexity of an Exchangeable Graph. 2762-2767 - Eric Ruzomberka, Yongkyu Jang, David J. Love, H. Vincent Poor:
The Capacity of Channels with O(1)-Bit Feedback. 2768-2773 - Yuwen Huang, Pascal O. Vontobel:
Bounding the Permanent of a Non-negative Matrix via its Degree- M Bethe and Sinkhorn Permanents. 2774-2779
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 2026-02-09 21:55 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:
