20 papers · ranked by Valyu relevance
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…
Guodong Wang, Hongwei Liu, Jinquan Luo
In this paper, firstly, we study decoding of a general class of twisted generalized Reed-Solomon (TGRS) codes and provide a precise characterization of the key equation for TGRS codes and propose a decoding algorithm. Secondly, we further study decoding of almost-MDS TGRS codes and provide a decoding algorithm. These…
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…
Fernando Martínez-García, Francisco Revson F. Pereira, Pedro Parrado-Rodríguez, Yauhen Yakimenka + 1 more
The development and use of large-scale quantum computers relies on integrating quantum error-correcting (QEC) schemes into the quantum computing pipeline. A fundamental part of the QEC protocol is the decoding of the syndrome to identify a recovery operation with a high success rate. In this work, we implement a…
Runtian Zhu, Lingfei Jin
MDS codes play a central role in practice due to their broad applications. To date, most known MDS codes are generalized Reed–Solomon (GRS) codes, leaving codes that are not equivalent to GRS codes comparatively less understood. Studying this non-GRS regime is therefore of intrinsic theoretical interest, and is also…
Tilo Strutz, Roman Rischke
—The transmission or storage of signals typically involves data compression. The final processing step in compression systems is generally an entropy coding stage, which converts symbols into a bit stream based on their probability distribution. A distinct class of entropy coding methods operates not by mapping input…
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…
Apiwat Magkeethum, Sukkharak Saechia, Paramote Wardkein, Luca Leonardi
The growth of Internet of Things (IoT) applications is driving demand for Low-Power Wide-Area Networks (LPWANs) to support higher data rates with the same energy efficiency. While Long Range (LoRa) provides excellent noise immunity and receiver sensitivity, its data rate might be insufficient for some applications…
Wenbo Shi, Wenlong Xie, Jiashen Hu, Lishan Liu + 1 more
Future wireless networks require channel coding schemes that can provide high reliability, low latency, and strong adaptability under finite-blocklength and structurally heterogeneous transmission scenarios. Globally coupled low-density parity-check (GC-LDPC) codes are promising for such systems because their coupled…
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…
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…
Ibrahim Nawaz, Parv Agarwal, Thomas Heinis
DNA storage is a developing field that uses DNA to archive digital data owing to its superior information density and stability. Although DNA storage has been performed on a significant scale, challenges arise from the synthesis and sequencing of data-encoded oligonucleotides. Synthesis of DNA introduces significant…
Ramy Khabbaz, Jérémy Mateos, Marc Antonini, Serge Kas Hanna
The biochemical processes underlying DNA data storage, including synthesis, amplification, and sequencing, are inherently noisy. Consequently, base-level insertion, deletion, and substitution (IDS) errors, as well as sequence-level dropouts, occur and pose major challenges for reliable data retrieval. Here we introduce…
Hsiang-Cheh Huang, Feng-Cheng Chang, Hong-Yi Li, Rabi N. Mahapatra + 1 more
With the proliferation of image-capturing and display-enabled IoT devices, ensuring the authenticity and integrity of visual data has become increasingly critical, especially in light of emerging cybersecurity threats and powerful generative AI tools. One of the major challenges in such sensor-based systems is the…
Ying Chen, Jianrong Bao, Yanhai Shang, Chao Liu + 5 more
To obtain efficient channel codes with high power efficiency at moderate signal-to-noise ratios (SNRs), an efficient high-rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is optimally constructed. By an optimized protograph template, the code framework is firstly produced by the extensions of the…
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
DNA is under constant attack by exogenous and endogenous agents that result in alkylation damage, which can lead to mutagenesis and cell death. 3-methyladenine DNA glycosylase II (AlkA) initiates the repair of many alkylated nucleotides in bacterial cells by cleaving the glycosidic bond connecting the damaged…
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…
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…
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…