Cover Image

Deletion-correcting codes for an adversarial nanopore channel

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xie, Huiling, Chen, Zitan
Format:	Preprint
Published:	2026
Subjects:	Information Theory Discrete Mathematics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
by: Li, Xiaxin, et al.
Published: (2024)

Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
by: Li, Xiaxin, et al.
Published: (2025)

DRESS and the WL Hierarchy: Climbing One Deletion at a Time
by: Velilla, Eduar Castrillo
Published: (2026)

Optimally revealing bits for rejection sampling
by: Langevin, Louis-Roy, et al.
Published: (2025)

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

Construction of orientable sequences in $O(1)$-amortized time per bit
by: Gabric, Daniel, et al.
Published: (2024)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
by: Bentert, Matthias, et al.
Published: (2026)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
by: Gaikwad, Ajinkya
Published: (2025)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Efficient Online Random Sampling via Randomness Recycling
by: Draper, Thomas L., et al.
Published: (2025)

Non-adaptive Learning of Random Hypergraphs with Queries
by: Austhof, Bethany, et al.
Published: (2025)

Efficient Rejection Sampling in the Entropy-Optimal Range
by: Draper, Thomas L., et al.
Published: (2025)

Undirected Multicast Network Coding Gaps via Locally Decodable Codes
by: Braverman, Mark, et al.
Published: (2025)

Constant delay Gray code enumeration of ideals and antichains in posets
by: Brenner, Sofia, et al.
Published: (2026)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
by: Liu, Bowie, et al.
Published: (2025)

Double-Ended Palindromic Trees in Linear Time
by: Wang, Qisheng, et al.
Published: (2022)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
by: Bhattacharya, Sudatta, et al.
Published: (2025)

Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026)

Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)

Exact Algorithms for Edge Deletion to Cactus
by: Akhtar, Sheikh Shakil, et al.
Published: (2026)

Deterministically finding an element of large order in $\mathbb{Z}_N^*$
by: Nir, Itamar
Published: (2026)

The $Z$-Curve as an $n$-Dimensional Hypersphere: Properties and Analysis
by: Gonzalez, Diego Vazquez, et al.
Published: (2024)

Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery
by: Ameen, Taha, et al.
Published: (2024)

Explicit Min-wise Hash Families with Optimal Size
by: Chen, Xue, et al.
Published: (2025)

Improved Streaming Algorithm for Fair $k$-Center Clustering
by: Guo, Longkun, et al.
Published: (2025)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
by: Wang, Chen, et al.
Published: (2024)

Approximation algorithms for non-sequential star packing problems
by: Hu, Mengyuan, et al.
Published: (2024)

Approximately covering vertices by order-$5$ or longer paths
by: Gong, Mingyang, et al.
Published: (2024)

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
by: Vombatkere, Karan, et al.
Published: (2026)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
by: Li, Songhua, et al.
Published: (2023)

Aggregating maximal cliques in real-world graphs
by: Alon, Noga, et al.
Published: (2025)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
by: Davot, Tom, et al.
Published: (2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
by: Basu, Sabyasachi, et al.
Published: (2024)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
by: Huang, Yufan, et al.
Published: (2023)

Spectral Triadic Decompositions of Real-World Networks
by: Basu, Sabyasachi, et al.
Published: (2022)

Deterministic counting from coupling independence
by: Chen, Xiaoyu, et al.
Published: (2024)

Counting random $k$-SAT near the satisfiability threshold
by: Chen, Zongchen, et al.
Published: (2024)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
by: Jacob, Ashwin, et al.
Published: (2024)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
by: Le, Hoang-Oanh, et al.
Published: (2024)