Maximal input entropy for binary two-deletion and two-insertion channels
cs.IT, cs.FL, math.CO, math.IT
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- Conditional Entropies of k-Deletion/Insertion Channels
- From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions
- A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics
- Enumerating binary words restricted by subsequence frequency
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound