Table of Contents

• On the Density of Codes over Finite Chain RingsAnna-Lena Horlemann, Violetta Weger, Nadja Willenborg. 1-6 [doi]
• Linearized Reed-Solomon Codes with Support-Constrained Generator MatrixHedongliang Liu, Hengjia Wei, Antonia Wachter-Zeh, Moshe Schwartz 0001. 7-12 [doi]
• Performance Analysis of Binary Chirp DecodingMahdi Bayanifar, A. Robert Calderbank, Olav Tirkkonen. 13-18 [doi]
• Stability of Bernstein's Characterization of Gaussian Vectors and a Soft Doubling ArgumentMohammad Mahdi Mahvari, Gerhard Kramer. 19-23 [doi]
• An Erasure Queue-Channel with Feedback: Optimal Transmission Control to Maximize CapacityK. Nithin Varma, Krishna P. Jagannathan. 24-29 [doi]
• Information-Theoretic Regret Bounds for Bandits with Fixed Expert AdviceKhaled Eldowa, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli. 30-35 [doi]
• On the Distribution of Partially-Symmetric Codes for Automorphism Ensemble DecodingCharles Pillet, Valerio Bioglio, Pascal Giard. 36-41 [doi]
• Galois Hull Dimensions of Gabidulin CodesHabibul Islam, Anna-Lena Horlemann. 42-46 [doi]
• Hyperbolic Sets in Incomplete TablesJosé Joaquín Bernal, Juan Jacobo Simón. 47-52 [doi]
• An Upper Bound on the Reliability Function of the DMC with or without MismatchAnelia Somekh-Baruch. 53-58 [doi]
• Capacity Bounds for Broadcast Channels with Bidirectional Conferencing DecodersReza Khosravi-Farsani, Wei Yu 0001. 59-63 [doi]
• Goal-Oriented Single-Letter Codes for Lossy Joint Source-Channel CodingPhotios A. Stavrou, Marios Kountouris. 64-69 [doi]
• An Algebraic Attack Against McEliece-like Cryptosystems Based on BCH codesFreja Elbro, Christian Majenz. 70-75 [doi]
• Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low AutocorrelationVladimir Edemskiy, Sofia Koltsova. 76-80 [doi]
• Improved Alpha-Information Bounds for Higher-Order Masked Cryptographic ImplementationsYi Liu, Julien Béguinot, Wei Cheng 0003, Sylvain Guilley, Loïc Masure, Olivier Rioul, François-Xavier Standaert. 81-86 [doi]
• Rate-Distortion in Non-Convex FamiliesHila Ratson, Ram Zamir. 87-91 [doi]
• A Communication Optimal Transport Approach to the Computation of Rate Distortion FunctionsShitong Wu, Wenhao Ye, Hao Wu 0060, Huihui Wu, Wenyi Zhang, Bo Bai 0001. 92-96 [doi]
• Optimal Zero-Error Coding for Computing under Pairwise Shared Side InformationNicolas Charpenay, Maël Le Treust, Aline Roumy. 97-101 [doi]
• Recurrent Variational Information Bottleneck for Time Series Trend PredictionSung-Hyuk Pang, Alban Goupil, Valeriu Vrabie, Loïc Kolodziejczak. 102-106 [doi]
• Minimizing the Outage Probability in a Markov Decision ProcessVincent Corlay, Jean-Christophe Sibel. 107-112 [doi]
• Generalization Properties of Adversarial Training for -ℓ0 Bounded Adversarial AttacksPayam Delgosha, Hamed Hassani, Ramtin Pedarsani. 113-118 [doi]
• Coded Caching with Shared Caches and Private CachesElizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan. 119-124 [doi]
• Cache-Aided Multi-User Private Information Retrieval using PDAsKanishak Vaidya, B. Sundar Rajan. 125-130 [doi]
• A Shared Cache Coded Caching Scheme Using Designs and Circuits of MatricesNiladri Das, B. Sundar Rajan. 131-135 [doi]
• PolarAir: A Compressed Sensing Scheme for Over-the-Air Federated LearningMichail Gkagkos, Krishna R. Narayanan, Jean-François Chamberland, Costas N. Georghiades. 136-141 [doi]
• Permutation Invariant Individual Batch LearningYaniv Fogel, Meir Feder. 142-146 [doi]
• BNNs- and TISTA- Based Signature Code Design for User Identification and Channel Estimation over Multiple-Access Channel with Rayleigh FadingLantian Wei, Shan Lu 0003, Hiroshi Kamabe. 147-152 [doi]
• On Cache-aided Multi-user Private Information Retrieval with Small CachesCharul Rajput, B. Sundar Rajan. 153-158 [doi]
• Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded PlacementK. K. Krishnan Namboodiri, B. Sundar Rajan. 159-164 [doi]
• The Optimal Rate Memory Tradeoff in Multi-Access Coded Caching: Large Cache SizeVijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob. 165-169 [doi]
• Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channelsJoseph M. Renes. 170-174 [doi]
• Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum ChannelsHari Hara Suthan Chittoor, Osvaldo Simeone, Leonardo Banchi, Stefano Pirandola. 175-180 [doi]
• Database Matching Under Adversarial Column DeletionsSerhat Bakirtas, Elza Erkip. 181-185 [doi]
• Construction and Secrecy Gain of Formally Unimodular Lattices in Odd DimensionsMaiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus. 186-191 [doi]
• Secure Distributed Gram Matrix MultiplicationOkko Makkonen, Camilla Hollanti. 192-197 [doi]
• The Secrecy Capacity of Gaussian Wiretap Channels with Rate-Limited Help at the EncoderSergey Loyka, Neri Merhav. 198-202 [doi]
• Upper Bounds on the Distillable Randomness of Bipartite Quantum StatesLudovico Lami, Bartosz Regula, Xin Wang 0022, Mark M. Wilde. 203-208 [doi]
• Performance of Uncoded Implementation of Grover's Algorithm on Today's Quantum ProcessorsYunos El Kaderi, Andreas Honecker, Iryna Andriyanova. 209-214 [doi]
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check MatricesSisi Miao, Alexander Schnerring, Haizheng Li, Laurent Schmalen. 215-220 [doi]
• Secure Over-the-Air Computation Using Zero-Forced Artificial NoiseLuis Maßny, Antonia Wachter-Zeh. 221-226 [doi]
• Group-Testing Aggregate Entity AuthenticationShoichi Hirose, Junji Shikata. 227-231 [doi]
• Active User Identification in Fast Fading Massive Random Access ChannelsJyotish Robin, Elza Erkip. 232-237 [doi]
• Improved decoding of symmetric rank metric errorsAlain Couvreur. 238-242 [doi]
• Generic Decoding in the Cover MetricSebastian Bitzer, Julian Renner, Antonia Wachter-Zeh, Violetta Weger. 243-247 [doi]
• Generalized low rank parity check codesErmes Franch, Philippe Gaborit, Chunlei Li 0001. 248-253 [doi]
• A constructive approach to multimedia codes with complete traceability resistant to δ-noiseMarcel Fernandez, Grigory Kabatiansky, Sebastià Martín, Cédric Tavernier. 254-259 [doi]
• Retractable Commitment over Noisy ChannelsRémi A. Chou, Matthieu R. Bloch. 260-265 [doi]
• Covert Communication over Two Types of Additive Noise ChannelsCécile Bouette, Laura Luzzi, Ligong Wang. 266-271 [doi]
• Error Exponents of the Dirty-Paper and Gel'fand-Pinsker ChannelsRan Tamir, Neri Merhav. 272-276 [doi]
• Testing Against Independence with an EavesdropperSara Faour, Mustapha Hamad, Mireille Sarkiss, Michèle A. Wigger. 277-282 [doi]
• Concentration Properties of Generalized Random Gilbert-Varshamov CodesLan V. Truong, Albert Guillén i Fàbregas. 283-287 [doi]
• Lossy Compression via Sparse Regression Codes: An Approximate Message Passing ApproachHuihui Wu, Wenjie Wang 0001, Shansuo Liang, Wei Han 0004, Bo Bai 0001. 288-293 [doi]
• Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant ModelsYizhou Xu, Tianqi Hou, Shansuo Liang, Marco Mondelli. 294-298 [doi]
• Towards Convergent Approximate Message Passing by Alternating Constrained Minimization of Bethe Free EnergyChristo Kurisummoottil Thomas, Zilu Zhao, Dirk Slock. 299-304 [doi]
• Bidirectional Piggybacking Design for All Nodes with Sub-Packetization l = rKe Wang, Zhifang Zhang. 305-310 [doi]
• New Construction of (k + r,k) Systematic MDS Array Codes with r ≤ 4Zhe Zhai, Qifu Tyler Sun, Sheng Jin, Shaoteng Liu, Xiangyu Chen. 311-316 [doi]
• Multichannel Dual Codes: The Choice of Channels Carries InformationHoover H. F. Yin, Xishi Wang. 317-322 [doi]
• Compressed sensing with ℓ0-norm: statistical physics analysis & algorithms for signal recoveryD. Barbier, Carlo Lucibello, Luca Saglietti, Florent Krzakala, Lenka Zdeborová. 323-328 [doi]
• A Generalization of the Equal Coding TheoremHui-An Shen, Stefan M. Moser, Jean-Pascal Pfister. 329-334 [doi]
• Shrinkage Coefficient Estimation for Regularized Tyler's M-Estimator: A Leave One Out ApproachKarim T. Abou-Moustafa. 335-340 [doi]
• Code at the Receiver, Decode at the Sender: GRAND with FeedbackJoseph Griffin, Peihong Yuan, Petar Popovski, Ken R. Duffy, Muriel Médard. 341-346 [doi]
• Duality and LP Bounds for Codes with LocalityAnina Gruica, Benjamin Jany, Alberto Ravagnani. 347-352 [doi]
• Deterministic K-Identification For Slow Fading ChannelsMuris Spahovic, Mohammad Javad Salariseddigh, Christian Deppe. 353-358 [doi]
• Improved Bounds For Efficiently Decodable Probabilistic Group Testing With Unreliable ItemsSarthak Jain, Martina Cardone, Soheil Mohajer. 359-364 [doi]
• Gradient flow on extensive-rank positive semi-definite matrix denoisingAntoine Bodin, Nicolas Macris. 365-370 [doi]
• On Non-Interactive Source Simulation via Fourier TransformFarhad Shirani 0001, Mohsen Heidari. 371-376 [doi]
• Achievable Information Rates and Concatenated Codes for the DNA Nanopore Sequencing ChannelIssam Maarouf, Eirik Rosnes, Alexandre Graell i Amat. 377-382 [doi]
• Index-Based Concatenated Codes for the Multi-Draw DNA Storage ChannelLorenz Welter, Issam Maarouf, Andreas Lenz, Antonia Wachter-Zeh, Eirik Rosnes, Alexandre Graell i Amat. 383-388 [doi]
• Bounds on Mixed Codes with Finite AlphabetsYonatan Yehezkeally, Haider Al Kim, Sven Puchinger, Antonia Wachter-Zeh. 389-394 [doi]
• Sparse NOMA: An Achievable Region via Random Coordinate TransformationsBenjamin M. Zaidel, Chen Eger, Shlomo Shamai Shitz. 395-400 [doi]
• Multi-User Privacy Mechanism Design with Non-zero LeakageAmirreza Zamani, Tobias J. Oechtering, Mikael Skoglund. 401-405 [doi]
• Fundamental Limits of Distributed Optimization over Multiple Access ChannelShubham K. Jha, Prathamesh Mayekar. 406-411 [doi]
• Rate-Adaptive Protograph MacKay-Neal CodesAyman Zahr, Balázs Matuz, Gianluigi Liva. 412-417 [doi]
• Average Probability of Error for Single Uniprior Index Coding over Rayleigh Fading ChannelAnjana Ambika Mahesh, Charul Rajput, Bobbadi Rupa, B. Sundar Rajan. 418-423 [doi]
• Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder CodesMatteo Abbondati, Antoine Afflatet, Eleonora Guerrini, Romain Lebreton. 424-429 [doi]
• On the State Estimation Error of "Beam-Pointing" Channels: The Binary CaseSiyao Li, Giuseppe Caire. 430-434 [doi]
• A modified probabilistic amplitude shaping scheme to use sign-bit-like shaping with a BICMVincent Corlay, Hamidou Dembélé. 435-439 [doi]
• Robustness of Massive MIMO to Location and Phase ErrorsElham Anarakifirooz, Sergey Loyka. 440-444 [doi]
• Age of Information with On-Off ServiceAshirwad Sinha, Praful D. Mankar, Nikolaos Pappas 0001, Harpreet S. Dhillon. 445-450 [doi]
• Coding Gain for Age of Information in a Multi-source System with Erasure ChannelShubhransh Singhvi, Praful D. Mankar. 451-456 [doi]
• Channel Estimation and Data Detection in MIMO channels with 1-bit ADC using Probit RegressionKhodor Safa, Raul de Lacerda, Sheng Yang. 457-461 [doi]
• Sequential Joint Communication and Sensing of Fixed Channel StatesMeng-Che Chang, Shi-Yuan Wang, Matthieu R. Bloch. 462-467 [doi]
• Coded Computation of Multiple FunctionsWilton Kim, Stanislav Kruglik, Han Mao Kiah. 468-473 [doi]
• Coded Distributed Computing for Sparse Functions With Structured SupportFederico Brunero, Kai Wan, Giuseppe Caire, Petros Elia. 474-479 [doi]
• Coded Distributed Computing for Hierarchical Multi-task LearningHaoyang Hu, Songze Li, Minquan Cheng, Youlong Wu. 480-485 [doi]
• State Estimation Entropy for Two-State Markov Sources in Slotted ALOHA Random Access ChannelsGiuseppe Cocco, Andrea Munari, Gianluigi Liva. 486-491 [doi]
• Entropy Rate Bounds of Integer-Valued Processes via Second-Order StatisticsRan Tamir. 492-496 [doi]
• Truly Bayesian Entropy EstimationIoannis Papageorgiou, Ioannis Kontoyiannis. 497-502 [doi]
• Asymmetric tree correlation testing for graph alignmentJakob Maier, Laurent Massoulié. 503-508 [doi]
• Multi-User Distributed Computing Via Compressed SensingAli Khalesi, Sajad Daei, Marios Kountouris, Petros Elia. 509-514 [doi]
• Optimal Fault-Tolerant Data Fusion in Sensor Networks: Fundamental Limits and Efficient AlgorithmsMarian Temprana Alonso, Farhad Shirani 0001, S. Sitharama Iyengar. 515-520 [doi]
• Channel Codes for Relayless Networks with General Message Access StructureJun Muramatsu. 521-525 [doi]
• The Role of the Alphabet in Network Coding: An Optimization ApproachChristopher Hojny, Altan Berdan Kilic, Alberto Ravagnani. 526-531 [doi]
• Transfer Learning for Quantum Classifiers: An Information-Theoretic Generalization AnalysisSharu Theresa Jose, Osvaldo Simeone. 532-537 [doi]
• A Combinatorial Proof for the Dowry ProblemXujun Liu, Olgica Milenkovic, George V. Moustakides. 538-543 [doi]
• Bounds and Algorithms for Frameproof Codes and Related Combinatorial StructuresMarco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro. 544-549 [doi]