19 papers · ranked by Valyu relevance
Zekun Cao, Zhaoxia Yin, Honghe Hu, Xiangping Gao + 1 more
Aiming to embed large amount of data while minimize the sum of costs of all changed pixels, a novel high capacity data hiding scheme based on (7, 4) Hamming code is realized by a family of algorithms. Firstly, n (n = 1, 2, 3) cover pixels are assigned to one set according to the payload. Then, 128 binary strings of…
Myeongjin Kang, Daejin Park, Youfan Hu
Embedded systems typically operate in harsh environments, such as where there is external shock, insufficient power, or an obsolete sensor after the replacement cycle. Despite these harsh environments, embedded systems require data integrity for accurate operation. Unintended data changes can cause a serious error in…
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.…
Omar Khadir
In this work, we present a new simple way to encode/decode messages transmitted via a noisy channel and protected against errors by the Hamming method. We also propose a fast and efficient algorithm for the encoding and the decoding process which do not use neither the generator matrix nor the parity-check matrix of…
David Freitas, David Mota, Clailton Lopes, Daniel Simões + 3 more
'Jarbas Silveira' 'J.C.M. Mota' 'César Marcon'] Abstract—Reducing the threshold voltage of electronic devices increases their sensitivity to electromagnetic radiation dramatically, increasing the probability of changing the memory cells' content. Designers mitigate failures using techniques such as Error Correction…
Zhengrui Li, Sian-Jheng Lin, Yunghsiang S. Han
In this paper, we investigate the encoding circuit size of Hamming codes and Hadamard codes. To begin with, we prove the exact lower bound of circuit size required in the encoding of (punctured) Hadamard codes and (extended) Hamming codes. Then the encoding algorithms for (punctured) Hadamard codes are presented to…
H. Gopalkrishna Gadiyar, R. Padma
This note will enable readers to move on to the now classic books by V. Pless [9]and Berlekamp [1]. Hamming's classic paper [6] is difficult to read because the mathematics is written in words and tables. This was because the audience of mathematicians and engineers in those days who worked in applied fields preferred…
Muhammad Moazzam Ali, Shaiful Jahari Hashim, Zaid Ahmad, Guillaume Ferre + 3 more
'Guillaume Ferre' 'Fakhrul Zaman Rokhani' 'Muhammad Akmal Chaudhary' 'Ivan Zyrianoff'] Rotating Polarization Wave (RPW) is a novel Low Power Wide Area Networks (LPWAN) technology for robust connectivity and extended coverage area as compared to other LPWAN technologies such as LoRa and Sigfox when no error detection…
Dan Tulpan, Chaouki Regoui, Guillaume Durand, Luc Belliveau + 1 more
'Serge Léger'] This paper presents a novel hybrid DNA encryption (HyDEn) approach that uses randomized assignments of unique error-correcting DNA Hamming code words for single characters in the extended ASCII set. HyDEn relies on custom-built quaternary codes and a private key used in the randomized assignment of code…
Hsuan-Yin Lin, Stefan M. Moser, Po‐Ning Chen
This paper investigates fundamental properties of nonlinear binary codes by looking at the codebook matrix not row-wise (codewords), but column-wise. The family of weak flip codes is presented and shown to contain many beautiful properties. In particular the subfamily fair weak flip codes, which goes back to Berlekamp…
Luzinete C. B. Faria, Andréa S. L. Rocha, João H. Kleinschmidt, Márcio C. Silva-Filho + 5 more
Since a genome is a discrete sequence, the elements of which belong to a set of four letters, the question as to whether or not there is an error-correcting code underlying DNA sequences is unavoidable. The most common approach to answering this question is to propose a methodology to verify the existence of such a…
Tilo Buschmann, Leonid V Bystrykh
Background High-throughput sequencing technologies are improving in quality, capacity and costs, providing versatile applications in DNA and RNA research. For small genomes or fraction of larger genomes, DNA samples can be mixed and loaded together on the same sequencing track. This so-called multiplexing approach…
Zhi Ping, Haoling Zhang, Shihong Chen, Qianlong Zhuang + 2 more
Chamaeleo is currently the only collection library that focuses on adapting multiple well-established coding schemes for DNA storage. It provides a tool for researchers to study various coding schemes and apply them in practice. Chamaeleo adheres to the concept of high aggregation and low coupling for software design…
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…
John-Antonio Argyriadis, Yang-Hui He, Vishnu Jejjala, Djordje Minic
We study the dynamics of genetic code evolution. The algorithm of Vetsigian et al. [1] provides a solution that is both optimal and universal. We reproduce and analyze the algorithm as a dynamical system. All the parameters used in the model are varied to assess their impact on achieving universality. We show that by…
Chai Wah Wu
In most error correction coding (ECC) frameworks, the typical error metric is the bit error rate (BER) which measures the number of bit errors. For this metric, the positions of the bits are not relevant to the decoding, and in many noise models, not relevant to the BER either. In many applications this is…
Authors not listed
This paper presents a simplified model of iterative compound optimization in drug/agrochemical discovery. Compounds are represented as binary strings, with project evolution simulated through random bit changes. The model reproduces key statistical features of real projects, including activity distributions and…
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…
Authors not listed
The Hidden Subgroup Problem (HSP) unifies several landmark quantum algorithms, yet systematic exploration of its variants and modern applications has slowed. This paper revives HSP-based algorithm design by examining new group structures with direct relevance to post-quantum cryptography, lattice problems, and…