Table of Contents

• Optimal Rate-Exponent Region for a Class of Hypothesis Testing Against Conditional Independence ProblemsAbdellatif Zaidi, Inaki Estella Aguerri. 1-5 [doi]
• New Bounds for GLD Lattices and CodesMaiara F. Bollauf, Joseph J. Boutros, Nordine Mir. 1-5 [doi]
• Generic Variance Bounds on Estimation and Prediction Errors in Time Series Analysis: An Entropy PerspectiveSong Fang, Mikael Skoglund, Karl Henrik Johansson, Hideaki Ishii, Quanyan Zhu. 1-5 [doi]
• A Refined Scaling Law for Spatially Coupled LDPC Codes Over the Binary Erasure ChannelRoman Sokolovskii, Fredrik Brännström, Alexre Graell i Amat. 1-5 [doi]
• Purely Quantum Polar CodesFrédéric Dupuis, Ashutosh Goswami, Mehdi Mhalla, Valentin Savin. 1-5 [doi]
• Relative Age of Information: A New Metric for Status Update SystemsPeng Zou, Omur Ozel, Suresh Subramaniam. 1-5 [doi]
• Spatially Coupled LDPC Codes with Non-uniform Coupling for Improved Decoding SpeedLaurent Schmalen, Vahid Aref. 1-5 [doi]
• A Tight Upper Bound on Mutual InformationMichal Hledík, Thomas R. Sokolowski, Gasper Tkacik. 1-5 [doi]
• New Upper Bounds on the Capacity of Primitive Diamond Relay ChannelsXiugang Wu, Ayfer Özgür, Michael Peleg, Shlomo Shamai Shitz. 1-5 [doi]
• On The Sample Complexity of HGR Maximal Correlation FunctionsShao-Lun Huang, Xiangxiang Xu 0001. 1-5 [doi]
• On the Capacity of Private Nonlinear Computation for Replicated DatabasesSarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer. 1-5 [doi]
• Capacity Results for Erasure Broadcast Channels with Intermittent FeedbackAlireza Vahid, I-Hsiang Wang, Shih-Chun Lin. 1-5 [doi]
• On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial ServersLukas Holzbaur, Ragnar Freij-Hollanti, Camilla Hollanti. 1-5 [doi]
• Neural Decoder for Topological Codes using Pseudo-Inverse of Parity Check MatrixChaitanya Chinni, Abhishek Kulkami, Dheeraj M. Pai, Kaushik Mitra, Pradeep Kiran Sarvepalli. 1-5 [doi]
• Sparse Graph Codes for Non-adaptive Quantitative Group TestingEsmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh, Krishna R. Narayanan, Alex Sprintson. 1-5 [doi]
• Transforming an arbitrary code for the wiretap channel of type I into a code for the wiretap channel of type IIEric Graves, Allison Beemer. 1-5 [doi]
• Distributed Detection with Empirically Observed StatisticsHaiyun He, Lin Zhou 0002, Vincent Y. F. Tan. 1-5 [doi]
• A Mismatched Decoding Perspective of Channel Output QuantizationMehdi Dabirnia, Alfonso Martinez, Albert Guillén i Fàbregas. 1-4 [doi]
• Learning and Adaptive Data Analysis via Maximal LeakageAmedeo Roberto Esposito, Michael Gastpar, Ibrahim Issa. 1-5 [doi]
• Sequential Classification with Empirically Observed StatisticsMahdi Haghifam, Vincent Y. F. Tan, Ashish Khisti. 1-5 [doi]
• Preserving ON-OFF Privacy for Past and Future RequestsFangwei Ye, Carolina Naim, Salim El Rouayheb. 1-5 [doi]
• Density Evolution Analysis of Partially Information Coupled Turbo Codes on the Erasure ChannelMin Qiu 0001, Xiaowei Wu, Yixuan Xie, Jinhong Yuan. 1-5 [doi]
• LDPC Code Design for Delayed Bit-Interleaved Coded ModulationYihuan Liao, Lei Yang, Jinhong Yuan, Kechao Huang, Raymond W. K. Leung, Junyi Du. 1-5 [doi]
• On Enhancing the Fixed Block-Length Coding Scheme for Joint source-channel communicationArun Padakandla. 1-5 [doi]
• Forward Reconciliation for Covert Key GenerationIshaque Ashar Kadampot, Matthieu R. Bloch. 1-5 [doi]
• On the Information-Theoretic Limits of Noisy Sparse Phase RetrievalLan V. Truong, Jonathan Scarlett. 1-5 [doi]
• Interval Algorithm for Random Number Generation: Information Spectrum ApproachShun Watanabe, Te Sun Han. 1-5 [doi]
• Improved List Decoding of Polar Codes by Shifted-pruningMohammad Rowshan, Emanuele Viterbo. 1-5 [doi]
• SC-Flip Decoding of Polar Codes with High Order Error Correction Based on Error DependencyCarlo Condo, Valerio Bioglio, Ingmar Land. 1-5 [doi]
• The Additive Noise Channel with a HelperShraga I. Bross, Amos Lapidoth. 1-5 [doi]
• Non-malleable Coding for Arbitrary Varying ChannelsFuchun Lin, San Ling, Reihaneh Safavi-Naini, Huaxiong Wang. 1-5 [doi]
• Enhanced Quasi-Maximum Likelihood Decoding of Short LDPC Codes Based on SaturationPeng Kang 0001, Yixuan Xie, Lei Yang 0027, Chen Zheng, Jinhong Yuan, Yuejun Wei. 1-5 [doi]
• The Metagenomic Binning Problem: Clustering Markov SequencesGrant Greenberg, Ilan Shomorony. 1-5 [doi]
• Closed-Form Expression for the Average Age of Information in a Multi-Source M/G/1 Queueing ModelMohammad Moltafet, Markus Leinonen, Marian Codreanu. 1-5 [doi]
• Degree Tables for Secure Distributed Matrix MultiplicationRafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk. 1-5 [doi]
• Private Authentication with Physical Identifiers Through Broadcast Channel MeasurementsOnur Günlü, Rafael F. Schaefer, Gerhard Kramer. 1-5 [doi]
• Coordination via Shared RandomnessGowtham R. Kurri, Vinod M. Prabhakaran. 1-5 [doi]
• Context Aware Laplacian Mechanism for Local Information PrivacyMohamed Seif, Ravi Tandon, Ming Li. 1-5 [doi]
• A Field-Size Independent Code Construction for Groupcast Index Coding ProblemsMahesh Babu Vaddi, B. Sundar Rajan. 1-5 [doi]
• Optimal Broadcast Rate of a Class of Two-Sender Unicast Index Coding ProblemsChinmayananda Arunachala, Vaneet Aggarwal, B. Sundar Rajan. 1-5 [doi]
• On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable CodesSwanand Kadhe, Anoosheh Heidarzadeh, Alex Sprintson, Onur Ozan Koyluoglu. 1-5 [doi]
• Construction of binary polarization kernels for low complexity window processingGrigorii Trofimiuk, Peter Trifonov. 1-5 [doi]
• Error Exponents of Typical Random Codes of Source-Channel CodingRan Averbuch, Neri Merhav. 1-5 [doi]
• Channel Ordering and SupermodularityArthur Américo, Pasquale Malacaria, M. H. R. Khouzani. 1-5 [doi]
• Codebooks of Complex Lines Based on Binary Subspace ChirpsOlav Tirkkonen, A. Robert Calderbank. 1-5 [doi]
• Anonymity Mixes as (Partial) Assembly Queues: Modeling and AnalysisMehmet Fatih Aktas, Emina Soljanin. 1-5 [doi]
• Differential Power Analysis Attacks from an Information-Theoretic PerspectiveAndrea Grigorescu, Holger Boche. 1-5 [doi]
• Non-Colluding Attacks Identification in Distributed ComputingAtnav Solanki, Martina Cardone, Soheil Mohajer. 1-5 [doi]
• Improved Storage for Efficient Private Information RetrievalKarim Banawan, Batuhan Arasli, Sennur Ulukus. 1-5 [doi]
• Empirical Coordination Subject to a Fidelity CriterionMichail Mylonakis, Photios A. Stavrou, Mikael Skoglund. 1-5 [doi]
• Secrecy Capacity of a Gaussian Wiretap Channel with One-bit ADCs is Always PositiveSeung-Hyun Nam, Si-Hyeon Lee. 1-5 [doi]
• Coded Trace ReconstructionMahdi Cheraghchi, João L. Ribeiro 0001, Ryan Gabrys, Olgica Milenkovic. 1-5 [doi]
• Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing SchemesReo Eriguchi, Noboru Kunihiro. 1-5 [doi]
• Private Information DeliveryHua Sun. 1-5 [doi]
• Private Authentication: Optimal Information Theoretic SchemesNarges Kazempour, Mahtab Mirmohseni, Mohammad Reza Aref. 1-5 [doi]
• Improved decoding of second-order Reed-Muller codesKirill Ivanov, Rüdiger L. Urbanke. 1-5 [doi]
• On the Fundamental Limit of Coded Caching Systems with a Single Demand TypeShuo Shao, Jesús Gomicronmez-Vilardebomicron, Kai Zhang, Chao Tian. 1-5 [doi]
• An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary ErasuresElad Domanovitz, Silas L. Fong, Ashish Khisti. 1-5 [doi]
• Can Marton Coding Alone Ensure Individual Secrecy?Jin Yeong Tan, Lawrence Ong, Behzad Asadi. 1-5 [doi]
• Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed LearningRawad Bitar, Mary Wootters, Salim El Rouayheb. 1-5 [doi]
• Private Pliable Index CodingTang Liu 0002, Daniela Tuninetti. 1-5 [doi]
• Capacity of Quantum Private Information Retrieval with Collusion of All But One of ServersSeunghoan Song, Masahito Hayashi. 1-5 [doi]
• Source coding with side information for binary memoryless sourcesIrina E. Bocharova, Boris D. Kudryashov. 1-5 [doi]
• Invariance pressure for linear discrete-time systemsFritz Colonius, João A. N. Cossich, Alexandre J. Santana. 1-4 [doi]
• Fixed-Length Strong CoordinationGiulia Cervia, Tobias J. Oechtering, Mikael Skoglund. 1-5 [doi]
• A New Importance Sampling Algorithm for Fast Simulation of Linear Block Codes over BSCsJinzhe Pan, Wai Ho Mow. 1-5 [doi]
• Coordination Coding with Causal Decoder for Vector-valued Witsenhausen Counterexample SetupsTobias J. Oechtering, Maël Le Treust. 1-5 [doi]
• Mutual Information for Low-Rank Even-Order Symmetric Tensor FactorizationJean Barbier, Clément Luneau, Nicolas Macris. 1-5 [doi]
• Partially Information Coupled Bit-Interleaved Polar Coded Modulation for 16-QAMXiaowei Wu, Jinhong Yuan. 1-5 [doi]
• Intrinsic Randomness Problem with Respect to a Subclass of f-divergenceRyo Nomura. 1-5 [doi]
• Coding for Crowdsourced Classification with XOR QueriesJames Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan. 1-5 [doi]
• Capacity of Wideband Multipath Fading Networks with Physically Degraded BroadcastDiana Cristina González, Salman Salamatian, Muriel Médard, Michel Daoud Yacoub. 1-5 [doi]
• On Optimal Jamming in Strategic CommunicationEmrah Akyol. 1-5 [doi]
• Improved Private Information Retrieval for Coded Storage From Code Decomposition : (Invited Paper)Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat. 1-5 [doi]
• Secure Caching and Delivery for Combination Networks with Asymmetric ConnectivityAhmed A. Zewail, Aylin Yener. 1-5 [doi]
• On Characterization of Entropic Vectors at the Boundary of Almost Entropic ConesHitika Tiwari, Satyajit Thakor. 1-5 [doi]
• Guesswork for Inference in Machine Translation with Seq2seq ModelLitian Liu, Derya Malak, Muriel Médard. 1-5 [doi]
• Mismatched Guesswork and One-to-One CodesSalman Salamatian, Litian Liu, Ahmad Beirami, Muriel Médard. 1-5 [doi]
• Gabidulin Codes with Support ConstraintsHikmet Yildiz, Babak Hassibi. 1-5 [doi]
• Age of Information for Updates with DistortionMelih Bastopcu, Sennur Ulukus. 1-5 [doi]
• Achievable Rate-Distortion Region for Robust Distributed Source CodingArun Padakandla. 1-5 [doi]
• A Modular Semantically Secure Wiretap Code with Shared Key for Weakly Symmetric ChannelsSetareh Sharifian, Reihaneh Safavi-Naini. 1-5 [doi]
• On the Outage-Constrained Rate of Skip-Sliding Window CodesTing-Yi Wu, Anshoo Tandon, Mehul Motani, Lav R. Varshney. 1-5 [doi]
• On the Upload versus Download Cost for Secure and Private Matrix MultiplicationWei-Ting Chang, Ravi Tandon. 1-5 [doi]
• Trellis-based Decoding Techniques for Polar Codes with Large KernelsPeter Trifonov. 1-5 [doi]
• On the Nonasymptotic Performance of Variable-Length Codes with Noisy Stop FeedbackJohan Östman, Rahul Devassy, Giuseppe Durisi, Erik G. Ström. 1-5 [doi]
• Weakly Secure Symmetric Multilevel Diversity CodingTao Guo, Chao Tian, Tie Liu, Raymond W. Yeung. 1-5 [doi]
• On The Stability Region of the Layered Packet Erasure Broadcast Channel with Output FeedbackSiyao Li, Hulya Seferoglu, Daniela Tuninetti, Natasha Devroye. 1-5 [doi]
• Properties of the Conditional Mean Estimator in Poisson NoiseAlex Dytso, H. Vincent Poor. 1-5 [doi]
• Estimation of Bounded Normal Mean: An Alternative Proof for the Discreteness of the Least Favorable PriorSemih Yagli, Alex Dytso, H. Vincent Poor. 1-5 [doi]
• Embedded Index CodingAlexandra Porter, Mary Wootters. 1-5 [doi]
• Covariance Evolution for Spatially "Mt. Fuji" Coupled LDPC CodesYuta Nakahara, Toshiyasu Matsushima. 1-5 [doi]
• Capacity Results for Discrete Memoryless Channels in the Finite Blocklength RegimeYasutada Oohama. 1-5 [doi]
• Multiple Access Channels with Byzantine UsersNeha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran. 1-5 [doi]
• Reconstruction and Error-Correction Codes for Polymer-Based Data StorageSrilakshmi Pattabiraman, Ryan Gabrys, Olgica Milenkovic. 1-5 [doi]
• Channel Coding at Low CapacityMohammad Fereydounian, Mohammad Vahid Jamali, Hamed Hassani, Hessam Mahdavifar. 1-5 [doi]
• A New Family of Constrained Codes with Applications in Data StorageAhmed Hareedy, A. Robert Calderbank. 1-5 [doi]
• An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary ErasuresDamian Dudzicz, Silas L. Fong, Ashish Khisti. 1-5 [doi]
• Second-Order Asymptotics of the Continuous-Time Poisson ChannelYuta Sakai, Mladen Kovacevic 0001, Vincent Y. F. Tan. 1-5 [doi]
• Design of Guruswami-Sudan List Decoding for Elliptic CodesYunqi Wan, Li Chen, Fangguo Zhang. 1-5 [doi]
• On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic FieldsChristian Porter, Shanxiang Lyu, Cong Ling 0001. 1-5 [doi]
• On Error Decoding of Locally Repairable and Partial MDS CodesLukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh. 1-5 [doi]
• Collaborative Decoding of Polynomial Codes for Distributed ComputationAdarsh M. Subramaniam, Anoosheh Heidarzadeh, Krishna R. Narayanan. 1-5 [doi]
• Mixed Delay Constraints on a Fading C-RAN UplinkHoma Nikbakht, Michele A. Wigger, Walid Hachem, Shlomo Shamai Shitz. 1-5 [doi]
• Channel Resolvability with a Full-Duplex Decode-and-Forward RelayNoha Helal, Matthieu Bloch, Aria Nosratinia. 1-5 [doi]
• On Code Design for Wireless Channels with Additive Radar InterferenceFederico Brunero, Daniela Tuninetti, Natasha Devroye. 1-5 [doi]
• On the Structure of the Capacity Formula for General Finite State Channels with ApplicationsHolger Boche, Rafael F. Schaefer, H. Vincent Poor. 1-5 [doi]
• On Designing Probabilistic Supports to Map the Entropy RegionJohn MacLaren Walsh, Alexander Erick Trofimoff. 1-5 [doi]
• Centralized Coded Caching with User CooperationJiahui Chen, Haoyu Yin, Xiaowen You, Yanlin Geng, Youlong Wu. 1-5 [doi]
• Keyless Covert Communication in the Presence of Non-causal Channel State InformationHassan ZivariFard, Matthieu Bloch, Aria Nosratinia. 1-5 [doi]
• Successive-Cancellation Decoding of Linear Source CodeJun Muramatsu. 1-5 [doi]
• Coded Caching with Optimized Shared-Cache SizesEmanuele Parrinello, Petros Elia. 1-5 [doi]
• Multi-access coded caching: gains beyond cache-redundancyBerksan Serbetci, Emanuele Parrinello, Petros Elia. 1-5 [doi]
• Some Results on Distributed Source Simulation with no CommunicationTomer Berg, Ofer Shayevitz, Young-Han Kim 0001, Lele Wang 0001. 1-5 [doi]
• Bidirectional Information Flow and the Roles of Privacy Masks in Cloud-Based ControlAli Reza Pedram, Takashi Tanaka, Matthew Hale. 1-5 [doi]
• Iterative Programming of Noisy Memory CellsMichal Horovitz, Eitan Yaakobi, Eyal En Gad, Jehoshua Bruck. 1-5 [doi]
• From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple EquationAli Dehghan 0001, Amir H. Banihashemi. 1-5 [doi]
• Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based CodesAhmed Hareedy, Rohith Kuditipudi, A. Robert Calderbank. 1-5 [doi]
• Dynamics of Damped Approximate Message Passing AlgorithmsKazushi Mimura, Jun'ichi Takeuchi. 1-5 [doi]
• Spatially Coupled Sparse Regression Codes with Sliding Window AMP DecodingCynthia Rush, Kuan Hsieh, Ramji Venkataramanan. 1-5 [doi]
• On the Minrank of Symmetric and Neighboring Side-information Index Coding ProblemsMahesh Babu Vaddi, B. Sundar Rajan. 1-5 [doi]
• Block Source Coding with Sequential EncodingHamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, Mikael Skoglund. 1-5 [doi]
• Practical Universal Data Exchange using Polar CodesSoumya Subhra Banerjee, Himanshu Tyagi. 1-5 [doi]
• Relaxed Wyner's Common InformationMichael Gastpar, Erixhen Sula. 1-5 [doi]
• Optimizing Polar Codes Compatible with Off-the-Shelf LDPC DecodersMoustafa Ebada, Ahmed Elkelesh, Stephan ten Brink. 1-5 [doi]
• Rate loss in the Gaussian CEO problemVictoria Kostina. 1-5 [doi]
• Coding for Non-IID Sources and Channels: Entropic Approximations and a Question of AhlswedeHolger Boche, Rafael F. Schaefer, H. Vincent Poor. 1-5 [doi]
• A Finite-Length Construction of Irregular Spatially-Coupled CodesHoma Esfahanizadeh, Ruiyi Wu, Lara Dolecek. 1-5 [doi]
• Error Exponents of Typical Random Trellis CodesNeri Merhav. 1-5 [doi]
• Zero-Error Capacity of Multiple Access Channels via Nonstochastic InformationGhassen Zafzouf, Girish N. Nair, Jamie S. Evans. 1-5 [doi]
• On the Fundamental Limits of Cooperative Multiple-Access Channels with Distributed CSITLorenzo Miretti, Paul de Kerret, David Gesbert. 1-5 [doi]
• Small stopping sets in projective low-density parity-check codesYuichiro Fujiwara, Yu Tsunoda. 1-5 [doi]
• Rate-Flexible Fast Polar DecodersSeyyed Ali Hashemi, Carlo Condo, Marco Mondelli, Warren J. Gross. 1-5 [doi]
• Benefits of Coding on Age of Information in Broadcast NetworksXingran Chen, Shirin Saeedi Bidokhti. 1-5 [doi]
• Deep Learning Assisted Sum-Product Detection Algorithm for Faster-than-Nyquist SignalingBryan Liu, Shuangyang Li, Yixuan Xie, Jinhong Yuan. 1-5 [doi]
• On Secure Capacity of Multiple Unicast Traffic over Separable NetworksGaurav Kumar Agarwal, Martina Cardone, Christina Fragouli. 1-5 [doi]
• Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin CodesHannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde. 1-5 [doi]
• Coded Distributed Computing: Performance Limits and Code DesignsMohammad Vahid Jamali, Mahdi Soleymani, Hessam Mahdavifar. 1-5 [doi]
• Coset Probability Based Majority-logic Decoding for Non-binary LDPC CodesV. B. Wijekoon, Shuiyin Liu, Emanuele Viterbo, Yi Hong 0001, Rino Micheloni, Alessia Marelli. 1-5 [doi]
• On the continuity of the invariance entropy for hyperbolic linear control systems on Lie groupsAdriano Da Silva. 1-5 [doi]
• Secrecy and Error Exponents of k-Transmitter Multiple Access Wire-tap ChannelMasahito Hayashi, Yanling Chen. 1-5 [doi]
• On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large GirthAli Dehghan 0001, Amir H. Banihashemi. 1-5 [doi]
• An Upper Bound on the Capacity of the DNA Storage ChannelAndreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh, Eitan Yaakobi. 1-5 [doi]
• Multi-library Coded Caching with Partial SecrecyMireille Sarkiss, Michèle A. Wigger. 1-5 [doi]
• Endurance-Limited Memories with Informed DecoderYeow Meng Chee, Michal Horovitz, Alexander Vardy, Van Khu Vu, Eitan Yaakobi. 1-5 [doi]
• optimization of Nested Array-based LDPC Codes Via Spatial CouplingSalman Habib, David G. M. Mitchell, Jörg Kliewer. 1-5 [doi]
• Random Coding Error Exponent for the Bee-Identification ProblemAnshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney. 1-5 [doi]
• A Submodularity-based Clustering Algorithm for the Information Bottleneck and Privacy FunnelNi Ding, Parastoo Sadeghi. 1-5 [doi]
• *Christoph Kawan, Serdar Yüksel. 1-5 [doi]