15 papers · ranked by Valyu relevance
Byron H. Price, Jeffrey P. Gavornik
While it is universally accepted that the brain makes predictions, there is little agreement about how this is accomplished and under which conditions. Accurate prediction requires neural circuits to learn and store spatiotemporal patterns observed in the natural environment, but it is not obvious how such information…
Jesús E. Garca, Verónica A. González-López, Gustavo H. Tasca, Karina Y. Yaginuma + 1 more
In the framework of coding theory, under the assumption of a Markov process $(X_{t})$ on a finite alphabet $A,$ the compressed representation of the data will be composed of a description of the model used to code the data and the encoded data. Given the model, the Huffman’s algorithm is optimal for the number of bits…
Kees Schouhamer Immink, Jos H. Weber, Tuan Thanh Nguyen, Kui Cai + 2 more
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more)…
Kun Tu, Dariusz Puchala, Jun Chen, Sadaf Salehkalaibar
In this paper, we address the problem of m-gram entropy variable-to-variable coding, extending the classical Huffman algorithm to the case of coding m-element (i.e., m-grams) sequences of symbols taken from the stream of input data for $m>1$. We propose a procedure to enable the determination of the frequencies of the…
Qing Wang, Shufang Zhang, Yuhui Li, Stephen Bustin
Polymerase Chain Reaction (PCR) amplification is widely used for retrieving information from DNA storage. During the PCR amplification process, nonspecific pairing between the 3’ end of the primer and the DNA sequence can cause cross-talk in the amplification reaction, leading to the generation of interfering sequences…
Xu Yang, Xiaolong Shi, Langwen Lai, Congzhou Chen + 2 more
'Ming Deng'] DNA has become a popular choice for next-generation storage media due to its high storage density and stability. As the storage medium of life’s information, DNA has significant storage capacity and low-cost, low-power replication and transcription capabilities. However, utilizing long double-stranded DNA…
Tomasz Krokosz, Jarogniew Rykowski, Małgorzata Zajęcka, Robert Brzoza-Woch + 2 more
'Robert Brzoza-Woch' 'Leszek Rutkowski' 'Amitabh Mishra'] Modern, commonly used cryptosystems based on encryption keys require that the length of the stream of encrypted data is approximately the length of the key or longer. In practice, this approach unnecessarily complicates strong encryption of very short messages…
Kees Schouhamer Immink, Jos H. Weber, Kui Cai, Olgiça Milenković + 1 more
'Jin Sima'] Low-weight codes have been proposed for efficiently synthesizing deoxyribonucleic acid (DNA) for massive data storage, where a multiple of DNA strands are synthesized in parallel. We report on the redundancy and information rate of maxentropic low-weight codes for asymptotically large codeword length. We…
Kallie Whritenour, Mete Civelek, Farzad Farnoud
DNA has been proposed as an alternative to magnetic and solid-state devices for storing digital data. In DNA data storage, writing data is performed through DNA synthesis, and reading is done via sequencing. Nanopore devices for sequencing DNA, like those produced by Oxford Nanopore Technologies, allow long reads and…
Neri Merhav, Luca Faes
We propose a universal ensemble for the random selection of rate-distortion codes which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector, $x^$, is selected independently at random under the probability distribution that is proportional to $2-LZ(x^)$, where $LZ(x^)$…
Lei M. Li, Boris Ryabko
We consider the lossless compression bound of any individual data sequence. Conceptually, its Kolmogorov complexity is such a bound yet uncomputable. According to Shannon’s source coding theorem, the average compression bound is $nH$, where n is the number of words and H is the entropy of an oracle probability…
Kehinde Ogunyanda, Opeyemi O. Ogunyanda, Thokozani Shongwe, Jun Chen
In this paper, we propose a novel approach to enhance spectral efficiency in communication systems by dynamically adjusting the mapping between cyclic permutation coding (CPC) and its injected form. By monitoring channel conditions such as interference levels and impulsive noise strength, the system optimises the…
Meric Yucel, Serdar Bagis, Ahmet Sertbas, Mehmet Sarikaya + 2 more
'Burak Berk Ustundag' 'Boris Ryabko'] Highlights What are the main findings?1. A cortical coding method is developed inspired by the network formation in the brain, where the information entropy is maximized while dissipated energy is minimized. 2. The execution time in the cortical coding model is far superior…
Louis Mahon
Data complexity is an important concept in the natural sciences and related areas, but lacks a rigorous and computable definition. This paper focusses on a particular sense of complexity that is high if the data is structured in a way that could serve to communicate a message. In this sense, human speech, written…
Valéria G. Pedrosa, Max H. M. Costa, Sangun Park
The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to…