Copertina

Constrained Coding for Composite DNA: Channel Capacity and Efficient Constructions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Nguyen, Tuan Thanh, Wang, Chen, Cai, Kui, Zhang, Yiwei, Yakhini, Zohar
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Information Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes
di: Ding, Yi, et al.
Pubblicazione: (2024)

Correcting Tail Deletions in Rank Modulated Composite Encoding for Data Storage in DNA
di: Cohen, Tomer, et al.
Pubblicazione: (2026)

Rank Modulated Composite Encoding for Data Storage in DNA
di: Cohen, Tomer, et al.
Pubblicazione: (2026)

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

Studying the Cycle Complexity of DNA Synthesis
di: Zrihan, Amit, et al.
Pubblicazione: (2024)

Outer Channel of DNA-Based Data Storage: Capacity and Efficient Coding Schemes
di: He, Xuan, et al.
Pubblicazione: (2023)

Representing Information on DNA using Patterns Induced by Enzymatic Labeling
di: Bar-Lev, Daniella, et al.
Pubblicazione: (2024)

From One-Dimensional Codes to Two-Dimensional Codes: A Universal Framework for the Bounded-Weight Constraint
di: Le, Viet Hai, et al.
Pubblicazione: (2025)

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
di: Mosheiff, Jonathan, et al.
Pubblicazione: (2024)

Bounds and Constructions of Codes for Ordered Composite DNA Sequences
di: Ye, Zuo, et al.
Pubblicazione: (2026)

Constrained Error-Correcting Codes for Efficient DNA Synthesis
di: Liu, Yajuan, et al.
Pubblicazione: (2025)

New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
di: Song, Wentu, et al.
Pubblicazione: (2024)

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

Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity
di: Tamir, Ran, et al.
Pubblicazione: (2026)

Capacity-Achieving Codes for Noisy Insertion Channels
di: Liu, Hengfeng, et al.
Pubblicazione: (2025)

Constrained Coding and Deep Learning Aided Threshold Detection for Resistive Memories
di: Zhong, Xingwei, et al.
Pubblicazione: (2024)

Super-Linear Growth of the Capacity-Achieving Input Support for the Amplitude-Constrained AWGN Channel
di: Wang, Haiyang
Pubblicazione: (2025)

Hierarchical Joint Source-Channel Coding with Constrained Information Leakage
di: Chen, Yiqi, et al.
Pubblicazione: (2026)

Capacity on BMS Channels via Code Symmetry and Nesting
di: Pfister, Henry D., et al.
Pubblicazione: (2025)

Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach
di: Song, Guanghui, et al.
Pubblicazione: (2024)

Analog Error Correcting Codes with Constant Redundancy
di: Song, Wentu, et al.
Pubblicazione: (2026)

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

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

DeepDIVE: Optimizing Input-Constrained Distributions for Composite DNA Storage via Multinomial Channel
di: Kobovich, Adir, et al.
Pubblicazione: (2025)

Support Size of $\varepsilon$-Capacity-Achieving Inputs for the Amplitude-Constrained AWGN Channel
di: Barletta, Luca, et al.
Pubblicazione: (2026)

The Labeled Coupon Collector Problem
di: Tan, Andrew, et al.
Pubblicazione: (2025)

Embracing Errors Is More Efficient Than Avoiding Them Through Constrained Coding for DNA Data Storage
di: Weindel, Franziska, et al.
Pubblicazione: (2023)

Reed--Muller Codes Achieve the Symmetric Capacity on Finite-State Channels
di: Pfister, Henry D., et al.
Pubblicazione: (2026)

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

On the Analysis of Random Linear Streaming Codes in Stochastic Channels
di: Huang, Kai, et al.
Pubblicazione: (2025)

On the Sequence Reconstruction Problem for the Single-Deletion Two-Substitution Channel
di: Song, Wentu, et al.
Pubblicazione: (2026)

Half-Marker Codes for Deletion Channels with Applications in DNA Storage
di: Haghighat, Javad, et al.
Pubblicazione: (2025)

Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
di: Mishra, Prachi, et al.
Pubblicazione: (2026)

Capacity-Region-Achieving Sparse Regression Codes for MIMO Multiple-Access Channels
di: Yan, Hao, et al.
Pubblicazione: (2026)

Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap
di: Colomer, Pau, et al.
Pubblicazione: (2026)

On the Capacity of DNA Labeling
di: Hanania, Dganit, et al.
Pubblicazione: (2023)

Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels
di: Barletta, Luca, et al.
Pubblicazione: (2024)

Second-Order Identification Capacity of AWGN Channels
di: Liu, Zhicheng, et al.
Pubblicazione: (2024)

Union Bound Analysis for Spin-Torque Transfer Magnetic Random Access Memory (STT-MRAM) With Channel Quantization
di: Zhong, Xingwei, et al.
Pubblicazione: (2024)

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage
di: Srinivasavaradhan, Sundara Rajan, et al.
Pubblicazione: (2021)