English
Related papers

Related papers: Mutually Uncorrelated Codes for DNA Storage

200 papers

We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNA-based storage systems and synchronization protocols. WMU sequences are characterized by the property that no sufficiently long suffix…

Information Theory · Computer Science 2016-02-01 S. M. Hossein Tabatabaei Yazdi , Han Mao Kiah , Olgica Milenkovic

We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNA-based data storage systems and for synchronization of communication devices. WMU sequences are characterized by the property that no…

Information Theory · Computer Science 2017-09-18 S. M. Hossein Tabatabaei Yazdi , Han Mao Kiah , Ryan Gabrys , Olgica Milenkovic

We consider a new family of codes, termed asymmetric Lee distance codes, that arise in the design and implementation of DNA-based storage systems and systems with parallel string transmission protocols. The codewords are defined over a…

Information Theory · Computer Science 2016-12-16 Ryan Gabrys , Han Mao Kiah , Olgica Milenkovic

DNA storage has emerged as an important area of research. The reliability of DNA storage system depends on designing the DNA strings (called DNA codes) that are sufficiently dissimilar. In this work, we introduce DNA codes that satisfy a…

Information Theory · Computer Science 2022-11-28 Krishna Gopal Benerjee , Sourav Deb , Manish K Gupta

A new family of codes, called clustering-correcting codes, is presented in this paper. This family of codes is motivated by the special structure of data that is stored in DNA-based storage systems. The data stored in these systems has the…

Information Theory · Computer Science 2019-03-12 Tal Shinkar , Eitan Yaakobi , Andreas Lenz , Antonia Wachter-Zeh

Symmetric fix-free codes are prefix condition codes in which each codeword is required to be a palindrome. Their study is motivated by the topic of joint source-channel coding. Although they have been considered by a few communities they…

Information Theory · Computer Science 2012-11-13 S. M. Hossein Tabatabaei Yazdi , Serap A. Savari

Motivated by applications in DNA storage, we study a setting in which strings are affected by tandem-duplication errors. In particular, we look at two settings: disjoint tandem-duplication errors, and equal-length tandem-duplication errors.…

Information Theory · Computer Science 2024-01-10 Wenjun Yu , Moshe Schwartz

As a medium for cold data storage, DNA stands out as it promises significant gains in storage capacity and lifetime. However, it comes with its own data processing challenges to overcome. Constrained codes over the DNA alphabet…

Information Theory · Computer Science 2025-10-08 Canberk İrimağzı , Ahmed Hareedy

This paper concerns non-overlapping codes, block codes motivated by synchronisation and DNA-based storage applications. Most existing constructions of these codes do not account for the restrictions posed by the physical properties of…

Information Theory · Computer Science 2025-02-05 Lidija Stanovnik , Miha Moškon , Miha Mraz

Distributed storage systems that deploy erasure codes can provide better features such as lower storage overhead and higher data reliability. In this paper, we focus on fractional repetition (FR) codes, which are a class of storage codes…

Information Theory · Computer Science 2020-05-15 Bing Zhu , Kenneth W. Shum , Hui Li

This paper studies the fundamental limits of the shared-link coded caching problem with correlated files, where a server with a library of $N$ files communicates with $K$ users who can locally cache $M$ files. Given an integer $r \in [N]$,…

Information Theory · Computer Science 2021-06-15 Kai Wan , Daniela Tuninetti , Mingyue Ji , Giuseppe Caire

The process of DNA-based data storage (DNA storage for short) can be mathematically modelled as a communication channel, termed DNA storage channel, whose inputs and outputs are sets of unordered sequences. To design error correcting codes…

Information Theory · Computer Science 2020-06-11 Wentu Song , Kui Cai , Kees A. Schouhamer Immink

In data storage and data transmission, certain patterns are more likely to be subject to error when written (transmitted) onto the media. In magnetic recording systems with binary data and bipolar non-return-to-zero signaling, patterns that…

Information Theory · Computer Science 2020-02-25 Ahmed Hareedy , Robert Calderbank

This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length or maximum redundancy and average redundancy, including a convex combination of the…

Information Theory · Computer Science 2011-02-11 Charalambos D. Charalambous , Themistoklis Charalambous , Farzad Rezaei

Non-uniquely decodable codes can be defined as the codes that cannot be uniquely decoded without additional disambiguation information. These are mainly the class of non-prefix-free codes, where a codeword can be a prefix of other(s), and…

Data Structures and Algorithms · Computer Science 2019-11-14 M. Oğuzhan Külekci , Yasin Öztürk , Elif Altunok , Can Altıniğne

Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all codewords have lengths that lie in a user-specified set of…

Information Theory · Computer Science 2008-01-03 Michael B. Baer

In social networks, heterogeneous multimedia data correlate to each other, such as videos and their corresponding tags in YouTube and image-text pairs in Facebook. Nearest neighbor retrieval across multiple modalities on large data sets…

Information Retrieval · Computer Science 2019-05-24 Dayong Tian

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 combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches are often rare or unnecessary. Developing efficient…

Artificial Intelligence · Computer Science 2025-07-18 Besik Dundua , Temur Kutsia

DNA sequences are prone to creating secondary structures by folding back on themselves by non-specific hybridization among its nucleotides. The formation of secondary structures makes the sequences chemically inactive towards synthesis and…

Information Theory · Computer Science 2022-11-30 Siddhartha Siddhiprada Bhoi , Paramapalli Udaya , Abhay Kumar Singh
‹ Prev 1 2 3 10 Next ›