default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2024: Athens, Greece
- IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024. IEEE 2024, ISBN 979-8-3503-8284-6
- Dogukan Özbayrak
, Duru Uyar, Ahmed H. Hareedy:
Low-Complexity Constrained Coding Schemes for Two-Dimensional Magnetic Recording. 1-6 - Songtao Feng, Ming Yin, Ruiquan Huang, Yu-Xiang Wang, Jing Yang, Yingbin Liang:
Towards General Function Approximation in Nonstationary Reinforcement Learning. 1-6 - Zihao Zhang, Guodong Li, Sihuang Hu:
Constructing $(h, k+1)$ Cooperative MSR Codes with Sub-Packetization (h+1)2⌈n/2⌉. 1-6 - Ziqing Lu, Guanlin Liu, Lifeng Lai, Weiyu Xu:
Camouflage Adversarial Attacks on Multiple Agent Systems. 7-12 - Divyansh Jhunjhunwala, Neharika Jali, Gauri Joshi, Shiqiang Wang:
Erasure Coded Neural Network Inference via Fisher Averaging. 13-18 - Amir Ziashahabi, Baturalp Buyukates, Artan Sheshmani, Yi-Zhuang You, Salman Avestimehr:
Frequency Domain Diffusion Model with Scale-Dependent Noise Schedule. 19-24 - Geon Choi, Namyoon Lee:
Sparsely Pre-Transformed Polar Codes for Low-Complexity SCL Decoding. 25-30 - Li Wan, Wenyi Zhang:
Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND. 31-36 - Dorsa Fathollahi, Mary Wootters:
Improved Construction of Robust Gray Codes. 37-42 - Shuche Wang, Yeow Meng Chee, Van Khu Vu:
Permutation Codes in Levenshtein, Ulam and Generalized Kendall-Tau Metrics. 43-48 - Ken-ichi Iwata, Kengo Hashimoto, Takahiro Wakayama, Hirosuke Yamamoto:
AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost. 49-54 - Hirosuke Yamamoto, Ken-ichi Iwata:
An Asymmetric Encoding - Decoding Scheme for Lossless Data Compression. 55-60 - Mordecai J. Golin, Reza Hosseini Dolatabadi, Arian Zamani:
Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes. 61-66 - Mordecai J. Golin, Reza Hosseini Dolatabadi, Arian Zamani:
A (Weakly) Polynomial Algorithm for AIVF Coding. 67-72 - Mario Berta, Lampros Gavalakis, Ioannis Kontoyiannis:
A Third Information-Theoretic Approach to Finite de Finetti Theorems. 73-78 - Richard Combes:
An Extension of Mcdiarmid's Inequality. 79-84 - Aristomenis Tsopelakos, Olgica Milenkovic:
A Multi-Sequence Prophet Inequality Under Observation Constraints. 85-90 - Wei-Ning Chen, Ayfer Özgür:
Lq Lower Bounds on Distributed Estimation via Fisher Information. 91-96 - Frederik Walter, Omer Sabary, Antonia Wachter-Zeh, Eitan Yaakobi:
Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions. 97-102 - Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh, Eitan Yaakobi:
Correcting a Single Deletion in Reads from a Nanopore Sequencer. 103-108 - Omer Sabary, Inbal Preuss, Ryan Gabrys, Zohar Yakhini, Leon Anavy, Eitan Yaakobi:
Error-Correcting Codes for Combinatorial Composite DNA. 109-114 - Omer Yerushalmi, Tuvi Etzion, Eitan Yaakobi:
The Capacity of the Weighted Read Channel. 115-120 - Denis S. Krotov:
On the Existence of Some Completely Regular Codes in Hamming Graphs. 121-126 - Cristina Fernández-Córdoba, Adrián Torres-Martín, Carlos Vela, Mercè Villanueva:
Parity-Check Matrix for Zps-additive Codes: Efficient Computation. 127-132 - Elazar Goldenberg, Mursalin Habib, Karthik C. S.:
Explicit Good Codes Approaching Distance 1 in Ulam Metric. 133-138 - Miao Liu, Chong Shangguan:
Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound. 139-144 - Michael Langberg, Oron Sabag:
Competitive Analysis of Arbitrary Varying Channels. 145-150 - Amos Lapidoth, Yossef Steinberg:
The State-Dependent Channel with a Rate-Limited Cribbing Helper. 151-154 - Yutong Han, Albert Guillén i Fàbregas:
Fixed-Memory Capacity Bounds for the Gilbert-Elliott Channel. 155-159 - Ron Dabora, Shlomo Shamai, H. Vincent Poor:
An Achievable Scheme for Channels with an Amplitude Constraint Using Walsh Functions. 160-165 - Mohammad Milanian, Minoh Jeong, Martina Cardone:
On the Secrecy Capacity of 1-2-1 Atomic Networks. 166-171 - Abdelaziz Bounhar, Mireille Sarkiss, Michèle A. Wigger:
Covert Distributed Detection over Discrete Memoryless Channels. 172-177 - Cailyn Bass, Alejandro Cohen, Rafael G. L. D'Oliveira, Muriel Médard:
A Monotone Circuit Construction for Individually-Secure Multi-Secret Sharing. 178-183 - Utkarsh Gupta, Hessam Mahdavifar:
Bounds on the Statistical Leakage-Resilience of Shamir's Secret Sharing. 184-189 - Austin Goddard, Kang Du, Yu Xiang:
Mining Invariance from Nonlinear Multi-Environment Data: Binary Classification. 190-195 - Kanumuri Nithin Varma, Babak Hassibi:
Benefits of Stochastic Mirror Descent in High-Dimensional Binary Classification. 196-201 - Danil Akhtiamov, Reza Ghane, Babak Hassibi:
Regularized Linear Regression for Binary Classification. 202-207 - Abhin Shah, Maohao Shen, Jongha Jon Ryu, Subhro Das, Prasanna Sattigeri, Yuheng Bu, Gregory W. Wornell:
Group Fairness with Uncertain Sensitive Attributes. 208-213 - Faisal Hamman, Sanghamitra Dutta:
A Unified View of Group Fairness Tradeoffs Using Partial Information Decomposition. 214-219 - Meiyu Zhong, Ravi Tandon:
Intrinsic Fairness-Accuracy Tradeoffs Under Equalized Odds. 220-225 - Masoumeh Alinia, David G. M. Mitchell:
Minimizing Distortion in Data Embedding Using LDGM Codes and the Cavity Method. 226-231 - Liam Cregg, Tamás Linder, Serdar Yüksel:
Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources. 232-237 - Dror Freirich, Nir Weinberger, Ron Meir:
Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics. 238-243 - Matteo Zecchin, Sangwoo Park, Osvaldo Simeone, Fredrik Hellström:
Generalization and Informativeness of Conformal Prediction. 244-249 - Kfir M. Cohen, Sangwoo Park, Osvaldo Simeone, Shlomo Shamai Shitz:
Cross-Validation Conformal Risk Control. 250-255 - Yoshinari Takeishi, Jun'ichi Takeuchi:
Risk Bound on MDL Estimator for Simple ReLU Networks. 256-261 - Amanda Merkley, Pulkit Grover, Alice Y. Nam, Y. Kate Hong:
Message- Relevant Dimension Reduction of Neural Populations. 262-267 - Thach V. Bui:
A Simple Self-Decoding Model for Neural Coding. 268-273 - Andreas Theocharous, Georgia G. Gregoriou, Panagiotis Sapountzis, Ioannis Kontoyiannis:
Causality Testing, Directed Information and Spike Trains. 274-279 - Shreyas Jain, V Arvind Rameshwar, Navin Kashyap:
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. 280-285 - José Joaquín Bernal:
Generalized Reed-Muller Codes: A New Construction of Information Sets. 286-290 - Aditya Siddheshwar, Lakshmi Prasad Natarajan, Prasad Krishnan:
Recursive Subproduct Codes with Reed-Muller-like Structure. 291-296 - Pau Colomer, Christian Deppe, Holger Boche, Andreas J. Winter:
Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear Rates. 297-302 - Ilya Vorobyev, Christian Deppe, Luis Torres-Figueroa, Holger Boche:
Deterministic Identification: From Theoretical Analysis to Practical Identification Codes. 303-308 - Zhicheng Liu, Yuan Li, Huazi Zhang, Jun Wang, Guiying Yan, Zhiming Ma:
Second-Order Identification Capacity of AWGN Channels. 309-314 - Junda Zhou, Cheuk Ting Li:
Variable-Length Secret Key Agreement via Random Stopping Time. 315-320 - Jing Yang, Shu-Tao Xia, Xianfang Wang, Jiangtao Yuan, Fang-Wei Fu:
A Perfect Ideal Hierarchical Secret Sharing Scheme Based on the CRT for Polynomial Rings. 321-326 - Prashanth K. H. Sheshagiri, Juan A. Cabrera, Frank H. P. Fitzek:
Repurposing Physical Layer Secret Keys: A Novel Paradigm for Common Randomness Generation. 327-332 - Sreejith Sreekumar, Mario Berta:
Limit Distribution for Quantum Relative Entropy. 333-338 - Shuchan Wang, Gerhard Wunder:
A Causal Model for Quantifying Multipartite Classical and Quantum Correlations. 339-344 - Chenghong Zhu, Chengkai Zhu, Zhiping Liu, Xin Wang:
Entanglement cost of discriminating quantum states under locality constraints. 345-350 - Tobias Rippchen, Sreejith Sreekumar, Mario Berta:
Locally-Measured Rényi Divergences. 351-356 - Shuhei Kashiwamura, Ayaka Sakata, Masaaki Imaizumi:
Effect of Weight Quantization on Learning Models by Typical Case Analysis. 357-362 - Leon Lufkin, Yihong Wu, Jiaming Xu:
Sharp Information-Theoretic Thresholds for Shuffled Linear Regression. 363-367 - Minoh Jeong, Martina Cardone, Alex Dytso:
Data-Driven Estimation of the False Positive Rate of the Bayes Binary Classifier via Soft Labels. 368-373 - Michael Kohler, Benjamin Walter, Adam Krzyzak:
Rate of Convergence of an Over-Parametrized Convolutional Neural Network Image Classifier Learned by Gradient Descent. 374-379 - Shahab Asoodeh, Mario Díaz:
On the Privacy Guarantees of Differentially Private Stochastic Gradient Descent. 380-385 - Shahrzad Kiani, Franziska Boenisch, Stark C. Draper:
Controlled privacy leakage propagation throughout differential private overlapping grouped learning. 386-391 - Aman Bansal, Rahul Chunduru, Deepesh Data, Manoj Prabhakaran:
Utilitarian Privacy and Private Sampling. 392-397 - Kuan-Yu Lin, Hsuan-Yin Lin, Yu-Pin Hsu, Yu-Chih Huang:
Age Aware Scheduling for Differentially-Private Federated Learning. 398-403 - Zikun Tan, Ron Dabora, H. Vincent Poor:
On the Rate-Distortion Function for Sampled Cyclostationary Gaussian Processes with Memory. 404-409 - Lingyi Chen, Shitong Wu, Wenyi Zhang, Huihui Wu, Hao Wu:
On Convergence of Discrete Schemes for Computing the Rate-Distortion Function of Continuous Source. 410-415 - Praneeth Kumar Vippathalla, Martin Wachiye Wafula, Mihai-Alin Badiu, Justin P. Coon:
On the Lossy Compression of Spatial Networks. 416-421 - Heasung Kim, Hyeji Kim, Gustavo de Veciana:
Estimation of Rate- Distortion Function for Computing with Decoder Side Information. 422-427 - Massimo Battaglioni, Matteo Amagliani, Marco Baldi, Franco Chiaraluce, Giovanni Cancellieri:
Design and Analysis of a Family of Complexity-Constrained LDPC Codes. 428-433 - Roxana Smarandache, Anthony Gómez-Fonseca, David G. M. Mitchell:
Generalized Quasi-Cyclic LDPC Codes: Design and Efficient Encoding. 434-439 - Yuanbo Mi, Zhao Chen, Liuguo Yin, Xi Chen:
Progressive Reconstruction of Large QC-LDPC Codes over a Noisy Channel. 440-445 - Fabián Molina, Paolo Santini, Marco Baldi:
Group Codes with Low-Density Orthogonal Idempotent. 446-451 - Christoph Hofmeister, Anina Gruica, Dganit Hanania, Rawad Bitar, Eitan Yaakobi:
Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs. 452-457 - Yeow Meng Chee, Kees A. Schouhamer Immink, Van Khu Vu:
Coding Scheme for Noisy Nanopore Sequencing with Backtracking and Skipping Errors. 458-463 - Hadas Abraham, Ryan Gabrys, Eitan Yaakobi:
Covering All Bases: The Next Inning in DNA Sequencing Efficiency. 464-469 - Yuting Li, Yuanyuan Tang, Hao Lou, Ryan Gabrys, Farzad Farnoud:
Asymptotically Optimal Codes Correcting One Substring Edit. 470-475 - Chao Chen, Baoming Bai, Xiao Ma, Yunghsiang S. Han, Nianqi Tang, Xiaotian Wang:
Efficient Decoding of a Class of Reed-Solomon Codes Over Fermat Fields. 476-481 - Wenhao Liu, Zhengyi Jiang, Zhongyi Huang, Linqi Song, Hanxu Hou:
Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity. 482-487 - Weijun Fang, Jingke Xu:
Deep Holes of Twisted Reed-Solomon Codes. 488-493 - Shu Liu, Yunqi Wan, Chaoping Xing:
Repairing Reed-Solomon Codes with Less Bandwidth. 494-498 - Elad Domanovitz, Anatoly Khina, Tal Philosof, Yuval Kochman:
Information Velocity of Cascaded AWGN Channels with Feedback. 499-504 - Amos Lapidoth, Ligong Wang, Yiming Yan:
Message-Cognizant Assistance and Feedback for the Gaussian Channel. 505-509 - Adeel Mahmood, Aaron B. Wagner:
Channel Coding with Mean and Variance Cost Constraints. 510-515 - Hengjie Yang, Richard D. Wesel:
Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop Feedback. 516-521 - Prafulla Chandra, Andrew Thangaraj:
Missing Mass Under Random Duplications. 522-526 - Farhang Yeganegi, Arian Eamaz, Mojtaba Soltanalian:
Low-rank Matrix Sensing With Dithered One-Bit Quantization. 527-532 - Shuheng Zhou, Kristjan H. Greenewald:
Sharper Rates of Convergence for the Tensor Graphical Lasso Estimator. 533-538 - Prathapasinghe Dharmawansa, Saman Atapattu, Jamie S. Evans, Kandeepan Sithamparanathan:
Detection of Signals in Colored Noise: Leading Eigenvalue Test for Non-central F-matrices. 539-544 - Kenneth Goodenough, Aqil Sajjad, Eneet Kaur, Saikat Guha, Don Towsley:
Bipartite Entanglement of Noisy Stabilizer States Through the Lens of Stabilizer Codes. 545-550 - Ali Cox, Quntao Zhuang, Jeffrey H. Shapiro, Saikat Guha:
Quantum Illumination Advantage for Classification Among an Arbitrary Library of Targets. 551-556 - Christoph Hirche:
Quantum Doeblin Coefficients: A Simple Upper Bound on Contraction Coefficients. 557-562 - Abram Magner, Arun Padakandla:
Empirical Risk Minimization and Uniform Convergence for Probabilistically Observed and Quantum Measurement Hypothesis Classes. 563-568 - En-Hui Yang, Shayan Mohajer Hamidi, Linfeng Ye, Renhao Tan, Beverly Yang:
Conditional Mutual Information Constrained Deep Learning: Framework and Preliminary Results. 569-574 - Tina Behnia, Christos Thrampoulidis:
Supervised Contrastive Representation Learning: Landscape Analysis with Unconstrained Features. 575-580 - Monica Welfert, Nathan Stromberg, Lalitha Sankar:
Theoretical Guarantees of Data Augmented Last Layer Retraining Methods. 581-586 - Hiroo Irobe, Wataru Aoki, Kimihiro Yamazaki, Yuhui Zhang, Takumi Nakagawa, Hiroki Waida, Yuichiro Wada, Takafumi Kanamori:
Robust VAEs via Generating Process of Noise Augmented Data. 587-592 - Seung-Hyun Nam, Vincent Y. F. Tan, Si-Hyeon Lee:
Optimal Private Discrete Distribution Estimation with One-Bit Communication. 593-598 - Nikolija Bojkovic, Po-Ling Loh:
Differentially Private Synthetic Data with Private Density Estimation. 599-604 - Daria Reshetova, Wei-Ning Chen, Ayfer Özgür:
Training Generative Models from Privatized Data via Entropic Optimal Transport. 605-610 - Hrad Ghoukasian, Shahab Asoodeh:
Differentially Private Fair Binary Classifications. 611-616 - Mohammad Ali Maddah-Ali, Soheil Mohajer:
Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme. 617-622 - Nir Elkayam, Meir Feder:
One Shot Joint Source Channel Coding. 623-628 - Ashish Khisti, Arash Behboodi, Gabriele Cesa, Kumar Pratik:
Unequal Message Protection: One-Shot analysis via Poisson Matching Lemma. 629-634 - Anatoly Khina, Neri Merhav:
Power-limited Modulation-Estimation with a Helper. 635-640 - Irina E. Bocharova, Boris D. Kudryashov, Sander Mikelsaar:
Analysis of Coded Shaped QAM Signaling at Short and Moderate Lengths. 641-646 - Guohua Zhang, Aijing Sun, Ling Liu, Yi Fang:
Short Regular Girth-8 QC-LDPC Codes from Exponent Matrices with Vertical Symmetry. 647-652 - Canberk Irimagzi, Ata Tanrikulu, Ahmed H. Hareedy:
Probabilistic Design of Multi-Dimensional Spatially-Coupled Codes. 653-658 - Jens Zumbrägel:
Pseudoredundancy for the Bit-Flipping Algorithm. 659-662 - Serge Kas Hanna:
Short Systematic Codes for Correcting Random Edit Errors in DNA Storage. 663-668 - Tuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink:
Efficient DNA Synthesis Codes with Error Correction and Runlength Limited Constraint. 669-674 - Anina Gruica, Daniella Bar-Lev, Alberto Ravagnani, Eitan Yaakobi:
A Combinatorial Perspective on Random Access Efficiency for DNA Storage. 675-680 - Yuval Gerzon, Ilan Shomorony, Nir Weinberger:
Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations. 681-686 - Avital Boruchovsky, Tuvi Etzion, Eitan Yaakobi:
Pair-Covering Codes. 687-692 - Dipak Kumar Bhunia, Cristina Fernández-Córdoba, Mercè Villanueva:
On the Classification of $\mathbb{Z}_{2}\mathbb{Z}_{4}\mathbb{Z}_{8}$-Linear Hadamard Codes. 693-698 - Jonathan Mandelbaum, Sisi Miao, Holger Jäkel, Laurent Schmalen:
Endomorphisms of Linear Block Codes. 699-704 - Shu Liu, Chaoping Xing:
Nonlinear Codes with Low Redundancy. 705-710 - Luca Barletta, Ian Zieder, Antonino Favano, Alex Dytso:
Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity. 711-716 - V Arvind Rameshwar, Nir Weinberger:
Information Rates Over DMCs with Many Independent Views. 717-722 - Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger:
Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels. 723-728 - Akira Kamatsuka, Yuki Ishikawa, Koki Kazama, Takahiro Yoshida:
New Algorithms for Computing Sibson Capacity and Arimoto Capacity. 729-734 - Xiao-Wen Chang, Yingzi Xu:
On the Success Probability of the $L_{0}$-regularized Box-constrained Babai Point. 735-740 - Riccardo Rossetti, Bobak Nazer, Galen Reeves:
Linear Operator Approximate Message Passing: Power Method with Partial and Stochastic Updates. 741-746 - Burak Çakmak, Yue M. Lu, Manfred Opper:
A Convergence Analysis of Approximate Message Passing with Non-Separable Functions and Applications to Multi-Class Classification. 747-752 - Cheng Cheng, Ziping Zhao:
Efficient Nonconvex Optimization for Two-way Sparse Reduced-Rank Regression. 753-758 - Francisco Daunas, Iñaki Esnaola, Samir M. Perlaza, H. Vincent Poor:
Equivalence of Empirical Risk Minimization to Regularization on the Family of $f- \text{Divergences}$. 759-764 - Adi Hendel, Meir Feder:
Error Exponent in Agnostic PAC Learning. 765-770 - Shlomi Vituri, Meir Feder:
Universal Batch Learning Under The Misspecification Setting. 771-776 - Milad Sefidgaran, Abdellatif Zaidi, Piotr Krasnowski:
Minimal Communication-Cost Statistical Learning. 777-782 - Alberto Montina, Stefan Wolf:
Violation of Leggett-Garg inequalities implies information erasure. 783-788 - Petros Georgiou, Sharu Theresa Jose, Osvaldo Simeone:
Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis. 789-794 - Leo Bia, Christos N. Gagatsos, Saikat Guha:
Receiver Algorithms to Approach the Quantum Limit of Demodulating Pulse Position Modulation. 795-800 - Zihao Gong, Boulat A. Bash:
On Two-Stage Quantum Estimation and Asymptotics of Quantum-Enhanced Transmittance Sensing. 801-806 - Guodong Li, Ningning Wang, Sihuang Hu, Min Ye:
MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes. 807-812 - Adway Patra, Alexander Barg:
More Results for Regenerating Codes on Graphs. 813-818 - Altan Berdan Kilic, Alberto Ravagnani, Emina Soljanin:
On the Parameters of Codes for Data Access. 819-824 - Valentinian Lungu, Ioannis Kontoyiannis:
The Optimal Finite-Sample Error Probability in Asymmetric Binary Hypothesis Testing. 831-836 - Yiming Xing, Georgios Fellouris:
Asymptotically optimal multistage tests for multihypothesis testing. 837-842 - Jie Wang, Rui Gao, Yao Xie:
Non-Convex Robust Hypothesis Testing Using Sinkhorn Uncertainty Sets. 843-848 - Akshayaa Magesh, Zhongchang Sun, Venugopal V. Veeravalli, Shaofeng Zou:
Robust Multi-Hypothesis Testing with Moment-Constrained Uncertainty Sets. 849-854 - Yang Qiu, Aaron B. Wagner:
Low-Rate, Low-Distortion Compression with Wasserstein Distortion. 855-860 - Vikrant Malik, Taylan Kargin, Victoria Kostina, Babak Hassibi:
A Distributionally Robust Approach to Shannon Limits using the Wasserstein Distance. 861-866 - Maël Le Treust, Tristan Tomala:
A Converse Bound on the Mismatched Distortion-Rate Function. 867-872 - Alex Dytso, Martina Cardone:
Uniform Distribution on ($n - 1$)-Sphere: Rate-Distortion Under Squared Error Distortion. 873-878 - Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu:
On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. 879-884 - Thomas Jacob Maranzatto:
Tree Trace Reconstruction - Reductions to String Trace Reconstruction. 885-890 - Di Zhang, Gennian Ge, Yiwei Zhang:
Sequence Reconstruction over 3-Deletion Channels. 891-896 - Yaoyu Yang, Zitan Chen:
Reconstruction of multiple strings of constant weight from prefix-suffix compositions. 897-902 - Naoaki Kokubun, Yuki Kondo, Hironori Uchikawa:
A Relay Algorithm of BCH Codes for a Quick Start of the Berlekamp-Massey Algorithm. 903-908 - Zhengyi Jiang, Hao Shi, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
An Earlier Termination Algorithm to Find Error Locator Polynomial in Error Correction of RS Codes. 909-914 - Jingjie Lv, Weijun Fang, Shu-Tao Xia, Hanxu Hou:
An Explicit Construction of $q\text{-ary}$ MDS Array Codes and Their Efficient Decoding. 915-920 - Fanyun Chen, Bin Zhang, Qin Huang:
Coset Error Patterns in Recursive Projection-Aggregation Decoding. 921-926 - Rémi A. Chou, Jörg Kliewer, Aylin Yener:
Private Sum Computation: Trade-Off Between Shared Randomness and Privacy. 927-932 - Zirui Deng, Vinayak Ramkumar, Netanel Raviv:
Perfect Subset Privacy in Polynomial Computation. 933-938 - Jinbao Zhu, Lanping Li, Xiaohu Tang, Ping Deng:
Private Multiple Linear Computation: A Flexible Communication-Computation Tradeoff. 939-944 - Ali Gholami, Kai Wan, Tayyebeh Jahani-Nezhad, Hua Sun, Mingyue Ji, Giuseppe Caire:
On Multi-Message Private Computation. 945-950 - Ashirwad Sinha, Shubhransh Singhvi, Praful D. Mankar, Harpreet S. Dhillon:
Peak Age of Information under Tandem of Queues. 951-956 - Won Jun Lee, Chih-Chun Wang:
AoI -optimal Scheduling for Arbitrary K -channel Update- Through-Queue Systems. 957-962 - Fangming Zhao, Nikolaos Pappas, Chuan Ma, Xinghua Sun, Tony Q. S. Quek, Howard H. Yang:
Optimizing Information Freshness in Mobile Networks with Age-Threshold ALOHA. 963-968 - Yinian Zheng, Fang Liu, Yuan-Hsun Lo, Tsai-Lien Wong, Kangkang Xu, Yijin Zhang:
Protocol Sequences for Age of Information Under Multiple-Packet Reception. 969-974 - Gil I. Shamir, Wojciech Szpankowski:
Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning. 975-980 - Ruida Zhou, Suhas N. Diggavi:
Personalized Heterogeneous Gaussian Mean Estimation Under Communication Constraints. 981-986 - Leighton Pate Barnes, Alex Dytso, Jingbo Liu, H. Vincent Poor:
Multivariate Priors and the Linearity of Optimal Bayesian Estimators under Gaussian Noise. 987-992 - Ananya Das, Aishwarya Soni, Amitalok J. Budkuley:
Bayesian Persuasion: From Persuasion toward Counter-Suasion. 993-998 - Ian George, Eric Chitambar:
Min-Entropic Quantities Induced by Cones: Properties & Operational Interpretations. 1005-1010 - Paula Belzig:
Fully Quantum Arbitrarily Varying Channel Coding for Entanglement-Assisted Communication. 1011-1016 - Meir Lederman, Uzi Pereg:
Secure Communication with Unreliable Entanglement Assistance. 1017-1022 - Adir Kobovich, Orian Leitersdorf, Daniella Bar-Lev, Eitan Yaakobi:
Universal Framework for Parametric Constrained Coding. 1023-1028 - Wilton Kim, Joel Nathanael Raj, Stanislav Kruglik, Han Mao Kiah:
Decoding Sparse Reed-Solomon Codes with Known Support. 1029-1034 - Yeow Meng Chee, Tuvi Etzion, Kees A. Schouhamer Immink, Tuan Thanh Nguyen, Van Khu Vu, Jos H. Weber, Eitan Yaakobi:
Thermal-Aware Channel with Multiple Wires. 1035-1040 - Zhengyi Jiang, Bin Yu, Zhongyi Huang, Linqi Song, Bo Bai, Gong Zhang, Hanxu Hou:
Tight Lower Bound on Cross-Rack Update Bandwidth and Explicit Constructions. 1041-1046 - Yu-Han Huang, Venugopal V. Veeravalli:
High Probability Latency Quickest Change Detection over a Finite Horizon. 1047-1052 - Wen-Hsuan Li, Yu-Chih Huang:
Syndrome-Based Fusion Rules in Heterogeneous Distributed Quickest Change Detection. 1053-1058 - Qunzhi Xu, Yi Yu, Yajun Mei:
Quickest Detection in High-Dimensional Linear Regression Models via Implicit Regularization. 1059-1064 - Xinyuan Zhang, Yajun Mei:
Monitoring High-Dimensional Streaming Data via Fusing Nonparametric Shiryaev-Roberts Statistics. 1065-1070 - Sadaf Salehkalaibar, Jun Chen, Ashish Khisti, Wei Yu:
Rate-Distortion-Perception Tradeoff for Lossy Compression Using Conditional Perception Measure. 1071-1076 - Giuseppe Serra, Photios A. Stavrou, Marios Kountouris:
Computation of the Multivariate Gaussian Rate-Distortion-Perception Function. 1077-1082 - Yassine Hamdi, Aaron B. Wagner, Deniz Gündüz:
The Rate-Distortion-Perception Trade-off: the Role of Private Randomness. 1083-1088 - Giuseppe Serra, Photios A. Stavrou, Marios Kountouris:
Copula-Based Estimation of Continuous Sources for a Class of Constrained Rate-Distortion Functions. 1089-1094 - Yuhang Pi, Zhifang Zhang, Yaqian Zhang:
Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion/Deletion Correcting Code. 1095-1100 - Wentu Song, Kui Cai, Tony Q. S. Quek:
New Construction of q-ary Codes Correcting a Burst of at Most t Deletions. 1101-1106 - Shiqin Liu, Chen Wang, Gennian Ge, Yiwei Zhang:
Improving the Singleton-Type Upper Bounds for Non-Linear Deletion Correcting Codes. 1107-1112 - Luca G. Tallini, Hoang Vu, Bella Bose:
On Fixed Length Systematic All Limited Magnitude Zero Deletion/Insertion Error Control Codes. 1113-1118 - Yijin Zhang, Tsai-Lien Wong, Kangkang Xu, Yuan-Hsun Lo:
Mixed-Weight Conflict-Avoiding Codes. 1119-1124 - Itamar Jacoby, Ram Zamir:
Frame Codes for the Block-Erasure Channel. 1125-1130 - Cheng Du, Yi Jiang:
Construction of 4-phase Golay Complementary Sequence Sets with Small Number of Constituent Sequences and Arbitrary Length. 1131-1136 - Zhen-Ming Huang, Cheng-Yu Pai, Zilong Liu, Chao-Yu Chen:
A New Construction of Enhanced Cross Z-Complementary Sets with Maximum Zero Correlation Zone. 1137-1142 - Ava Asmani, Semira Galijasevic, Richard D. Wesel:
Write Voltage Optimization to Increase Flash Lifetime in a Two-Variance Gaussian Channel. 1143-1148 - Hironori Uchikawa, Noboru Shibata, Taira Shibuya:
Fast Readable Multi-Cell Coding for Flash Memory. 1149-1154 - Vishakha Ramani, Ivan Seskar, Roy D. Yates:
Efficient and Timely Memory Access. 1155-1160 - Ron M. Roth, Giacomo Pedretti:
On-Access Error Correction in Certain Types of Content-Addressable Memories. 1161-1166 - Han Xu, Yinfei Xu, Tiecheng Song:
Timely Gossip with Age-Dependent Networks. 1167-1172 - Thomas Jacob Maranzatto:
Age of Gossip in Random and Bipartite Networks. 1173-1178 - Cagri Ari, Md Kamran Chowdhury Shisher, Elif Uysal, Yin Sun:
Goal-Oriented Communications for Remote Inference Under Two-Way Delay with Memory. 1179-1184 - Jiakun Liu, Wenyi Zhang, H. Vincent Poor:
PAC Learnability for Reliable Communication Over Discrete Memoryless Channels. 1185-1190 - Bashar Huleihel, Dor Tsur, Ziv Aharoni, Oron Sabag, Haim H. Permuter:
Neural Estimation of Multi-User Capacity Regions Over Discrete Channels. 1191-1196 - Daniel Plabst, Tobias Prinz, Francesca Diedolo, Thomas Wiegart, Georg Böcherer, Norbert Hanik, Gerhard Kramer:
Neural Network Equalizers and Successive Interference Cancellation for Bandlimited Channels with a Nonlinearity. 1197-1202 - Jannis Clausius, Marvin Geiselhart, Daniel Tandler, Stephan ten Brink:
Graph Neural Network-Based Joint Equalization and Decoding. 1203-1208 - Mario Berta, Omar Fawzi, Aadil Oufkir:
Optimality of Meta-Converse for Channel Simulation. 1209-1214 - Ian George, Hao-Chung Cheng:
Coherent Distributed Source Simulation as Multipartite Quantum State Splitting. 1221-1226 - Janis Nötzel:
Data Transmission over a Bosonic Channel under Classical Noise. 1227-1232 - Panyu Zhu, Jingjie Lv, Yunghsiang S. Han, Linqi Song, Hanxu Hou:
New EVENODD+ Codes with More Flexible Parameters and Lower Complexity. 1233-1238 - Guanghui Song, Qi Cao, L. Ying, H. Xuan, Kui Cai:
Upper Bound on Coding Rate over Resistive Random-Access Memory Channel under Arbitrary Input Distribution. 1239-1244 - Prachi Mishra, Navin Kashyap:
Error-Resilient Weakly Constrained Coding via Row-by-Row Coding. 1251-1256 - Dor Elimelech, Wasim Huleihel:
Detection of Correlated Random Vectors. 1257-1262 - Mor Oren-Loberman, Vered Paslev, Wasim Huleihel:
Testing Dependency of Weighted Random Graphs. 1263-1268 - Joni Shaska, Urbashi Mitra:
Neyman-Pearson Causal Inference. 1269-1274 - Lin Zhou, Qianyun Wang, Jingjing Wang, Lin Bai, Alfred O. Hero III:
Large Deviations for Statistical Sequence Matching. 1275-1280 - Priyanka Patel, Francesc Molina, Albert Guillén i Fàbregas:
Error Exponents of Discrete Memoryless Channels Under Small Mismatch. 1281-1284 - Sergey Tridenski, Anelia Somekh-Baruch:
The Method of Types for the AWGN Channel: Error Exponent. 1285-1290 - Hamdi Joudeh:
On Guessing Random Additive Noise Decoding. 1291-1296 - Han Wu, Hamdi Joudeh:
An Achievable Error Exponent for the Information Bottleneck Channel. 1297-1302 - Michael Langberg, Michelle Effros:
Characterizing positive-rate secure multicast network coding with eavesdropping nodes. 1303-1308 - Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture for Networks with Collapsed Backbone. 1309-1314 - Hoover H. F. Yin, Jie Wang, Sherman S. M. Chow:
Distributionally Robust Degree Optimization for BATS Codes. 1315-1320 - Licheng Mao, Shenghao Yang:
Efficient Binary Batched Network Coding Employing Partial Recovery. 1321-1326 - Francisco-Javier Soto, Ana-Isabel Gómez, Domingo Gómez-Pérez:
A New Family of Binary Sequences Based on the Generalized ERC Construction. 1327-1331 - Kai Tan, Chengqing Li:
Network Analysis of Baker's Map Implemented in a Fixed-Point Arithmetic Domain. 1332-1337 - Gangsan Kim, Hong-Yeop Song:
The Unique Form of the Uncorrelated Optimal ZCZ Sequence Families. 1338-1342 - Yeow Meng Chee, Tuvi Etzion, Hoang Ta, Van Khu Vu:
On de Bruijn Covering Sequences and Arrays. 1343-1348 - Ali Khalesi, Petros Elia:
Perfect Multi-User Distributed Computing. 1349-1354 - Shanuja Sasi, Onur Günlü, B. Sundar Rajan:
Multi-access Distributed Computing Models using Map-Reduce Arrays. 1355-1360 - Wenbo Huang, Xudong You, Kai Wan, Robert Caiming Qiu, Mingyue Ji:
Decentralized Uncoded Storage Elastic Computing with Heterogeneous Computation Speeds. 1361-1366 - Yuxin Jiang, Wenqin Zhang, Yuan Luo, Lele Wang:
Sparse Gaussian Gradient Code. 1367-1372 - Saad Kriouile, Mohamad Assaad, Deniz Gündüz, Touraj Soleymani:
Optimal Denial-of-Service Attacks Against Status Updating. 1373-1378 - Subhankar Banerjee, Sennur Ulukus:
When to Preempt in a Status Update System? 1379-1384 - Eric Graves, Jake B. Perazzone, Kevin S. Chan:
Optimal Update Policy for the Monitoring of Distributed Sources. 1385-1390 - Ismail Cosandal, Nail Akar, Sennur Ulukus:
AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate Constraints. 1391-1396 - Qinshan Zhang, Bin Chen, Tianqu Zhuang, Yong Jiang, Shu-Tao Xia:
Section-Wise Revolving NBP-Like Decoders for QC-LDPC Codes. 1397-1402 - Yingyao Zhou, Natasha Devroye, György Turán, Milos Zefran:
Interpreting Deepcode, a Learned Feedback Code. 1403-1408 - Sravan Kumar Ankireddy, S. Ashwin Hebbar, Heping Wan, Joonyoung Cho, Charlie Zhang:
Nested Construction of Polar Codes via Transformers. 1409-1414 - Shubham Srivastava, Adrish Banerjee:
Dense KO Codes: Faster Convergence and Reduced Complexity Through Dense Connectivity. 1415-1420 - Michael X. Cao, Rahul Jain, Marco Tomamichel:
Quantum Channel Simulation in Fidelity is No More Difficult than State Splitting. 1421-1425 - Xingyi He, Touheed Anwar Atif, S. Sandeep Pradhan:
Quantum Soft Covering and Decoupling with Relative Entropy Criterion. 1426-1431 - Vikesh Siddhu, Dina Abdelhadi, Tomas Jochym-O'Connor, John A. Smolin:
Entanglement Sharing Across a Damping-Dephasing Channel. 1432-1437 - Arun Padakandla, Naqueeb Warsi:
Simulation of Separable Quantum Measurements on Bipartite States via Likelihood POVMs. 1438-1443 - Lei Li, Xinchun Yu, Chenhao Ying, Liang Chen, Yuanyuan Dong, Yuan Luo:
Constructions of Binary MDS Array Codes with Optimal Cooperative Repair Bandwidth. 1444-1449 - Tim Janz, Hedongliang Liu, Rawad Bitar, Frank R. Kschischang:
Secure Storage Using Maximally Recoverable Locally Repairable Codes. 1450-1455 - Saransh Chopra, Francisco Maturana, K. V. Rashmi:
On Low Field Size Constructions of Access-Optimal Convertible Codes. 1456-1461 - Srivathsa Acharya, P. Vijay Kumar, Viveck R. Cadambe:
On Existence of Latency Optimal Uncoded Storage Schemes in Geo-Distributed Data Storage Systems. 1462-1467 - Chia-Yu Hsu, I-Hsiang Wang:
On the Optimal Tradeoffs among Error Exponents in Active Sequential Multiple Hypothesis Testing. 1468-1473 - Eeshan Modak, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Sequential Adversarial Hypothesis Testing. 1474-1479 - Ching-Fang Li, I-Hsiang Wang:
A Unified Study on Sequentiality in Universal Classification with Empirically Observed Statistics. 1480-1485 - Anamitra Chaudhuri, Georgios Fellouris:
Joint Sequential Detection and Isolation of Anomalies Under Composite Hypotheses. 1486-1491 - Jonathan Solel, Anelia Somekh-Baruch:
Pre-Decoder Processing Functions for a DMC with Mismatched Decoding. 1492-1497 - Henrique K. Miyamoto, Sheng Yang:
On Universal Decoding over Memoryless Channels with the Krichevsky-Trofimov Estimator. 1498-1503 - Lingyi Chen, Shitong Wu, Xinwei Li, Huihui Wu, Hao Wu, Wenyi Zhang:
A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding. 1504-1509 - Francesc Molina, Priyanka Patel, Albert Guillén i Fàbregas:
Nearest Neighbor Decoding for a Class of Compound Channels. 1510-1513 - Yang Bai, Xuan Guang, Raymond W. Yeung:
Secure Network Function Computation: Function-Security. 1514-1519 - Mohsen Heidari, Wojciech Szpankowski:
New Bounds on Quantum Sample Complexity of Measurement Classes. 1515-1520 - Sina Eghbal, Badri N. Vellambi, Lawrence Ong, Parastoo Sadeghi:
Group Complete $-\{s\}$ Pliable Index Coding. 1520-1525 - Rina Su, Qifu Tyler Sun, Mingshuo Deng, Zhongshan Zhang, Jinhong Yuan:
GRAND-Assisted Random Linear Network Coding in Wireless Broadcasts. 1526-1531 - Ruze Zhang, Xuan Guang, Shenghao Yang, Xueyan Niu, Bo Bai:
Computing Capacity of Binary Arithmetic Sum over Asymmetric Diamond Network. 1532-1537 - Ferdinando Zullo, Olga Polverino, Paolo Santonastaso, John Sheekey:
Two-Weight Rank-Metric Codes. 1538-1543 - Huimin Lao, Yeow Meng Chee, Hao Chen, Van Khu Vu:
New Constructions for Linear Maximum Sum-Rank Distance Codes. 1544-1549 - Jeremy S. Johnson, Huanran Li, Daniel L. Pimentel-Alarcón:
Fusion over the Grassmannian for High-Rank Matrix Completion. 1550-1555 - Wenjie Guan, Kai Huang, Xinyu Xie, Jinbei Zhang, Kechao Cai, Xiaoxia Huang:
New Results on Coded Caching in Partially Cooperative D2D Networks. 1556-1561 - K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan:
Two-Dimensional Multi-Access Coded Caching with Multiple Transmit Antennas. 1562-1567 - Rashid Ummer N. T., B. Sundar Rajan:
Improved Coded Caching from Two New Classes of PDAs from t-Designs. 1568-1573 - Charul Rajput, B. Sundar Rajan:
Improved Hotplug Caching Scheme Using PDAs. 1574-1579 - Kapila W. S. Palitharathna, Nizar Khalfet, Constantinos Psomas, George K. Karagiannidis, Ioannis Krikidis:
Information-Energy Capacity Region for SLIPT Systems Over Lognormal-Fading Channels. 1580-1585 - Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Y. Zhang:
Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs. 1586-1591 - Antonino Favano, Luca Barletta, Marco Sforzin, Paolo Amato, Marco Ferrari:
Low-Complexity Pearson-Based Detection for AWGN Channels with Offset. 1592-1597 - Hongru Cao, Qi Cheng, Sian-Jheng Lin:
An Efficient Inversion Encoding Scheme with k INV Signals on Bus Transmission. 1598-1603 - Yueying Lou, Qichun Wang:
New Results on the Imbalance of FCSR Sequences and LFSR Subsequences. 1604-1607 - Yueying Lou, Qichun Wang:
An Answer to an Open Problem on Balanced Boolean Functions with the Maximum Possible Walsh Supports. 1608-1612 - Lukas Kölsch, Alexandr Polujan:
A Study of APN Functions in Dimension 7 Using Antiderivatives. 1613-1617 - Sadmir Kudin, Enes Pasalic, Alexandr Polujan, Fengrong Zhang:
When does a Bent Concatenation Not Belong to the Completed Maiorana-McFarland Class? 1618-1622 - Seyed Mohammad Azimi-Abarghouyi, Lav R. Varshney:
Federated Learning via Lattice Joint Source-Channel Coding. 1623-1628 - Wei Dong, Howard H. Yang, Chenyuan Feng, Chen Sun:
Hierarchical Federated Learning: The Interplay of User Mobility and Data Heterogeneity. 1629-1634 - Bobak Nazer, Krishna Narayanan:
Computation Selection: Scheduling Users to Enable Over-the-Air Federated Learning. 1635-1640 - Mert Kayaalp, Yunus Inan, Visa Koivunen, Ali H. Sayed:
Causal Impact Analysis for Asynchronous Decision Making. 1641-1645 - Han Fang, Nan Liu, Wei Kang:
Optimal Memory-Rate Tradeoff in Secure Coded Caching for Small Buffer or Small Rate. 1646-1651 - Yinbin Ma, Daniela Tuninetti:
On Demand-Private Hotplug Caching Systems. 1652-1657 - Chao Qi, Minquan Cheng, Xianhua Niu, Bin Dai:
Coded Caching with File and Demand Privacy. 1658-1663 - K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan:
Placement Delivery Arrays for Coded Caching with Shared and Private Caches. 1664-1669 - Tharindu Adikari, Stark C. Draper:
Common Function Reconstruction with Information Swapping Terminals. 1670-1675 - Jun Muramatsu:
Distributed Source Coding Using Constrained-Random-Number Generators. 1676-1681 - Daniel Goc, Gergely Flamich:
On Channel Simulation with Causal Rejection Samplers. 1682-1687 - Evagoras Stylianou, Charalambos D. Charalambous, Themistoklis Charalambous:
Implicit and Explicit Formulas of the Joint RDF for a Tuple of Multivariate Gaussian Sources with Individual Square-Error Distortions. 1688-1693 - Tian Jiao, Yanlin Geng, Zai Yang:
Blahut-Arimoto Algorithm for Computing Capacity Region of Gaussian Vector Broadcast Channels. 1694-1699 - Constantin Runge, Gerhard Kramer:
Time-Shifted Alternating Gelfand-Pinsker Coding for Broadcast Channels. 1700-1705 - Muhammed Yusuf Sener, Gerhard Kramer, Shlomo Shamai Shitz, Ronald Böhnke, Wen Xu:
Achieving Gaussian Vector Broadcast Channel Capacity with Scalar Lattices. 1706-1711 - Alireza Vahid, Shih-Chun Lin:
Inter-Modal Coding in Broadcast Packet Erasure Channels with Varying Statistics. 1712-1717 - Tuan Thanh Nguyen, Kui Cai, Tony Q. S. Quek, Kees A. Schouhamer Immink:
Efficient Constructions of Non-Binary Codes Over Absorption Channels. 1718-1723 - Adrian Vidal, Viduranga Bandara Wijekoon, Emanuele Viterbo:
Code Design for Duplex Read Sequencing. 1724-1729 - Hrishi Narayanan, Prasad Krishnan, Nita Parekh:
On Achievable Rates for the Shotgun Sequencing Channel with Erasures. 1730-1735 - Ohad Elishco:
On the Long-Term Behavior of k-tuples Frequencies in Mutation Systems. 1736-1741 - Tuvi Etzion:
Pseduo- Random and de Bruijn Array Codes. 1742-1747 - Rajen Kumar, Prashant Kumar Srivastava, Sudhan Majhi:
A New Construction of Optimal Symmetrical ZCCS. 1748-1752 - Piyush Priyanshu, Sudhan Majhi, Subhabrata Paul:
Construction of Binary Odd Shift Complementary Pairs of All Lengths. 1753-1757 - Siddharth Bhandari, Abhishek Khetan:
Improved Upper Bound for the Size of a Trifferent Code. 1758-1763 - Zita Abreu, Joachim Rosenthal, Michael Schaller:
Algorithms for Computing the Free Distance of Convolutional Codes. 1764-1769 - Wenhui Sui, Brendan Towell, Zihan Qu, Eugene Min, Richard D. Wesel:
Linearity-Enhanced Serial List Decoding of Linearly Expurgated Tail-Biting Convolutional Codes. 1770-1775 - Zihan Qu, Amaael Antonini, Wenhui Sui, Eugene Min, Arthur Yang, Richard D. Wesel:
Complementary Exclusion of Full Polynomials to Enable Dual List Decoding of Convolutional Codes. 1776-1781 - Shobhit Bhatnagar, P. Vijay Kumar:
On Streaming Codes for Burst and Random Errors. 1782-1787 - Cheng Du, Yi Jiang:
Generalized Step-Chirp Sequences with Flexible Bandwidth. 1788-1793 - Kaiming Shen, Ziping Zhao, Yannan Chen, Zepeng Zhang, Hei Victor Cheng:
Accelerating Quadratic Transform and WMMSE. 1794-1799 - Zhongzhichao Wan, Jieao Zhu, Linglong Dai:
Electromagnetic Information Theory Motivated Near-Field Channel Model. 1800-1805 - Hang Ruan, Fan Liu:
Task-Based Quantizer Design for Sensing With Random Signals. 1806-1811 - Hsuan-Po Liu, Hessam Mahdavifar:
Projective Systematic Authentication via Reed-Muller Codes. 1812-1817 - Paulo Almeida, Miguel Beltrá, Diego Napp:
A Convolutional Variant of the Niederreiter Cryptosystem with GRS Codes. 1818-1823 - Vu Nguyen, Thomas Johansson, Qian Guo:
A Key-Recovery Attack on the LCMQ Authentication Protocol. 1824-1829 - Saar Tarnopolsky, Alejandro Cohen:
Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information. 1830-1835 - John Chen, Chen Dun, Anastasios Kyrillidis:
Fast FixMatch: Faster Semi-Supervised Learning with Curriculum Batch Size. 1836-1841 - Gholamali Aminian, Amirhossien Bagheri, Mahyar JafariNodeh, Radmehr Karimian, Mohammad Hossein Yassaee:
Robust Semi-supervised Learning via f-Divergence and α- Renyi Divergence. 1842-1847 - Shayan Mohajer Hamidi, Renhao Tan, Linfeng Ye, En-Hui Yang:
Fed-IT: Addressing Class Imbalance in Federated Learning through an Information- Theoretic Lens. 1848-1853 - Leighton Pate Barnes, Timothy Chow, Emma Cohen, Keith Frankston, Benjamin Howard, Fred Kochman, Daniel Scheinerman, Jeffrey M. Vanderkam:
Efficient Unbiased Sparsification. 1854-1859 - Hong Chen, Jinyuan Li, Liang Feng Zhang:
A Multi-Server Publicly Verifiable Computation Scheme with Context-Hiding Property. 1860-1865 - Albert Yu, Hai H. Nguyen, Aniket Kate, Hemanta K. Maji:
Unconditional Security Using (Random) Anonymous Bulletin Board. 1866-1871 - So Suda, Shun Watanabe, Haruya Yamaguchi:
An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation. 1872-1877 - Maki Yoshida:
Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs. 1878-1882 - Chih Wei Ling, Cheuk Ting Li:
Rejection-Sampled Universal Quantization for Smaller Quantization Errors. 1883-1888 - Marian Temprana Alonso, Farhad Shirani, Neil Irwin Bernardo, Yonina C. Eldar:
Non-Linear Analog Processing Gains in Task-Based Quantization. 1889-1894 - Oguzhan Kubilay Ülger, Elza Erkip:
One-Shot Wyner-Ziv Compression of a Uniform Source. 1895-1900 - Neophytos Charalambides, Arya Mazumdar:
Distributed Local Sketching for £2 Embeddings. 1901-1906 - Szymon Kobus, Lucas Theis, Deniz Gündüz:
Gaussian Channel Simulation with Rotated Dithered Quantization. 1907-1912 - Sharang M. Sriramu, Aaron B. Wagner:
Optimal Redundancy in Exact Channel Synthesis. 1913-1918 - Malhar A. Managoli, Vinod M. Prabhakaran:
Broadcast Channel Synthesis from Shared Randomness. 1919-1924 - Viswanathan Ramachandran, Tobias J. Oechtering, Mikael Skoglund:
Multi-terminal Strong Coordination Over Noisy Channels with Secrecy Constraints. 1925-1930 - Maximilian Gehri, Nicolai Engelmann, Heinz Koeppl:
Mutual Information of a class of Poisson-type Channels using Markov Renewal Theory. 1931-1936 - Filip Paluncic, Daniella Paluncic, Bodhaswar T. Maharaj:
Capacity of Runlength-Limited and GC-Content Constrained Codes for DNA Data Storage. 1937-1942 - Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi, Zohar Yakhini:
Representing Information on DNA Using Patterns Induced by Enzymatic Labeling. 1943-1948 - Tomer Cohen, Eitan Yaakobi:
Optimizing the Decoding Probability and Coverage Ratio of Composite DNA. 1949-1954 - Yeow Meng Chee, Quoc-Tung Le, Hoang Ta:
On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory. 1955-1960 - Huanran Li, Daniel L. Pimentel-Alarcón:
Group-Sparse Subspace Clustering with Elastic Stars. 1961-1966 - Hsin-Po Wang, Chi-Wei Chin:
On Counting Subsequences and Higher-Order Fibonacci Numbers. 1967-1972 - Jan Østergaard:
Directed Redundancy in Time Series. 1973-1978 - Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan:
Streaming Codes for Three-Node Relay Networks with Burst Erasures. 1979-1984 - Zita Abreu, Julia Lieb, Michael Schaller:
An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes. 1985-1990 - Shobhit Bhatnagar, Biswadip Chakraborty, P. Vijay Kumar:
On Streaming Codes for Simultaneously Correcting Burst and Random Erasures. 1991-1996 - Muhammad Ahmad Kaleem, Gustavo Kasper Facenda, Ashish Khisti:
Subset Adaptive Relaying for Streaming Erasure Codes. 1997-2002 - Cheng-En Lee, Kuo-Yu Liao, Cheng-Shang Chang, Duan-Shin Lee:
Potential Functions and Percolation Thresholds of Coded Poisson Receivers. 2003-2008 - Shuangyang Li, Giuseppe Caire:
A Novel Cross Domain Iterative Detection Based on the Interplay Between SPA and LMMSE. 2009-2014 - Jamison R. Ebert, Jean-François Chamberland, Krishna R. Narayanan:
Multi-User SR-LDPC Codes via Coded Demixing with Applications to Cell-Free Systems. 2015-2020 - Eleftherios Lampiris, Giuseppe Caire:
Quality Adaptation for Cache-Aided Degraded Broadcast Channels. 2021-2026 - Joy Qiping Yang, Salman Salamatian, Ziteng Sun, Ananda Theertha Suresh, Ahmad Beirami:
Asymptotics of Language Model Alignment. 2027-2032 - Yavuz Faruk Bakman, Duygu Nur Yaldiz, Baturalp Buyukates, Salman Avestimehr, Chenyang Tao, Dimitrios Dimitriadis:
Predicting Uncertainty of Generative LLMs with MARS: Meaning-Aware Response Scoring. 2033-2037 - Kaan Kale, Homa Esfahanizadeh, Noel Elias, Oguzhan Baser, Muriel Médard, Sriram Vishwanath:
TexShape: Information Theoretic Sentence Embedding for Language Models. 2038-2043 - Dana Levin, Alon Kipnis:
The Likelihood Gain of a Language Model as a Metric for Text Summarization. 2044-2049 - Jack Weinberg, Avijit Mandal, Henry D. Pfister:
Quantum State Compression with Polar Codes. 2050-2055 - Lu Hou, Chang Lv:
Amplitude Transformation of Quantum State Based on QSVT. 2056-2061 - Yannik N. Böck, Holger Boche, Zoe Garcia del Toro, Frank H. P. Fitzek:
Feynman Meets Turing: The Uncomputability of Quantum Gate-Circuit Emulation and Concatenation. 2062-2067 - Hafez M. Garmaroudi, S. Sandeep Pradhan, Jun Chen:
Rate-Limited Optimal Transport for Quantum Gaussian Observables. 2068-2073 - Zirui Yan, Arpan Mukherjee, Burak Varici, Ali Tajer:
Improved Bound for Robust Causal Bandits with Linear Models. 2074-2079 - Eray Can Elumar, Cem Tekin, Osman Yagan:
Multi-Armed Bandits with Probing. 2080-2085 - Jiabin Lin, Shana Moothedath:
Federated Learning for Heterogeneous Bandits with Unobserved Contexts. 2086-2091 - Tejas Pagare, Avishek Ghosh:
Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets. 2092-2097 - Dor Tsur, Haim H. Permuter:
InfoMat: A Tool for the Analysis and Visualization Sequential Information Transfer. 2098-2103 - Zihan Li, Shaocheng Liu, Qi Chen:
Symmetric Entropy Regions of Degrees Six and Seven. 2104-2109 - Amedeo Roberto Esposito, Michael Gastpar, Ibrahim Issa:
Variational Characterizations of Sibson's α-Mutual Information. 2110-2115 - Tao Wang, Ziv Goldfeld:
Neural Estimation of Entropic Optimal Transport. 2116-2121 - Dinh Thi Xinh, Ba Thong Le, Son Hoang Dau, Serdar Boztas, Stanislav Kruglik, Han Mao Kiah, Emanuele Viterbo, Tuvi Etzion, Yeow Meng Chee:
Repairing a Single Erasure in Reed-Solomon Codes with Side Information. 2122-2127 - Zhongyan Liu, Zhifang Zhang:
A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes. 2128-2133 - Yeow Meng Chee, Son Hoang Dau, Tuvi Etzion, Han Mao Kiah, Yuan Luo, Wenqin Zhang:
Repairing with Zero Skip Cost. 2134-2139 - Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Repairing Schemes for Tamo-Barg Codes. 2140-2145 - Maryam Farahnak-Ghazani, Negar Daryanavardan, Aria Nosratinia:
On the Separability of Beamforming for Reconfigurable Intelligent Surfaces Under Statistical CSI. 2146-2151 - Zilu Zhao, Dirk Slock:
Decentralized Expectation Propagation for Semi-Blind Channel Estimation in Cell-Free Networks. 2152-2156 - George Vershinin, Asaf Cohen, Omer Gurewitz:
Novel Bounds for Semi-Blind Multiple-Access in Massive MIMO. 2157-2162 - Negar Daryanavardan, Aria Nosratinia:
Achievable Rate for RIS-Assisted Sparse Channel with State Training. 2163-2168 - Chengpin Luo, Brian M. Kurkoski:
On the Existence of Cyclic Lattice Codes. 2169-2173 - Ling Liu, Shanxiang Lyu, Cong Ling, Baoming Bai:
On the Equivalence Between Probabilistic Shaping and Geometric Shaping: A Polar Lattice Perspective. 2174-2179 - Ana Paula S. Pierini, Franciele C. Silva, Sueli I. R. Costa:
Voronoi Constellations of Generalized Construction D' Lattices from q-ary Codes. 2180-2185 - Juliana G. F. Souza, Sueli I. R. Costa, Cong Ling:
Construction $\pi_{A}$ Lattices Extended to Hurwitz Quaternion Integers. 2186-2191 - Liuquan Yao, Zhichao Liu, Yuan Li, Huazi Zhang, Jun Wang, Guiying Yan, Zhi-Ming Ma:
New Partial Orders of Polar Codes for BMSC. 2192-2197 - Boaz Shuval, Ido Tal:
Strong Polarization for Shortened and Punctured Polar Codes. 2198-2203 - Mohsen Moradi, David G. M. Mitchell:
PAC Code Rate-Profile Design Using Search-Constrained Optimization Algorithms. 2204-2209 - Xinyuanmeng Yao, Xiangping Zheng, Xiao Ma:
Trellis-Based Construction of Polar Codes for SCL Decoding. 2210-2215 - Yanyan Dong, Shenghao Yang, Jie Wang, Fan Cheng:
Throughput and Latency of Network Coding in Line Networks with Outages. 2216-2221 - Rajlaxmi Pandey, Charul Rajput, B. Sundar Rajan:
Coded Caching for Hierarchical Two-Layer Networks with Coded Placement. 2222-2227 - Bin Dai, Fan Cheng, Yuhan Yang, Dengfeng Xia:
A Linear Feedback Coding Scheme for Computation Over Gaussian Multiple-Access Channels. 2228-2232 - Milad Abolpour, Mohammad Javad Salehi, Soheil Mohajer, Seyed Pooya Shariatpanahi, Antti Tölli:
Coded Multi-User Information Retrieval with a Multi-Antenna Helper Node. 2233-2238 - Dong Xiao, Yun Lin, Jian Wang:
Boundary Multiple Measurement Vectors for Multi-Coset Sampler. 2239-2244 - Reeteswar Rajguru, Balaji Udayagiri, Amitalok J. Budkuley, Stefano Rini:
On the Generalized Sampling Expansion (GSE) for Graph Signals. 2245-2250 - Curtis McDonald, Andrew R. Barron:
Log-Concave Coupling for Sampling Neural Net Posteriors. 2251-2256 - Yuheng Bu:
Towards Optimal Inverse Temperature in the Gibbs Algorithm. 2257-2262 - Sisi Miao, Jonathan Mandelbaum, Holger Jäkel, Laurent Schmalen:
A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes. 2263-2268 - Ching-Yi Lai, Pin-Chieh Tseng, Wei-Hsuan Yu:
Upper Bounds on the Size of Entanglement-Assisted Codeword Stabilized Codes Using Semidefinite Programming. 2269-2274 - Akram Saleh, Mohammad Reza Soleymani:
Quantum Codes Derived from One-Generator Quasi-Twisted Codes. 2275-2280 - Eren Guttentag, Andrew Nemec, Kenneth R. Brown:
Robust Syndrome Extraction via BCH Encoding. 2281-2286 - Arpan Mukherjee, Ali Tajer:
BAI in Exponential Family: Efficiency and Optimality. 2287-2292 - Kota Srinivas Reddy, P. N. Karthik, Vincent Y. F. Tan:
Best Arm Identification with Arm Erasures. 2293-2298 - Vedang Gupta, Yash Gadhia, Shivaram Kalyanakrishnan, Nikhil Karamchandani:
Optimal Stopping Rules for Best Arm Identification in Stochastic Bandits under Uniform Sampling. 2299-2304 - Michael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski:
Minimax Regret with Unbounded Weights. 2305-2310 - Osama A. Hanna, Xinlin Li, Suhas N. Diggavi, Christina Fragouli:
On the Relation Between the Common Information Dimension and Wyner Common Information. 2311-2316 - Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche:
Common Randomness Generation from Finite Compound Sources. 2317-2322 - Madhura Pathegama, Sagnik Bhattacharya:
Shared Information Under Simple Markov Independencies. 2323-2328 - Aobo Lyu, Andrew Clark, Netanel Raviv:
Explicit Formula for Partial Information Decomposition. 2329-2334 - Junming Ke, Henk D. L. Hollmann, Ago-Erik Riet:
A Binary Linear Functional-Repair Regenerating Code on 72 Coding Spaces Related to PG(2, 8). 2335-2340 - Yumeng Yang, Han Cai, Xiaohu Tang:
Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth Under the Rack-Aware Storage Model. 2341-2346 - Hao Shi, Zhengyi Jiang, Zhongyi Huang, Bo Bai, Gong Zhang, Hanxu Hou:
Set Transformation: Trade-Off Between Repair Bandwidth and Sub-Packetization. 2347-2352 - Zhongyan Liu, Zhifang Zhang:
A Family of Access-Friendly MDS Array Codes. 2353-2358 - Sheng Yang, Richard Combes:
Asymptotic Capacity of Non-Coherent One-Bit MIMO Channels with Block Fading. 2359-2364 - Alex Dytso, Luca Barletta, Gerhard Kramer:
On $2\times 2$ MIMO Gaussian Channels with a Small Discrete-Time Peak-Power Constraint. 2365-2370 - Siyao Li, Fernando Pedraza, Giuseppe Caire:
On the Capacity of Gaussian "Beam-Pointing" Channels with Block Memory and Feedback. 2371-2376 - Barak Avraham, Elad Domanovitz, Uri Erez:
Universal Transmission and Combining for Ultra-Reliable MIMO Relaying. 2377-2382 - Chiara Castello, Olga Polverino, Ferdinando Zullo:
On One-Orbit Cyclic Subspace Codes of Gq(n, 3). 2383-2388 - Clementa Alonso-González, Miguel Ángel Navarro-Pérez:
Optimal full-length cyclic orbit flag codes. 2389-2393 - Hessam Mahdavifar, Robin Rajamäki, Piya Pal:
Subspace Coding for Spatial Sensing. 2394-2399 - Samin Riasat, Hessam Mahdavifar:
Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes. 2400-2405 - Tyler Kann, Shrinivas Kudekar, Matthieu R. Bloch:
A Path Metric Based Construction of Polarization-Adjusted Convolutional Codes. 2406-2411 - Hsin-Po Wang, Venkatesan Guruswami:
Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically. 2412-2417 - Ziyuan Zhu, Paul H. Siegel:
Outer Code Designs for Augmented and Local-Global Polar Code Architectures. 2418-2423 - Ziv Aharoni, Bashar Huleihel, Henry D. Pfister, Haim H. Permuter:
Code Rate Optimization via Neural Polar Decoders. 2424-2429 - Daiki Suruga:
A probabilistic analysis on general probabilistic scheduling problems. 2430-2435 - Zhiwei Shan, Xinping Yi, Le Liang, Chung-Shou Liao, Shi Jin:
GRLinQ: A Distributed Link Scheduling Mechanism with Graph Reinforcement Learning. 2436-2441 - Touraj Soleymani, John S. Baras, Deniz Gündüz:
Networked Control with Hybrid Automatic Repeat Request Protocols. 2442-2447 - Boxiang Ren, Han Hao, Ziyuan Lyu, Jingchen Peng, Junyuan Wang, Hao Wu:
Tight Differentiable Relaxation of Sum Ergodic Capacity Maximization for Clustered Cell-Free Networking. 2448-2453 - Jingchen Peng, Boxiang Ren, Lu Yang, Chenghui Peng, Panpan Niu, Hao Wu:
QML-IB: Quantized Collaborative Intelligence between Multiple Devices and the Mobile Network. 2454-2459 - Yi Song, Kai Wan, Zhenyu Liao, Hao Xu, Giuseppe Caire, Shlomo Shamai:
An Achievable and Analytic Solution to Information Bottleneck for Gaussian Mixtures. 2460-2465 - Lingyi Chen, Jiachuan Ye, Shitong Wu, Huihui Wu, Hao Wu, Wenyi Zhang:
An Expectation-Maximization Relaxed Method for Privacy Funnel. 2466-2471 - Michael Gastpar, Aayush Rajesh:
The Persuasion Bottleneck. 2472-2477 - Hanwen Yao, Waleed Abu Laban, Christian Häger, Alexandre Graell i Amat, Henry D. Pfister:
Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation. 2478-2483 - Lin Sok, Martianus Frederic Ezerman, San Ling, Mareth Mam:
Entanglement-Assisted Quantum Codes from a Class of Unitary Matrices. 2484-2489 - Kao-Yueh Kuo, Ching-Yi Lai:
Decoding Strategies for Generalized Quantum Data-Syndrome Coding Problems. 2490-2495 - Anqi Gong, Joseph M. Renes:
Improved Logical Error Rate via List Decoding of Quantum Polar Codes. 2496-2501 - Mayank Bakshi, Sara Ghasvarianjahromi, Yauhen Yakimenka, Allison Beemer, Oliver Kosut, Jörg Kliewer:
Valid: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence. 2502-2507 - Shuangyi Chen, Yue Ju, Zhongwen Zhu, Ashish Khisti:
Secure Inference for Vertically Partitioned Data Using Multiparty Homomorphic Encryption. 2508-2513 - Ankit Pratap Singh, Namrata Vaswani:
Byzantine-Resilient Federated Principal Subspace Estimation. 2514-2519 - Shuche Wang, Vincent Y. F. Tan:
Robust Distributed Gradient Descent to Corruption over Noisy Channels. 2520-2525 - Dor Tsur, Haim H. Permuter, Ziv Goldfeld:
Several Interpretations of Max-Sliced Mutual Information. 2526-2531 - Guan-Ren Wang, Chung-En Tsai, Hao-Chung Cheng, Yen-Huan Li:
Computing Augustin Information via Hybrid Geodesically Convex Optimization. 2532-2537 - Hao-Chung Cheng, Baris Nakiboglu:
A New Characterization Of Augustin Information And Mean. 2538-2543 - William Lu, Anuran Makur, Japneet Singh:
On Doeblin Curves and Their Properties. 2544-2549 - Derya Malak:
Distributed Structured Matrix Multiplication. 2550-2555 - Adrián Fidalgo-Díaz, Umberto Martínez-Peñas:
Distributed Matrix Multiplication with Straggler Tolerance Using Algebraic Function Fields. 2556-2561 - Okko Makkonen:
Flexible Field Sizes in Secure Distributed Matrix Multiplication via Efficient Interference Cancellation. 2562-2567 - Ryann Cartor, Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk, Alex Sprintson:
Secure Distributed Matrix Multiplication with Precomputation. 2568-2573 - Yiqi Chen, Tobias J. Oechtering, Holger Boche, Mikael Skoglund, Yuan Luo:
Distribution-Preserving Integrated Sensing and Communication with Secure Reconstruction. 2574-2579 - Truman Welling, Onur Günlü, Aylin Yener:
Transmitter Actions for Secure Integrated Sensing and Communication. 2580-2585 - Fuwang Dong, Fan Liu, Shihang Lu, Yifeng Xiong, Weijie Yuan, Yuanhao Cui:
Fundamental Limits of Communication-Assisted Sensing in ISAC Systems. 2586-2591 - Yao Liu, Min Li, Lawrence Ong, Aylin Yener:
Bistatic Integrated Sensing and Communication over Memoryless Relay Channels. 2592-2597 - Gustavo Terra Bastos, Maiara F. Bollauf, Agnaldo José Ferrari, Øyvind Ytrehus:
Nested Construction of $\mathbb{Z}_{2^{L}} \text{-Linear}$ Codes. 2598-2603 - Jianguo Zhao, Jiwei Liang, Li Chen:
Efficient Root-Finding for Interpolation-Based Decoding of Elliptic and Hyperelliptic Codes. 2604-2609 - Stefano Della Fiore, Marco Dalai:
Upper Bounds on the Rate of Linear Q-Ary K-Hash Codes. 2610-2615 - Sebastian Bitzer, Alberto Ravagnani, Violetta Weger:
Weighted-Hamming Metric for Parallel Channels. 2616-2621 - Qianfan Wang, Yixin Wang, Yiwen Wang, Jifan Liang, Xiao Ma:
Random Staircase Generator Matrix Codes. 2622-2627 - Daniella Bar-Lev, Adir Kobovich, Orian Leitersdorf, Eitan Yaakobi:
Optimal Almost-Balanced Sequences. 2628-2633 - Roni Con, Ryan Gabrys, Eitan Yaakobi:
One Code Fits All: Strong Stuck-At Codes for Versatile Memory Encoding. 2634-2639 - Stanislav Kruglik, Han Mao Kiah, Son Hoang Dau, Eitan Yaakobi:
Private Repair of a Single Erasure in Reed-Solomon Codes. 2640-2645 - Ningze Wang, Anoosheh Heidarzadeh, Alex Sprintson:
A New Approach to Harnessing Side Information in Multi-Server Private Information Retrieval. 2646-2651 - Leila Erhili, Anoosheh Heidarzadeh:
Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS Codes. 2652-2657 - Hassan ZivariFard, Rémi A. Chou, Xiaodong Wang:
The Capacity of Symmetric Private Information Retrieval with Private Noisy Side Information. 2658-2663 - Rémi A. Chou:
Dual-Source Symmetric PIR Without Data Replication or Shared Randomness. 2664-2669 - Wenliang Liu, Guanding Yu, Lele Wang, Renjie Liao:
An Information-Theoretic Framework for Out-of-Distribution Generalization. 2670-2675 - Borja Rodríguez Gálvez, Omar Rivasplata, Ragnar Thobaben, Mikael Skoglund:
A Note on Generalization Bounds for Losses with Finite Moments. 2676-2681 - Milad Sefidgaran, Abdellatif Zaidi:
Data-Dependent Generalization Bounds via Variable-Size Compressibility. 2682-2687 - Haiyun He, Christina Lee Yu, Ziv Goldfeld:
Hierarchical Generalization Bounds for Deep Neural Networks. 2688-2693 - George Androulakis, Rabins Wosti:
Optimal Lower Bound of the Average Indeterminate Length Lossless Quantum Block Encoding. 2694-2699 - Anqi Gong, Sebastian Cammerer, Joseph M. Renes:
Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes. 2700-2705 - Arda Aydin, Max A. Alekseyev, Alexander Barg:
A Family of Permutationally Invariant Quantum Codes. 2706-2711 - James Chin-Jen Pang, S. Sandeep Pradhan, Hessam Mahdavifar:
Abelian Group Codes for Classical and CQ Channel Coding: One-Shot and Asymptotic Rate Bounds. 2712-2717 - Hasin Us Sami, Basak Güler:
Sparsity-Based Secure Gradient Aggregation for Resource-Constrained Federated Learning. 2718-2723 - Hasin Us Sami, Basak Güler:
Secure Submodel Aggregation for Resource-Aware Federated Learning. 2724-2729 - Ziting Zhang, Jiayu Liu, Kai Wan, Hua Sun, J. Mingyue, Giuseppe Caire:
On the Optimality of Secure Aggregation with Uncoded Groupwise Keys Against User Dropouts and User Collusion. 2730-2735 - Kai Wan, Hua Sun, Mingyue Ji, Tiebin Mi, Giuseppe Caire:
Optimal Information Theoretic Secure Aggregation with Uncoded Groupwise Keys. 2736-2741 - Shuaiqi Wang, Zinan Lin, Giulia Fanti:
Statistic Maximal Leakage. 2742-2747 - Robinson D. H. Cung, Yanina Y. Shkel, Ibrahim Issa:
Binary Maximal Leakage. 2748-2753 - Gowtham R. Kurri, Malhar A. Managoli, Vinod M. Prabhakaran:
Maximal Guesswork Leakage. 2754-2759 - Ni Ding, Mohammad Amin Zarrabian, Parastoo Sadeghi:
A Cross Entropy Interpretation of Renyi Entropy for $\alpha$ -leakage. 2760-2765 - Deheng Yuan, Tao Guo, Zhongyi Huang, Shi Jin:
Local Decoding in Distributed Approximate Computing. 2766-2771 - Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo:
Non-Binary Covering Codes for Low-Access Computations. 2772-2777 - Shanuja Sasi, Onur Günlü:
Rate-Limited Shuffling for Distributed Computing. 2778-2783 - Haoning Chen, Minquan Cheng, Ziyu Zhang, Kai Liang, Zhenhao Huang, Youlong Wu:
On Decentralized Linearly Separable Computation With the Minimum Computation Cost. 2784-2789 - Homa Nikbakht, Michèle A. Wigger, Shlomo Shamai, H. Vincent Poor:
Integrated Sensing and Communication in the Finite Blocklength Regime. 2790-2795 - Daewon Seo, Sung Hoon Lim:
On the Fundamental Tradeoff of Joint Communication and Quickest Change Detection. 2796-2801 - Chan Xu, Shuowen Zhang:
Integrated Sensing and Communication Exploiting Prior Information: How Many Sensing Beams are Needed? 2802-2807 - Kareem M. Attiah, Wei Yu:
Beamforming Design for Integrated Sensing and Communications Using Uplink-Downlink Duality. 2808-2813 - Eduardo Camps-Moreno, Gretchen L. Matthews, Welington Santos:
Error Correction from Partial Information Via Norm-Trace Codes. 2814-2819 - Songsong Li, Shu Liu, Liming Ma, Yunqi Wan, Chaoping Xing:
Asymptotic Construction of Locally Repairable Codes with Multiple Recovering Sets. 2820-2825 - Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau:
On ML Decoding of Binary Cyclic-gap Constant Weight Codes. 2826-2831 - Shubhransh Singhvi, Roni Con, Han Mao Kiah, Eitan Yaakobi:
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes. 2832-2837 - Geoffrey Mon, Dana Moshkovitz, Justin Oh:
Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate. 2838-2843 - Xinyi Gu, Mohammad Rowshan, Jinhong Yuan:
Reverse PAC Codes: Look-Ahead List Decoding. 2844-2849 - Hanzaleh Akbarinodehi, Viveck R. Cadambe, Mohammad Ali Maddah-Ali:
Game of Coding: Beyond Trusted Majorities. 2850-2855 - Mustafa Doger, Sennur Ulukus:
PoW Security-Latency and Transaction Rate. 2856-2861 - Yu-Shin Huang, Wenyuan Zhao, Ruida Zhou, Chao Tian:
Weakly Private Information Retrieval from Heterogeneously Trusted Servers. 2862-2867 - Song Chen, Haobo Jia, Zhuqing Jia:
A Capacity Result on Weakly-Private Information Retrieval. 2868-2873 - Okko Makkonen, David A. Karpuk, Camilla Hollanti:
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval. 2874-2879 - Neehar Verma, Camilla Hollanti:
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack. 2880-2885 - Shuiyin Liu, Amin Sakzad:
CRYSTALS-Kyber With Lattice Quantizer. 2886-2891 - Alejandro Cohen, Rafael G. L. D'Oliveira:
Network Coding-Based Post-Quantum Cryptography for Multi-Users with Different Security Permissions. 2892-2897 - Motonari Honda, Yuichi Kaji:
Optimum Fingerprinting Function for Winternitz One-Time Signature. 2898-2902 - Thomas Debris-Alazard, Pierre Loisel, Valentin Vasseur:
Exploiting Signature Leakages: Breaking Enhanced pqsigRM. 2903-2908 - Yuval Kochman:
An Improved Upper Bound for Distributed Hypothesis Testing. 2909-2914 - Elsa Dupraz, Ismaila Salihou Adamou, Reza Asvadi, Tad Matsumoto:
Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing. 2915-2920 - Hao-Chung Cheng, Christoph Hirche, Cambyse Rouzé:
Sample Complexity of Locally Differentially Private Quantum Hypothesis Testing. 2921-2926 - Sara Zendehboodi, Sorina Dumitrescu:
Optimal Distributed Quantizer Design for Binary Classification of Conditionally Independent Vector Sources. 2927-2932 - Peter Trifonov:
Generalized Concatenated Polarization Kernels. 2933-2938 - Peihong Yuan, Ken R. Duffy, Muriel Médard:
Near-Optimal Generalized Decoding of Polar-like Codes. 2939-2944 - Mohammad Rowshan, Vlad-Florin Dragoi, Jinhong Yuan:
Weight Structure of Low/High-Rate Polar Codes and Its Applications. 2945-2950 - Hessam Mahdavifar, Fariba Abbasi:
Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels. 2951-2956 - Shota Saito:
Soft Guessing Under Log-Loss Distortion Allowing Errors. 2957-2962 - Julien Béguinot, Olivier Rioul:
What can Information Guess? Guessing Advantage vs. Rényi Entropy for Small Leakages. 2963-2968 - Charalambos D. Charalambous, Stelios Louka:
Feedback Capacity of Nonlinear Decision Models with General Noise: Gaussian Applications with Filtering and Control Riccati Equations. 2969-2974 - Mudit Aggarwal, Manuj Mukherjee:
Improved Bounds on the Interactive Capacity via Error Pattern Analysis. 2975-2980 - Aditya Nema, Sreejith Sreekumar, Mario Berta:
One-Shot Multiple Access Channel Simulation. 2981-2986 - Xiaoqi Liu, Kuan Hsieh, Ramji Venkataramanan:
Coded Many-User Multiple Access via Approximate Message Passing. 2987-2992 - Xiaoqi Liu, Pablo Pascual Cobo, Ramji Venkataramanan:
Many-user multiple access with random user activity. 2993-2998 - Lanwei Zhang, Jingge Zhu, Jamie S. Evans:
Compute-Forward Multiple Access for Gaussian Fast Fading Channels. 2999-3004 - Thach V. Bui, Yeow Meng Chee, Van Khu Vu:
Efficient Designs for Threshold Group Testing Without Gap. 3005-3010 - Mgeni Makambi Mashauri, Alexandre Graell i Amat, Michael Lentmaier:
Threshold Saturation for Quantitative Group Testing with Low-Density Parity-Check Codes. 3011-3016 - Mahdi Soleymani, Tara Javidi:
Quantitative Group Testing with Tunable Adaptation. 3017-3022 - Kok Hao Chen, Duc Tu Dao, Han Mao Kiah, Phuoc Pham Van Long, Eitan Yaakobi:
Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics. 3023-3028 - Yuwen Huang, Pascal O. Vontobel:
The Bethe Partition Function and the SPA for Factor Graphs based on Homogeneous Real Stable Polynomials. 3029-3034 - Dimitris Achlioptas, Kostas Zampetakis:
Bounding Weakly Correlated Products from Below: Supermodularity is All You Need. 3035-3040 - Eren C. Kizildag:
A Random CSP with Connections to Discrepancy Theory and Randomized Trials. 3041-3046 - Akshay Kiran Jose, Gangadhar Karevvanavar, Rajshekhar Vishweshwar Bhat:
An Encoder-Decoder Approach for Packing Circles. 3047-3052 - Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar:
Differential-Privacy Capacity. 3053-3058 - Karan Elangovan, Varun S. Jog:
On the Extreme Points of the (0, δ) - Differential Privacy Polytope. 3059-3064 - Seung-Hyun Nam, Hyun-Young Park, Si-Hyeon Lee:
Achieving the Exactly Optimal Privacy-Utility Trade-Off with Low Communication Cost via Shared Randomness. 3065-3070 - Leonhard Grosse, Sara Saeidian, Parastoo Sadeghi, Tobias J. Oechtering, Mikael Skoglund:
Quantifying Privacy via Information Density. 3071-3076 - Kordag Mehmet Kilic, Jin Sima, Jehoshua Bruck:
Nearest Neighbor Representations of Neural Circuits. 3077-3082 - Holger Boche, Andrea Grigorescu, Rafael F. Schaefer, H. Vincent Poor:
On the Non-Computability of Convex Optimization Problems. 3083-3088 - Holger Boche, Adalbert Fono, Gitta Kutyniok:
A Mathematical Framework for Computability Aspects of Algorithmic Transparency. 3089-3094 - Jin Lee, Zheng Zhang, Sofía González-García, Haewon Jeong:
Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm. 3095-3100 - Minglai Cai, Andreas J. Winter:
Quantum Wiretap Channel Coding Assisted by Noisy Correlation. 3101-3105 - Shi-Yuan Wang, Shang-Jen Su, Matthieu R. Bloch:
Resource-Efficient Entanglement-Assisted Covert Communications over Bosonic Channels. 3106-3111 - Soham Ghosh, Vladlen Galetsky, Pol Julià Farré, Christian Deppe, Roberto Ferrara, Holger Boche:
Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement. 3112-3117 - Hasan Iqbal, Walter O. Krawec:
New Security Proof of a Restricted High-Dimensional QKD Protocol. 3118-3123 - Yanxiao Liu, Cheuk Ting Li:
One-Shot Coding over General Noisy Networks. 3124-3129 - Yue Bi, Yue Wu, Cunqing Hua:
DoF Analysis for (M, N)-Channels through a Number-Filling Puzzle. 3130-3135 - Amin Gohari, Chandra Nair, Jinpei Zhao:
On the capacity region of some classes of interference channels. 3136-3141 - William Lu, Anuran Makur:
On Permutation Capacity Regions of Multiple-Access Channels. 3142-3147 - Canran Wang, Jin Sima, Netanel Raviv:
Break-Resilient Codes for Forensic 3D Fingerprinting. 3148-3153 - Miao Liu, Zengjiao Ma, Chong Shangguan:
Near Optimal Constructions of Frameproof Codes. 3154-3159 - Eduardo Camps-Moreno, Hiram H. López, Eliseo Sarmiento, Ivan Soprunov:
On the Affine Permutation Group of Certain Decreasing Cartesian Codes. 3160-3165 - Yeow Meng Chee, Huimin Lao, Tien Long Nguyen, Van Khu Vu:
Window Weight Limited Gray Codes and Robust Positioning Sequences. 3166-3171 - Laigang Guo, Raymond W. Yeung, Xiao-Shan Gao:
Proving Information Inequalities by Gaussian Elimination. 3172-3177 - Lifu Jin, Amedeo Roberto Esposito, Michael Gastpar:
Properties of the Strong Data Processing Constant for Rényi Divergence. 3178-3183 - Andrei Tanasescu, Pantelimon George Popescu:
Self Improvement of the McEliece- Yu Inequality. 3184-3188 - Cheuk Ting Li:
A Poisson Decomposition for Information and the Information-Event Diagram. 3189-3194 - Shan Lu, Hiroshi Kamabe:
Enhancing the Maximum Tolerable Number of Active Users for Unsourced Random Access. 3195-3200 - Jianxiang Yan, Guanghui Song, Ying Li, Zhaoji Zhang, Yuhao Chi:
Enhanced ODMA with Channel Code Design and Pattern Collision Resolution for Unsourced Multiple Access. 3201-3206 - Jyun-Sian Wu, Pin-Hsun Lin, Marcel A. Mross, Eduard A. Jorswieck:
Worst-Case Per-User Error Bound for Asynchronous Unsourced Multiple Access. 3207-3212 - Junyuan Gao, Yongpeng Wu, Giuseppe Caire, Wei Yang, Wenjun Zhang:
Unsourced Random Access in MIMO Quasi-Static Rayleigh Fading Channels with Finite Blocklength. 3213-3218 - Sarthak Jain, Martina Cardone, Soheil Mohajer:
Sparsity-Constrained Community-Based Group Testing. 3219-3224 - Hesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti:
Group Testing with General Correlation Using Hypergraphs. 3225-3230 - Hsin-Po Wang, Venkatesan Guruswami:
Isolate and then Identify: Rethinking Adaptive Group Testing. 3231-3236 - Jinping Fan, Yujie Gu, Ying Miao, Zhebin Yu:
List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing. 3237-3242 - Rachel Bonen, Asaf Cohen:
Less than 1-Bit Control of an Unstable AR Process with 1-Bit Quantizers. 3243-3248 - Souvik Das, Avishek Ghosh, Debasish Chatterjee:
Detection of False Data Injection Attacks in Cyber-Physical Systems. 3249-3254 - Mengyuan Zhao, Maël Le Treust, Tobias J. Oechtering:
Coordination Coding with Causal Encoder for Vector-Valued Witsenhausen Counterexample. 3255-3260 - Barron Han, Victoria Kostina, Babak Hassibi, Oron Sabag:
Coded Kalman Filtering over MIMO Gaussian Channels with Feedback. 3261-3266 - Shreya Meel, Sennur Ulukus:
HetDAPAC: Distributed Attribute-Based Private Access Control with Heterogeneous Attributes. 3267-3272 - Shreyas Jain, Luis Maßny, Christoph Hofmeister, Eitan Yaakobi, Rawad Bitar:
Interactive Byzantine-Resilient Gradient Coding for General Data Assignments. 3273-3278 - Rimpi Borah, J. Harshan:
On Securing Analog Lagrange Coded Computing from Colluding Adversaries. 3279-3284 - Manuj Mukherjee, Ran Gelles:
Information Exchange is Harder with Noise at Source. 3285-3290 - Chao Zhao, Zimeng Wang, Qiaoqiao Zhou, Chee-Wei Tan, Chung Chan:
Infodemic Source Detection: Enhanced Formulations with Information Flow. 3291-3296 - Manuj Mukherjee, Ran Gelles:
Computation in Server-Assisted Noisy Networks. 3297-3301 - Pawan Poojary, Randall Berry:
The Benefit of More Bad Choices in Observational Learning. 3302-3307 - Bo-Yu Yang, Hsuan Yu, Hao-Chung Cheng:
Maximal $\alpha$ - Leakage for Quantum Privacy Mechanisms and Operational Meaning of Measured Renyi Capacity. 3308-3313 - Alptug Aytekin, Mohamed W. Nomeir, Sennur Ulukus:
Quantum Private Membership Aggregation. 3314-3319 - Kumar Nilesh, Christian Deppe, Holger Boche:
Information Theoretic Analysis of a Quantum PUF. 3320-3325 - Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci, Giorgio Venditti:
An Information-Theoretic Approach to Anonymous Access Control. 3326-3331 - Oliver Kosut, Michelle Effros, Michael Langberg:
Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying. 3332-3337 - Tao Guo, Laigang Guo, Yinfei Xu, Congduan Li, Shi Jin, Raymond W. Yeung:
Sliding Secure Symmetric Multilevel Diversity Coding. 3338-3343 - Yasutada Oohama, Bagus Santoso:
Universal Source Encryption under Side-Channel Attacks. 3344-3349 - Matthias Frey, Igor Bjelakovic, Michael C. Gastpar, Jingge Zhu:
Simultaneous Computation and Communication over MAC. 3350-3355 - Tadashi Wadayama, Lantian Wei:
Generalized Gradient Flow Decoding and its Tensor-Computability. 3356-3361 - Sisi Miao, Jonathan Mandelbaum, Lukas Rapp, Holger Jäkel, Laurent Schmalen:
Performance Analysis of Generalized Product Codes with Irregular Degree Distribution. 3362-3367 - Mustafa Cemil Coskun:
Precoded Polar Product Codes. 3368-3373 - Alessandro Annechini, Alessandro Barenghi, Gerardo Pelosi:
Bit-Flipping Decoder Failure Rate Estimation for (v, w)-Regular Codes. 3374-3379 - Zijie Chen, Chandra Nair:
On the Optimality of Dictator Functions and Isoperimetric Inequalities on Boolean Hypercubes. 3380-3385 - Uri Erez, Or Ordentlich, Shlomo Shamai:
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. 3386-3391 - Donald Kougang-Yombi, Jan Hazla:
A Quantitative Version of More Capable Channel Comparison. 3392-3397 - Venkat Anantharam:
An Information-Theoretic Proof of the Shannon-Hagelbarger Theorem. 3398-3401 - H. S. Melihcan Erol, Lizhong Zheng:
On Semi-Supervised Estimation of Discrete Distributions Under f-Divergences. 3402-3407 - Zhuohang He, Xiaojun Yuan, Junjie Ma:
Asymptotic Estimates for Spectral Estimators of Rotationally Invariant Matrices. 3408-3413 - Fengpei Li, Ziping Zhao:
Guaranteed Robust Large Precision Matrix Estimation Under t-Distribution. 3414-3419 - Tianren Peng, Xinyi Tong, Shao-Lun Huang:
Second-Order Characterization of Minimax Parameter Estimation in Restricted Parameter Space. 3420-3425 - Yan Hao Ling, Jonathan Scarlett:
Exact Error Exponents for a Concatenated Coding Based Class of DNA Storage Codes. 3426-3431 - Flavio Zabini, Barbara M. Masini:
Performance Limits in 3D Localization via Molecular Diffusion. 3432-3437 - Brendon McBain, James Saunderson, Emanuele Viterbo:
On Noisy Duplication Channels with Markov Sources. 3438-3443 - Ruslan Morozov, Tolga M. Duman:
On the Capacity of Channels with Markov Insertions, Deletions and Substitutions. 3444-3449 - Joonhyuk Yang, Hye Won Chung:
Exact Graph Matching in Correlated Gaussian-Attributed Erdős- Rényi Mode. 3450-3455 - Wen-Xin Pan, Isabel Haasler, Pascal Frossard:
Subgraph Matching via Partial Optimal Transport. 3456-3461 - Andrew McGregor, Rik Sengupta:
Graph Reconstruction from Noisy Random Subgraphs. 3462-3467 - Purui Zhang, Xingchao Jian, Feng Ji, Wee Peng Tay, Bihan Wen:
Spectral Convergence of Simplicial Complex Signals. 3468-3473 - Behnoosh Zamanlooy, Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
$\mathrm{E}_{\gamma}$-Mixing Time. 3474-3479 - Amirreza Zamani, Sajad Daei, Tobias J. Oechtering, Mikael Skoglund:
Multi-Task Private Semantic Communication. 3480-3485 - Jing Yang, Shu-Tao Xia, Xianfang Wang, Can Xiang, Fang-Wei Fu:
A New Multi-Receiver Authentication Scheme for General Access Structure. 3486-3491 - Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka:
Entropy-Achieving Compression with Private Local Decodability. 3492-3497 - Neil Irwin Bernardo, Shaik Basheeruddin Shah, Yonina C. Eldar:
Modulo Sampling with 1-Bit Side Information: Performance Guarantees in the Presence of Quantization. 3498-3503 - Joseph Gabet, Maxime Ferreira Da Costa:
Preconditioned Gradient Descent for Sketched Mixture Learning. 3504-3509 - Vanlalruata Ralte, Amitalok J. Budkuley, Stefano Rini:
Distributed Sampling for the Detection of Poisson Sources Under Observation Erasures. 3510-3515 - Shunqi Huang, Lei Liu, Brian M. Kurkoski:
Overflow-Avoiding Memory AMP. 3516-3521 - Mohammad Moltafet, Hamid R. Sadjadpour, Zouheir Rezki:
An Unconditionally Secure Encryption Protocol for Cloud Storage. 3522-3527 - Anuj Kumar Yadav, Manideep Mamindlapally, Amitalok J. Budkuley:
Wiretapped Commitment Over Binary Channels. 3528-3533 - Alejandro Cohen, Rafael G. L. D'Oliveira:
Error Correction Capabilities of Non-Linear Cryptographic Hash Functions. 3534-3539 - Joe Suzuki, Tianle Yang:
Generalization of LiNGAM that Allows Confounding. 3540-3545 - Alankrita Bhatt, Victoria Kostina:
Prediction with Noisy Expert Advice. 3546-3551 - Marco Bondaschi, Michael Gastpar:
Batch Universal Prediction. 3552-3557 - Itzhak Tamo:
Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes. 3558-3563 - Amit Berman, Yaron Shany, Itzhak Tamo:
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity. 3564-3569 - Marcel Fernandez, Josep Cotrina Navau:
Multiplicity Assignments for Koetter-Vardy Decoding. The Case of Traceability Codes. 3570-3575 - Xiangping Zheng, Qianfan Wang, Baodian Wei, Xiao Ma:
Quasi-OSD of Binary Image of RS Codes with Applications to JSCC. 3576-3581 - Matthieu Fradelizi, Lampros Gavalakis, Martin Rapaport:
Dimensional Discrete Entropy Power Inequalities for Log-Concave Random Vectors. 3582-3587 - Chin Wa Ken Lau, Chandra Nair:
An Entropic Inequality in Finite Abelian Groups Analogous to the Unified Brascamp-Lieb and Entropy Power Inequality. 3588-3593 - Alexandros Eskenazis, Lampros Gavalakis:
Gaussian Mixtures: Convexity Properties and CLT Rates for the Entropy and Fisher Information. 3594-3599 - Yanlin Geng:
McKean's Conjecture Under the Log-Concavity Assumption. 3600-3605 - Nicholas Barnfield, Raphaël Grondin, Gaia Pozzoli, Renaud Raquépas:
Ziv-Merhav Estimation for Hidden-Markov Processes. 3606-3611 - Neri Merhav:
Parameter Estimation Based on Noisy Chaotic Signals in the Weak-Noise Regime. 3612-3617 - Masahiro Kobayashi, Kazuho Watanabe:
Unbiased Estimating Equation on Inverse Divergence and its Conditions. 3618-3623 - Federico Bello, Alvaro Martín, Tatiana Rischewski, Gadiel Seroussi:
The Lattice-Input Discrete-Time Poisson Channel. 3624-3629 - Luca Barletta, Alex Dytso, Shlomo Shamai:
Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels. 3630-3635 - Daanish Mahajan, Chirag Jain, Navin Kashyap:
On the Coverage Required for Diploid Genome Assembly. 3636-3641 - Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar:
DIST-CURE: A Robust Distributed Learning Algorithm with Cubic Regularized Newton. 3642-3647 - Chanho Park, H. Vincent Poor, Namyoon Lee:
SignSGD-FV: Communication-Efficient Distributed Learning Through Heterogeneous Edges. 3648-3653 - Hongbo Li, Lingjie Duan:
Distributed Learning for Dynamic Congestion Games. 3654-3659 - Zonghong Liu, Salim El Rouayheb, Matthew Dwyer:
The Entrapment Problem in Random Walk Decentralized Learning. 3660-3665 - Sajani Vithana, Martina Cardone, Flávio P. Calmon:
Private Approximate Nearest Neighbor Search for Vector Database Querying. 3666-3671 - Or Elimelech, Asaf Cohen:
An Efficient, High-Rate Scheme for Private Information Retrieval over the Gaussian MAC. 3672-3677 - Jüri Lember, Ago-Erik Riet:
Equal Requests are Asymptotically Hardest for Data Recovery. 3678-3683 - Levli Citron, Kobi Cohen, Qing Zhao:
Anomaly Search of a Hidden Markov Model. 3684-3688 - Charantej Reddy Pochimireddy, Aditya Siripuram, Brad Osgood:
Numerical Stability of DFT Computation for Signals with Structured Support. 3689-3694