12 papers · ranked by Valyu relevance
Martin Bossert, Rebekka Schulz, Sebastian Bitzer
—The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic cosets. Which subset is chosen determines the dimension, the minimum distance and the weight distribution of the BCH code. We construct possible BCH codes and determine their coderate, true minimum distance and the…
Xianbin Wang, Huazi Zhang, Rong Li, Jiajie Tong + 2 more
'Jun Wang'] Abstract—In this work, we propose a type of G N -coset codes for parallel decoding. The parallel decoder exploits two equivalent decoding graphs of GN -coset codes. For each decoding graph, the inner code part is composed of independent component codes to be decoded in parallel. The extrinsic information of…
Sümeyra Uçar, Ni̇hal Taş, Nihal Yılmaz Özgür
Coding/decoding algorithms are of great importance to help in improving information security since information security is a more significiant problem in recent years. In this paper we introduce two new coding/decoding algorithms using Fibonacci Q-matrices and R-matrices. Our models are based on the blocked message…
Sven Müelich, Martin Bossert
—Physical Unclonable Functions (PUFs) exploit variations in the manufacturing process to derive bit sequences from integrated circuits, which can be used as secure cryptographic keys. Instead of storing the keys in an insecure, non-volatile memory, they can be reproduced when needed. Since the reproduced sequences are…
Yong Li, Qianbin Chen, Hongqing Liu, Trieu‐Kien Truong
In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations. Also, a…
Diogen Babuc
Djokovic Authors: ['Diogen Babuc'] Abstract—The question that is a motivation of writing is how many devote themselves to discovering something in the world of science where much is discerned and revealed, but at the same time, much is unknown. The insightful elements of this algorithm are the ciphering and deciphering…
Mohammed Usman, J. Dunlop
- Luby Transform (LT) codes are a class of fountain codes that have proved to perform very efficiently over the erasure channel. These codes are rateless in the sense that an infinite stream of encoded symbols can be generated on the fly. Furthermore, every encoded symbol is information additive and can contribute in…
Authors not listed
This research presents a novel approach to obstacle detection during navigation using a combination of Convolutional Neural Networks (CNNs) and Long Short-Term Memory (LSTM) networks. The primary objective is to generate accurate image captions that describe the content of images, which is crucial for applications such…
Authors not listed
Electrospray ionization (ESI) mass spectrometry is an essential technique for chemical analysis in a range of fields. In ESI, analytes can produce multiple charge states, which must be correctly assigned for identification. Existing approaches to charge state assignment can suffer from limited accuracy and/or poor…
Aliye Hazal Koyuncu, Jacopo Movilli, Sevil Sahin, Dmitrii V. Kriukov + 2 more
This work describes a competing activation network, which is regulated by chemical feedback at the liquid-surface interface. Feedback loops dynamically tune the concentration of chemical components in living systems, thereby controlling regulatory processes in neural, genetic, and metabolic networks. Advances in…
Mehmet Aziz Yirik, Maria Sorokina, Christoph Steinbeck
The generation of constitutional isomer chemical spaces has been a subject of cheminformatics since the early 1960s, with applications in structure elucidation and elsewhere. In order to perform such a generation efficiently, exhaustively and isomorphism-free, the structure generator needs to ensure the building of…
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…