English
Related papers

Related papers: Concatenated Code Design for Constrained DNA Data …

200 papers

A method for estimating the performance of low-density parity-check (LDPC) codes decoded by hard-decision iterative decoding algorithms on binary symmetric channels (BSC) is proposed. Based on the enumeration of the smallest weight error…

Information Theory · Computer Science 2007-07-13 Hua Xiao , Amir H. Banihashemi

Quantum cryptography via key distribution mechanisms that utilize quantum entanglement between sender-receiver pairs will form the basis of future large-scale quantum networks. A key engineering challenge in such networks will be the…

Information Theory · Computer Science 2015-05-14 Yixuan Xie , Jun Li , Robert Malaney , Jinhong Yuan

In this work, we present a concatenated repetition-polar coding scheme that is aimed at applications requiring highly unbalanced unequal bit-error protection, such as the Beam Interlock System of the Large Hadron Collider at CERN. Even…

Information Theory · Computer Science 2017-12-04 Alexios Balatsoukas-Stimming , Tomasz Podzorny , Jan Uythoven

DNA code design aims to generate a set of DNA sequences (codewords) with minimum likelihood of undesired hybridizations among sequences and their reverse-complement (RC) pairs (cross-hybridization). Inspired by the distinct hybridization…

Information Theory · Computer Science 2020-05-15 Yixin Wang , Md Noor-A-Rahim , Erry Gunawan , Yong Liang Guan , Chueh Loo Poh

Constrained codes are used to prevent errors from occurring in various data storage and data transmission systems. They can help in increasing the storage density of magnetic storage devices, in managing the lifetime of electronic storage…

Information Theory · Computer Science 2022-09-07 Ahmed Hareedy , Beyza Dabak , Robert Calderbank

The exponential increase in storage demand and low lifespan of data storage devices has resulted in long-term archival and preservation emerging as a critical bottlenecks in data storage. In order to meet this demand, researchers are now…

Image and Video Processing · Electrical Eng. & Systems 2025-05-22 Xavier Pic , Raja Appuswamy

This paper studies two problems that are motivated by the novel recent approach of composite DNA that takes advantage of the DNA synthesis property which generates a huge number of copies for every synthesized strand. Under this paradigm,…

Information Theory · Computer Science 2025-05-15 Tomer Cohen , Eitan Yaakobi

The synthesis of DNA strands remains the most costly part of the DNA storage system. Thus, to make DNA storage system more practical, the time and materials used in the synthesis process have to be optimized. We consider the most common…

Information Theory · Computer Science 2023-05-15 Johan Chrisnata , Han Mao Kiah , Van Long Phuoc Pham

Rate-matching of low-density parity-check (LDPC) codes enables a single code description to support a wide range of code lengths and rates. In 5G NR, rate matching is accomplished by extending (lifting) a base code to a desired target…

Information Theory · Computer Science 2024-10-29 Reinhard Wiesmayr , Darja Nonaca , Chris Dick , Christoph Studer

The emerging field of DNA storage employs strands of DNA bases (A/T/C/G) as a storage medium for digital information to enable massive density and durability. The DNA storage pipeline includes: (1) encoding the raw data into sequences of…

Genomics · Quantitative Biology 2025-01-28 Hadas Abraham , Barak Gahtan , Adir Kobovich , Orian Leitersdorf , Alex M. Bronstein , Eitan Yaakobi

Fault tolerance in quantum protocols requires contributions from error-correcting codes and their suitable decoders. Quantum Low-Density Parity Check (QLDPC) codes are one of the most explored quantum codes that have good coding rate and…

Quantum Physics · Physics 2026-04-24 Mainak Bhattacharyya , Ankur Raina

This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

We propose a deterministic method to design irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the existing methods, which are based on the application of asymptomatic analysis tools such as…

Information Theory · Computer Science 2008-01-24 Hamid Saeedi , Amir H. Banihashemi

We study permutations over the set of $\ell$-grams, that are feasible in the sense that there is a sequence whose $\ell$-gram frequency has the same ranking as the permutation. Codes, which are sets of feasible permutations, protect…

Information Theory · Computer Science 2021-01-18 Niv Beeri , Moshe Schwartz

We propose a novel coding scheme for DNA-based storage systems, called the shift-interleave (SI) coding, designed to correct insertion, deletion, and substitution (IDS) errors, as well as sequence losses. The SI coding scheme employs…

Information Theory · Computer Science 2024-01-29 Ryo Shibata , Haruhiko Kaneko

DNA strings and their properties are widely studied since last 20 years due to its applications in DNA computing. In this area, one designs a set of DNA strings (called DNA code) which satisfies certain thermodynamic and combinatorial…

Information Theory · Computer Science 2025-10-03 Krishna Gopal Benerjee , Manish K Gupta

DNA has many valuable characteristics that make it suitable for a long-term storage medium, in particular its durability and high information density. DNA can be stored safely for hundreds of years with virtually no degradation, in contrast…

Quantitative Methods · Quantitative Biology 2022-05-31 Jamie J. Alnasir , Thomas Heinis , Louis Carteron

This paper propose a decoder architecture for low-density parity-check convolutional code (LDPCCC). Specifically, the LDPCCC is derived from a quasi-cyclic (QC) LDPC block code. By making use of the quasi-cyclic structure, the proposed…

Information Theory · Computer Science 2016-11-17 Chiu-Wing Sham , Xu Chen , Francis C. M. Lau , Yue Zhao , Wai M. Tam

In modern data storage systems, non-binary LDPC codes for recovering from disk failures are increasingly considered strong competitors to MDS codes such as Reed-Solomon codes. Since disk failures can be modeled as erasures, we analyze…

Information Theory · Computer Science 2026-05-28 Irina Bocharova , Boris Kudryashov , Henk D. L. Hollmann , Vitaly Skachek

Next-generation wireless communication systems impose much stricter requirements for transmission rate, latency, and reliability. The peak data rate of 6G networks should be no less than 1 Tb/s, which is comparable to existing long-haul…

Information Theory · Computer Science 2024-10-28 Kirill Andreev , Pavel Rybin , Alexey Frolov