:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Yang, Yulin
Format:	Preprint
Published:	2026
Subjects:	Information Theory Combinatorics
Online Access:	https://arxiv.org/abs/2605.25090
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)

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

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

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

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
by: Schaller, Michael, et al.
Published: (2025)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)

Improved Constructions of Linear Codes for Insertions and Deletions
by: Gross, Roee, et al.
Published: (2025)

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

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

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)

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)

The Random Subsequence Model and Uniform Codes for the Deletion Channel
by: Jeong, Ryan, et al.
Published: (2026)

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
by: Zhao, Ziyang, et al.
Published: (2026)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2021)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)

Two-Insertion/Deletion/Substitution Correcting Codes
by: Pi, Yuhang, et al.
Published: (2024)

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

New Correlation Bound and Construction of Quasi-Complementary Code Sets
by: Sarkar, Palash, et al.
Published: (2022)

Insertion Correcting Capability for Quantum Deletion-Correcting Codes
by: Nakamura, Ken, et al.
Published: (2026)

Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction
by: Sun, Yubo, et al.
Published: (2025)

Bounds on MLDR Codes Over ${\mathbb Z}_{p^t}$
by: Alderson, Tim L.
Published: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
by: Alrabiah, Omar, et al.
Published: (2024)

Schubert Subspace Codes
by: Alfarano, Gianira N., et al.
Published: (2024)

Amortized Locally Decodable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2025)

Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)

Efficient Decoding of Insertion and Deletion Errors for Helberg Codes
by: Segrest, Anthony, et al.
Published: (2025)

Polynomials, Divided Differences, and Codes
by: Venkitesh, S.
Published: (2024)

The Eigenvalue Method in Coding Theory
by: Abiad, Aida, et al.
Published: (2025)

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
by: Con, Roni, et al.
Published: (2023)

Rank-metric codes over arbitrary fields: Bounds and constructions
by: Neri, Alessandro, et al.
Published: (2026)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
by: Li, Xin, et al.
Published: (2024)

Intersecting Codes and the Connectivity of $q$-Matroids
by: Conca, Fabrizio, et al.
Published: (2026)

Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes
by: Sasaki, Koki, et al.
Published: (2026)

$t$-Balanced Codes with the Kendall-$τ$ Metric
by: Jany, Benjamin, et al.
Published: (2024)

The Service Rate Region of Hamming Codes
by: Choudhary, Priyanka, et al.
Published: (2025)

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

Binary Caps and LCD Codes with Large Dimensions
by: Ishizuka, Keita, et al.
Published: (2026)