12 papers · ranked by Valyu relevance
Paridhi Latawa, Nuh Aydın
| 1 | Abstract | | 2 | | --- | --- | --- | --- | | 2 | | Introduction | 2 | | 3 | | Convolutional Codes | 3 | | | 3.1 | Encoding of Binary Convolutional Codes | 3 | | | 3.2 | Decoding Convolutional Codes | 11 | | | 3.3 | Truncated Viterbi Decoding | 13 | | 4 | | DNA Codes | 17 | | | 4.1 | Constraints for the…
H. Yamamoto, Masato Tsuchihashi, Junya Honda
We propose almost instantaneous fixed-to-variable-length (AIFV) codes such that two (resp. K − 1) code trees are used if code symbols are binary (resp. K-ary for K ≥ 3), and source symbols are assigned to incomplete internal nodes in addition to leaves. Although the AIFV codes are not instantaneous codes, they are…
Ian Holmes
We describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by interleaving watermark and periodic marker signals; conversion from binary to…
Inbal Preuss, Michael Rosenberg, Zohar Yakhini, Leon Anavy
With the world generating digital data at an exponential rate, DNA has emerged as a promising archival medium. It offers a more efficient and long-lasting digital storage solution due to its durability, physical density, and high information capacity. Research in the field includes the development of encoding schemes…
Neha Periwal, Priya Sharma, Pooja Arora, Saurabh Pandey + 2 more
Classification among coding (CDS) and non-coding RNA (ncRNA) sequences is a challenge and several machine learning models have been developed for the same. Since the frequency of curated coding sequences is many-folds as compared to that of the ncRNAs, we devised a novel approach to work with the complete datasets from…
А. В. Анисимов, Igor O. Zavadskyi
Variable-length splittable codes are derived from encoding sequences of ordered integer pairs, where one of the pair's components is upper bounded by some constant, and the other one is any positive integer. Each pair is encoded by the concatenation of two fixed independent prefix encoding functions applied to the…
Xuyang Zhao, Junyao Li, Qingyuan Fan, Jing Dai + 5 more
DNA, as the origin for the genetic information flow, has also been a compelling alternative to non-volatile information storage medium. Reading digital information from this highly dense but lightweighted medium nowadays relied on conventional next-generation sequencing (NGS), which involves ‘wash and read’ cycles for…
Ahmed Hareedy, Beyza Dabak, Robert Calderbank
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 devices, and in increasing the reliability of data transmission over wires. Over…
Subhash Kak
Mathematically, ternary coding is more efficient than binary coding. It is little used in computation because technology for binary processing is already established and the implementation of ternary coding is more complicated, but remains relevant in algorithms that use decision trees and in communications. In this…
Robert Bamler
Entropy coding is the backbone data compression. Novel machine-learning based compression methods often use a new entropy coder called Asymmetric Numeral Systems (ANS) [Duda et al., 2015], which provides very close to optimal bitrates and simplifies [Townsend et al., 2019] advanced compression techniques such as…
Rod Rinkus
The brain is believed to implement probabilistic reasoning and to represent information via population, or distributed, coding. Most previous population-based probabilistic (PPC) theories share several basic properties: 1) continuous-valued neurons (units); 2) fully/densely-distributed codes, i.e., all/most coding…
Amir Said
Entropy coding, compression, complexity This introduction to arithmetic coding is divided in two parts. The first explains how and why arithmetic coding works. We start presenting it in very general terms, so that its simplicity is not lost under layers of implementation details. Next, we show some of its basic…