Cover Image

Capacity-Achieving Codes for Noisy Insertion Channels

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Hengfeng, Tang, Chunming, Fan, Cuiling
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes
by: Liu, Hengfeng, et al.
Published: (2025)

Rank Distribution and Dynamics of Gram Matrices from Binary m-Sequences with Applications to LCD Codes
by: Liu, Hengfeng, et al.
Published: (2026)

The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels
by: Wang, Shukai, et al.
Published: (2026)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
by: Liu, Hengfeng, et al.
Published: (2025)

On the Capacity of Insertion Channels for Small Insertion Probabilities
by: Tegin, Busra, et al.
Published: (2025)

Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions
by: Liu, Hengfeng, et al.
Published: (2026)

Capacity Approximations for Insertion Channels with Small Insertion Probabilities
by: Tegin, Busra, et al.
Published: (2024)

Capacity-Region-Achieving Sparse Regression Codes for MIMO Multiple-Access Channels
by: Yan, Hao, et al.
Published: (2026)

On the Capacity of Noisy Frequency-based Channels
by: Gerzon, Yuval, et al.
Published: (2026)

Reed--Muller Codes Achieve the Symmetric Capacity on Finite-State Channels
by: Pfister, Henry D., et al.
Published: (2026)

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

Computability of the Zero-Error Capacity of Noisy Channels
by: Boche, Holger, et al.
Published: (2020)

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

On Codes for the Noisy Substring Channel
by: Yehezkeally, Yonatan, et al.
Published: (2021)

On the Computability of Finding Capacity-Achieving Codes
by: Gkekas, Angelos, et al.
Published: (2025)

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

Coding Schemes for the Noisy Torn Paper Channel
by: Walter, Frederik, et al.
Published: (2026)

Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)

Achieving Gaussian Vector Broadcast Channel Capacity with Scalar Lattices
by: Şener, M. Yusuf, et al.
Published: (2024)

Capacity-Achieving Codes with Inverse-Ackermann-Depth Encoders
by: Li, Yuan
Published: (2025)

Consensus Capacity of Noisy Broadcast Channels
by: Sangwan, Neha, et al.
Published: (2022)

Network Oblivious Transfer via Noisy Channels: Limits and Capacities
by: Aghaee, Hadi, et al.
Published: (2025)

Noisy Sorting Capacity
by: Wang, Ziao, et al.
Published: (2022)

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
by: Mosheiff, Jonathan, et al.
Published: (2024)

Outer Channel of DNA-Based Data Storage: Capacity and Efficient Coding Schemes
by: He, Xuan, et al.
Published: (2023)

Support Size of $\varepsilon$-Capacity-Achieving Inputs for the Amplitude-Constrained AWGN Channel
by: Barletta, Luca, et al.
Published: (2026)

Tensor Reed-Muller Codes: Achieving Capacity with Quasilinear Decoding Time
by: Abbe, Emmanuel, et al.
Published: (2026)

Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding
by: Yao, Xinyuanmeng, et al.
Published: (2026)

LDPC Codes Achieve List Decoding Capacity
by: Mosheiff, Jonathan, et al.
Published: (2019)

Capacity on BMS Channels via Code Symmetry and Nesting
by: Pfister, Henry D., et al.
Published: (2025)

Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs
by: Singhvi, Shubhransh, et al.
Published: (2026)

Quantum Wiretap Channel Coding Assisted by Noisy Correlation
by: Cai, Minglai, et al.
Published: (2024)

Super-Linear Growth of the Capacity-Achieving Input Support for the Amplitude-Constrained AWGN Channel
by: Wang, Haiyang
Published: (2025)

Constructions of locally repairable codes via concatenated codes
by: Jin, Hengfeng, et al.
Published: (2026)

LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws
by: Ouyang, Xu, et al.
Published: (2026)

Sparse Superposition Codes with Binomial Dictionary are Capacity-Achieving with Maximum Likelihood Decoding
by: Takeishi, Yoshinari, et al.
Published: (2025)

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
by: Berman, Amit, et al.
Published: (2024)

Constrained Coding for Composite DNA: Channel Capacity and Efficient Constructions
by: Nguyen, Tuan Thanh, et al.
Published: (2025)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
by: Guo, Zeyu, et al.
Published: (2024)

Deep Learning-Based Detection for Marker Codes over Insertion and Deletion Channels
by: Ma, Guochen, et al.
Published: (2024)