13 papers · ranked by Valyu relevance
H. Mertens, Marc Van Droogenbroeck
The Viterbi algorithm, presented in 1967, allows a maximum likelihood decoding of partial response codes. This study focuses on the duobinary code which is the first member of this family and has been specified for the digital part of television systems recommended by International Organizations. Up to now the…
Luhan Jiang, Jianjun Yu, Qiutong Zhang, Wen Zhou + 3 more
Highlights What are the main findings?1. A GMM-enhanced duobinary unsupervised adaptive CNN (DB-UACNN) is proposed to enhance duobinary filtering without relying on training labels, enabling robust operation under unknown terahertz wireless channels. 2. In a 300-GHz photonics-aided 2 × 2 MIMO wireless system over 200…
Zhi Ping, Shihong Chen, Xiaoluo Huang, Sha Joe Zhu + 10 more
DNA has been reported as a promising medium of data storage for its remarkable durability and space-efficient storage capacity. Here, we propose a robust DNA-based data storage method based on a new codec algorithm, namely ‘Yin-Yang’. Using this strategy, we successfully stored different formats of files in one…
А. В. Анисимов, 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…
Zhi Ping, Dongzhao Ma, Xiaoluo Huang, Shihong Chen + 4 more
'Fei Guo' 'Sha Joe Zhu' 'Yue Shen'] Title: Abstract The information explosion has led to a rapid increase in the amount of data requiring physical storage. However, in the near future, existing storage methods (i.e., magnetic and optical media) will be insufficient to store these exponentially growing data. Therefore…
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…
Nithin Nagaraj
> Abstract. In 2009, a lossless compression algorithm based on 1D chaotic maps known as Generalized Lur¨oth Series (or GLS) has been proposed. This algorithm (GLS-coding) encodes the input message as a symbolic sequence on an appropriate 1D chaotic map (GLS) and the compressed file is obtained as the initial value by…
Leonid V. Bystrykh, Jo-Ann L. Stanton
The diversity and scope of multiplex parallel sequencing applications is steadily increasing. Critically, multiplex parallel sequencing applications methods rely on the use of barcoded primers for sample identification, and the quality of the barcodes directly impacts the quality of the resulting sequence data.…
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…
Andrzej Chmielowiec, Paweł Litwin, Philip Broadbridge, Raúl Alcaraz
This article deals with compression of binary sequences with a given number of ones, which can also be considered as a list of indexes of a given length. The first part of the article shows that the entropy H of random n-element binary sequences with exactly k elements equal one satisfies the inequalities…
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…
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…
Jun Lu, Zhuo Zhang, Juan Mo
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods. Universal combinatorial coding is lossless and it is based on the combinatorics…