Cover Image

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yu, Wenjun, Sun, Yubo, Xu, Zixiang, Ge, Gennian, Schwartz, Moshe
Format:	Preprint
Published:	2025
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sequence Reconstruction under Channels with Multiple Bursts of Insertions or Deletions
by: Lan, Zhaojun, et al.
Published: (2025)

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius
by: Xi, Yuanxiao, et al.
Published: (2025)

On Duplication-Free Codes for Disjoint or Equal-Length Errors
by: Yu, Wenjun, et al.
Published: (2024)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
by: Berend, Hagai, et al.
Published: (2025)

Asymptotically Optimal Codes for $(t,s)$-Burst Error
by: Sun, Yubo, et al.
Published: (2024)

Binary Reconstruction Codes for Correcting One Deletion and One Substitution
by: Li, Yuling, et al.
Published: (2025)

Optimal redundancy of function-correcting codes
by: Ge, Gennian, et al.
Published: (2025)

On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
by: Yu, Wenjun, et al.
Published: (2025)

Codes Correcting Two Bursts of Exactly $b$ Deletions
by: Ye, Zuo, et al.
Published: (2024)

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric
by: Sun, Yubo, et al.
Published: (2024)

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

Correcting Errors Through Partitioning and Burst-Deletion Correction
by: Sun, Yubo, et al.
Published: (2025)

Correcting One Deletion and One Substitution with a Constant Number of Reads
by: Li, Yuling, et al.
Published: (2026)

Criss-Cross Deletion Correcting Codes: Optimal Constructions with Efficient Decoders
by: Sun, Yubo, et al.
Published: (2025)

Private Information Retrieval over Graphs
by: Ge, Gennian, et al.
Published: (2025)

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

Binary Codes for Correcting Two Edits
by: Sun, Yubo, et al.
Published: (2024)

On the Palindromic/Reverse-Complement Duplication Correcting Codes
by: Sun, Yubo, et al.
Published: (2026)

New results on sparse representations in unions of orthonormal bases
by: Zhang, Tao, et al.
Published: (2024)

On the Capacity of Sequences of Coloring Channels
by: Yu, Wenjun, et al.
Published: (2026)

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

Constrained coding upper bounds via Goulden-Jackson cluster theorem
by: Shen, Yuanting, et al.
Published: (2024)

Correcting Bursty/Localized Deletions: A New Error-Position-Estimation Code
by: Ye, Zuo, et al.
Published: (2025)

On the Asymptotic Rate of Optimal Codes that Correct Tandem Duplications for Nanopore Sequencing
by: Yu, Wenjun, et al.
Published: (2024)

Improved Constructions of Skew-Tolerant Gray Codes
by: Himelfarb, Gabriel Sac, et al.
Published: (2024)

Storage codes on coset graphs with asymptotically unit rate
by: Barg, Alexander, et al.
Published: (2022)

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

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

Characterization of $n$-Dimensional Toric and Burst-Error-Correcting Quantum Codes from Lattice Codes
by: Trinca, Cibele Cristina, et al.
Published: (2024)

Near-Optimal List-Recovery of Linear Code Families
by: Li, Ray, et al.
Published: (2025)

Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
by: Wei, Hengjia, et al.
Published: (2024)

On the Maximum Size of Codes Under the Damerau-Levenshtein Metric
by: Ye, Zuo, et al.
Published: (2025)

On the Structure of the Linear Codes with a Given Automorphism
by: Bouyuklieva, Stefka
Published: (2023)

Counterexamples, Constructions, and Nonexistence Results for Optimal Ternary Cyclic Codes
by: Bao, Jingjun, et al.
Published: (2026)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)

Algebraic approach to stability results for Erdős-Ko-Rado theorem
by: Ge, Gennian, et al.
Published: (2024)

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

Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing
by: Wei, Hengjia, et al.
Published: (2024)

The Support Designs of Several Families of Lifted Linear Codes
by: Ding, Cunsheng, et al.
Published: (2024)

On the Coding Capacity of Reverse-Complement and Palindromic Duplication-Correcting Codes
by: Yohananov, Lev, et al.
Published: (2023)