22 papers · ranked by Valyu relevance
Qianfan Wang, Jifan Liang, Peihong Yuan, Ken R. Duffy + 2 more
—Future beyond-5G and 6G systems demand ultrareliable, low-latency communication with short blocklengths, motivating the development of universal decoding algorithms. Guessing decoding, which infers the noise or codeword candidate in order of decreasing (exact or approximate) likelihood, offers a universal framework…
Lin, Mao
The minimum weight matching (MWM) and maximum likelihood decoding (MLD) are two widely used and distinct decoding strategies for quantum error correction. For a given syndrome, the MWM decoder finds the most probable physical error corresponding to the MWM of the decoding graph, whereas MLD aims to find the most…
Jenkin Tsui, Naila Adam, Woongcheol Choi, Luna Y. Liu + 10 more
Imaging-based spatial transcriptomics technologies have opened new avenues for studying cellular organization and gene expression within intact tissues. However, the accuracy of downstream analyses depends critically on the decoding step that reconstructs barcodes from fluorescence patterns and maps them to gene…
Marwan Jalaleddine, Jiajie Li, Syed Mohsin Abbas, Warren J. Gross
The high computational cost of approaching the performance of Maximum-likelihood (ML) decoding has limited its practical use for decades. Because the complexity grows exponentially with the message length, researchers have spent years developing algorithms like Ordered Statistics Decoding (OSD), Partial Ordered…
Pengxi Fu, Zhen Wang, Jianxin Guo, Yushuai Zhang + 4 more
Modern communication systems increasingly leverage multiple information streams-including channel observations, statistical models, and contextual knowledge-to enhance decoding reliability. However, the varying and often unpredictable quality of these sources poses a critical challenge: rigid combination rules fail…
Lorenzo Posani
Neural decoding is a powerful approach for inferring which variables are represented in the activity of a population of neurons, with broad applications ranging from basic neuroscience to clinical settings such as brain-computer interfaces. More recently, decoding has also been used as a cross-validated tool for…
Julia Lieb, Michael Schaller
The construction of Maximum Distance Profile (MDP) convolutional codes in general requires the use of very large finite fields. In contrast convolutional codes with optimal column distances maximize the column distances for a given arbitrary finite field. In this paper, we present a construction of such convolutional…
Kaan Doğan Erdoğan, Nurettin Doğan, Heena Rathore, Yuchen Jiang + 1 more
One of the major challenges in securing medical image communication systems is the secure and efficient management of cryptographic key material. In this paper, we propose a multi-layer image encryption algorithm that addresses image security while reducing per-image key-storage and transmission overhead under a…
G. Bilodeau, A. Miao, G. Gagnon-Turcotte, C. Ethier + 1 more
Bidirectional interfaces combined with neural de-coding algorithms are essential for closed-loop (CL) neuromodulation, enabling simultaneous neural monitoring and responsive optogenetic stimulation. However, implementing these capabilities in compact wireless headstages for freely moving animals remains challenging, as…
Laura Caune, Luka Skoric, Nick S. Blunt, Archibald Ruban + 21 more
Quantum error correction will be essential for quantum computers to realise their full potential. As quantum computers advance towards demonstrating a universal fault-tolerant logical gate set, implementing scalable and low-latency real-time decoding will be crucial to avoid an exponential slowdown and maintain a fast…
Guoming Song, Dongming Pi, Shancheng Zhao, Chi Wan Sung
Product codes (PCs) are widely used in high-speed communication systems due to their attractive trade-off between error-correction performance and complexity. To further meet the rapidly growing demand for higher data rates, soft-aided hard-decision decoders (SA-HDDs) have been developed. In this paper, we present a…
Joshua Krause, Jacolien van Rij, Jelmer P. Borst
Hidden (semi-) Markov Models (HsMMs) are increasingly being used to segment neuro-physiological signals into sequences of latent cognitive processes. The idea: different processes will leave distinct traces in trial-level recordings of (multivariate) neuro-physiological signals. Markov models, equipped with an emission…
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)…
Authors not listed
The discovery of chemically novel or structurally anomalous metal-organic frameworks (MOFs) is essential for expanding reticular design space and enhancing dataset reliability. We present CHEM-AD (Chemically Unusual Metal–organic Frameworks via Autoencoder-based Detection), a label-free, CPU-efficient pipeline that…
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…
Guodong Wang, Hongwei Liu, Jinquan Luo
In this paper, we propose a new method for constructing a class of non-GRS MDS codes. The lengths of these codes can reach up to q +3 2 (for finite fields of odd characteristic) and q +4 2 (for even characteristic), respectively. Owing to their special structure, we can use the Cauchy matrix method to obtain the…
Yadong Jiao, Xiaoyan Cheng, Yuansheng Tang, Ming Xu
For the polar codes introduced by Arikan in 2009, the first code family achieving the capacity of binary-input discrete memoryless channels (BIDMCs) with low-complexity encoding and decoding, it is crucial to evaluate the reliability of the synthetic channels resulted in the code construction. Since the synthetic…
Deepak Kumar Verma, Mamta Rani, Roli Dikshit, Himanshu Gupta + 1 more
This research delves into the concerns raised by numerous researchers regarding the security of Baptista’s chaotic cryptosystem. The paper scrutinizes two fundamental issues in the Baptista algorithm: the imperfect distribution of chaotic data and the constraints of a single attractor. To address these issues, we…
William Dorrell, Peter E. Latham, Timothy E. J. Behrens, James C. R. Whittington
The efficient coding hypothesis presents a compelling success story for theoretical and systems neuroscience. It marshals a unifying idea, that neural codes can be understood as efficient encodings of natural stimuli, to explain phenomena from across sensory systems, sometimes with exquisite precision. However, similar…
Authors not listed
This work provides a rigorous theoretical investigation of selective error correction strategies for variational quantum algorithms, with focus on understanding the interplay between error suppression, circuit trainability, and computational resource requirements. We develop a mathematical framework that characterizes…
Alice Tor, Yuxin Wu, Stephen E Clarke, Lisa Yamada + 2 more
The complexity of neural data changes as the brain processes information during events. Universal lossless compression algorithms, which are broadly applicable and grounded in information theory, identify and exploit redundancies in data in order to compress it to essentially-optimal sizes regardless of underlying…
Xiaoqiang Zhang, Pengfei Chen, Xueheng Zhang, Boris Ryabko
Digital images are easily transmitted in Internet, but there is also a great risk of information leakage. To meet the requirements of secure image transmission and real-time communication, an image encryption algorithm based on a novel chaotic map and a three-dimensional histogram is proposed. Firstly, a novel…