10 papers · ranked by Valyu relevance
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…
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…
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…
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…