Cover Image

Improved Capacity Upper Bounds for the Deletion Channel using a Parallelized Blahut-Arimoto Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pinto, Martim, Ribeiro, João
Format:	Preprint
Published:	2026
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Gaussian Arimoto-Blahut Algorithm for Capacity Region Calculation of Gaussian Vector Broadcast Channels
by: Jiao, Tian, et al.
Published: (2025)

Revisit the Arimoto-Blahut algorithm: New Analysis with Approximation
by: Fasoulakis, Michail, et al.
Published: (2024)

Bregman-divergence-based Arimoto-Blahut algorithm
by: Hayashi, Masahito
Published: (2024)

A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms
by: He, Kerry, et al.
Published: (2023)

New Algorithms for Computing Sibson Capacity and Arimoto Capacity
by: Kamatsuka, Akira, et al.
Published: (2024)

Characterization of Deletion/Substitution Channel Capacity for Small Deletion and Substitution Probabilities
by: Kazemi, Mohammad, et al.
Published: (2025)

Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)

Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity
by: Zieder, Ian, et al.
Published: (2024)

Capacity Bounds on Doppler OFDM Channels
by: Orellana, Pablo, et al.
Published: (2026)

Capacity Bounds for the Poisson-Repeat Channel
by: Kazemi, Mohammad, et al.
Published: (2024)

A Posteriori Certification Framework for Generalized Quantum Arimoto-Blahut Algorithms
by: Liu, Geng, et al.
Published: (2026)

Improved Johnson-type Bounds for Insertion-Deletion Codes
by: Yang, Yulin
Published: (2026)

New Upper Bounds for Noisy Permutation Channels
by: Feng, Lugaoze, et al.
Published: (2024)

Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel
by: Morozov, Ruslan, et al.
Published: (2025)

An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
by: Baniasadi, Mohammadamin, et al.
Published: (2026)

Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels
by: Barletta, Luca, et al.
Published: (2024)

Stronger Polarization for the Deletion Channel
by: Arava, Dar, et al.
Published: (2023)

The Duality Upper Bound for Finite-State Channels with Feedback
by: Huleihel, Bashar, et al.
Published: (2024)

Capacity Bounds for Broadcast Channels with Bidirectional Conferencing Decoders
by: Farsani, Reza K., et al.
Published: (2024)

Data-Driven Estimation of Capacity Upper Bounds
by: Häger, Christian, et al.
Published: (2022)

Dependence Balance and Capacity Bounds for Multiterminal Communication and Wiretap Channels
by: Gohari, Amin, et al.
Published: (2020)

Multiset Deletion-Correcting Codes: Bounds and Constructions
by: Kreindel, Avraham, et al.
Published: (2026)

Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel
by: Domanovitz, Elad, et al.
Published: (2019)

Function-Correcting Codes for Insertion-Deletion Channel
by: Singh, Anamika, et al.
Published: (2025)

Conditional Entropies of k-Deletion/Insertion Channels
by: Singhvi, Shubhransh, et al.
Published: (2024)

Sequence Reconstruction Problem for Ternary Deletion Channels
by: Wang, Xiang, et al.
Published: (2025)

On the Number of Subsequences in the Nonbinary Deletion Channel
by: Li, Han, et al.
Published: (2026)

Sequence Reconstruction over the Deletion Channel
by: Zhu, Fengxing
Published: (2025)

An Algorithm for Computing the Capacity of Symmetrized KL Information for Discrete Channels
by: Chen, Haobo, et al.
Published: (2024)

Channels with Input-Correlated Synchronization Errors
by: Con, Roni, et al.
Published: (2025)

On The Decoding Error Weight of One or Two Deletion Channels
by: Sabary, Omer, et al.
Published: (2022)

Sequence Reconstruction for the Single-Deletion Single-Substitution Channel
by: Song, Wentu, et al.
Published: (2025)

Error Correcting Codes for Segmented Burst-Deletion Channels
by: Liu, Yajuan, et al.
Published: (2025)

Improved Capacity Outer Bound for Private Quadratic Monomial Computation
by: Dæhli, Karen M., et al.
Published: (2024)

Sequence Reconstruction for Sticky Insertion/Deletion Channels
by: Pham, Van Long Phuoc, et al.
Published: (2025)

Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024)

An Improved Lower Bound on Oblivious Transfer Capacity Using Polarization and Interaction
by: Suda, So, et al.
Published: (2025)

On the Sequence Reconstruction Problem for the Single-Deletion Two-Substitution Channel
by: Song, Wentu, et al.
Published: (2026)

Some New Results on Sequence Reconstruction Problem for Deletion Channels
by: Wang, Xiang, et al.
Published: (2026)

Half-Marker Codes for Deletion Channels with Applications in DNA Storage
by: Haghighat, Javad, et al.
Published: (2025)