Cover Image

Bounds and Constructions of Codes for Ordered Composite DNA Sequences

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ye, Zuo, Li, Yuling, Lan, Zhaojun, Ge, Gennian
Format:	Preprint
Published:	2026
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

Coding for Ordered Composite DNA Sequences
by: Dollma, Besart, et al.
Published: (2025)

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

Criss-Cross Deletion Correcting Codes: Optimal Constructions with Efficient Decoders
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)

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

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)

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

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

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

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

Constrained Coding for Composite DNA: Channel Capacity and Efficient Constructions
by: Nguyen, Tuan Thanh, 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)

Network function computation with vector linear target function and security function
by: Xu, Min, et al.
Published: (2026)

On the Existence and Nonexistence of Splitter Sets
by: Yuan, Zhiyu, et al.
Published: (2025)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
by: Ge, Songping, et al.
Published: (2025)

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

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

Error-Correcting Codes for Labeled DNA Sequences
by: Hanania, Dganit, et al.
Published: (2025)

New Constructions of Reversible DNA Codes
by: Chen, Xueyan, et al.
Published: (2024)

On hierarchical secure aggregation against relay and user collusion
by: Xu, Min, et al.
Published: (2025)

Random Access in DNA Storage: Algorithms, Constructions, and Bounds
by: Wang, Chen, et al.
Published: (2026)

Coding for Strand Breaks in Composite DNA
by: Walter, Frederik, et al.
Published: (2025)

Multiset Deletion-Correcting Codes: Bounds and Constructions
by: Kreindel, Avraham, et al.
Published: (2026)

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

Error-Correcting Codes for Combinatorial Composite DNA
by: Sabary, Omer, et al.
Published: (2024)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
by: Berman, Amit, et al.
Published: (2026)

Bounds and Constructions of High-Memory Spatially-Coupled Codes
by: Huang, Lei
Published: (2025)

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
by: Shi, Haoming, et al.
Published: (2025)

A Sequence Construction of Cyclic Codes over Finite Fields
by: Ding, Cunsheng
Published: (2016)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
by: Brakensiek, Joshua, et al.
Published: (2025)

Griesmer Bound and Constructions of Linear Codes in $b$-Symbol Metric
by: Luo, Gaojun, et al.
Published: (2024)

Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions
by: Walter, Frederik, et al.
Published: (2024)

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

Doppler Resilient Complementary Sequences: Tighter Aperiodic Ambiguity Function Bound and Optimal Constructions
by: Wang, Zheng, et al.
Published: (2025)