Cover Image

Sequence Reconstruction over the Deletion Channel

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Zhu, Fengxing
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 for Sticky Insertion/Deletion Channels
by: Pham, Van Long Phuoc, et al.
Published: (2025)

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

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

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

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

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
by: Yu, Wenjun, et al.
Published: (2025)

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

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

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

Sequence Reconstruction under Channels with Multiple Bursts of Insertions or Deletions
by: Lan, Zhaojun, 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)

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

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

Maximum Percolation Time on the q-ary Hypercube
by: Zhu, Fengxing
Published: (2025)

Bootstrap percolation on a generalized Hamming cube
by: Zhu, Fengxing
Published: (2024)

Generalized Orthogonal de Bruijn and Kautz Sequences
by: Chen, Yuan-Pon, et al.
Published: (2025)

The Time of Bootstrap Percolation in High Dimensions
by: Zhu, Fengxing
Published: (2025)

Bootstrap percolation on a generalized Hamming cube \MakeUppercase{\romannumeral 2}
by: Zhu, Fengxing
Published: (2025)

Symmetric Tensor Decompositions over Finite Fields
by: Cotardo, Giuseppe, et al.
Published: (2026)

On the stabilizer of the graph of linear functions over finite fields
by: Smaldore, Valentino, et al.
Published: (2024)

Belief-Combining Framework for Multi-Trace Reconstruction over Channels with Insertions, Deletions, and Substitutions
by: Nouri, Aria
Published: (2026)

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

Authenticated partial correction over AV-MACs: toward characterization and coding
by: Koepke, Duncan, et al.
Published: (2024)

Sequence Reconstruction over Coloring Channels for Protein Identification
by: Bariffi, Jessica, et al.
Published: (2025)

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)

Log-Concave Sequences in Coding Theory
by: Shi, Minjia, et al.
Published: (2024)

The Sequence Reconstruction of Permutations under Hamming Metric with Small Errors
by: Abdollahi, A., et al.
Published: (2026)

Towards a conjecture on a special class of matrices over commutative rings of characteristic 2
by: Wu, Baofeng
Published: (2021)

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

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

A Deep Learning Based Decoder for Concatenated Coding over Deletion Channels
by: Kargı, E. Uras, et al.
Published: (2024)

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

Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
by: Junnila, Ville, et al.
Published: (2025)

The generalized trifference problem
by: Bishnoi, Anurag, et al.
Published: (2025)

Linear rank-metric intersecting codes
by: Bartoli, Daniele, et al.
Published: (2025)

The asymptotic number of equivalence classes of linear codes with given dimension
by: Di Giusto, Andrea, et al.
Published: (2025)

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

On the cross-correlation properties of large-size families of Costas arrays
by: Liu, Runfeng, et al.
Published: (2025)