20 papers · ranked by Valyu relevance
Marzieh Hashemipour-Nazari, Kees Goossens, Alexios Balatsoukas‐Stimming
'Alexios Balatsoukas‐Stimming'] Abstract—The recently introduced recursive projection aggregation (RPA) decoding method for Reed-Muller (RM) codes can achieve near-maximum likelihood (ML) decoding performance. However, its high computational complexity makes its implementation challenging for time- and…
Guanchen He, Vasilisa A Kovaleva, Carl Barton, Paul G Thomas + 3 more
In this section, we describe our recursive combination approach. We show that this approach can combine short DCP-CWGCs to construct $(m,r,n=\text{min}{(mr),(mr+1)})$ DCP-CWGCs for any positive integer r and $(m\geqr+1)$. We then pair the recursive combination approach with BBA, and show that we can construct…
Martin Bossert
Hidden Code Words Authors: ['Martin Bossert'] The Plotkin construction combines two codes to a code of doubled length. It can be applied recursively. The class of Reed–Muller (RM) codes is a particular example. Also, a special class of generalized concatenated codes (GCC) can be described as recursive Plotkin…
Rodrigo San–José
We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of projective Reed-Muller codes. We show when we can decode up to the error…
Johannes Voigt, Holger Jäkel, Laurent Schmalen
— Recursive projection aggregation (RPA) decoding as introduced in [1] is a novel decoding algorithm which performs close to the maximum likelihood decoder for short-length Reed-Muller codes. Recently, an extension to RPA decoding, called sparse multi-decoder RPA (SRPA), has been proposed [2]. The SRPA approach makes…
Mikhail Kamenev
—Recursive list decoding of Reed-Muller (RM) codes, with moderate list size, is known to approach maximumlikelihood (ML) performance of short length (≤ 256) RM codes. Recursive decoding employs the Plotkin construction to split the original code into two shorter RM codes with different rates . In contrast to the…
Mikhail Kamenev
—We present a novel iterative decoding algorithm for Reed-Muller (RM) codes, which takes advantage of a graph representation of the code. Vertices of the considered grap h correspond to codewords, with two vertices being connected by an edge if and only if the Hamming distance between the corresponding codewords equals…
Adriano R. Lameira, Madeleine E. Hardus, Andrea Ravignani, Teresa Raimondi + 1 more
Recursive procedures that allow placing a vocal signal inside another of similar kind provide a neuro-computational blueprint for syntax and phonology in spoken language and human song. There are, however, no known vocal patterns among nonhuman primates arranged in self-embedded combinations that evince vocal recursion…
Valéria G. Pedrosa, Max H. M. Costa, Sangun Park
The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to…
Xu Yang, Xiaolong Shi, Langwen Lai, Congzhou Chen + 2 more
'Ming Deng'] DNA has become a popular choice for next-generation storage media due to its high storage density and stability. As the storage medium of life’s information, DNA has significant storage capacity and low-cost, low-power replication and transcription capabilities. However, utilizing long double-stranded DNA…
Morteza Shoushtari, Willie Harrison, Predrag Ivanis, Goran Djordjević
'Goran Djordjević'] Nested linear coding is a widely used technique in wireless communication systems for improving both security and reliability. Some parameters, such as the relative generalized Hamming weight and the relative dimension/length profile, can be used to characterize the performance of nested linear…
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)…
Patrick Kunzmann
Alignment searches are fast heuristic methods to identify similar regions between two sequences. This group of algorithms is ubiquitously used in a myriad of software to find homologous sequences or to map sequence reads to genomes. Often the first step in alignment searches is k-mer decomposition: listing all…
Weijie Zhou, Hanxu Hou, Shenghao Yang, Kenneth Shum
Blaum-Roth Codes are binary maximum distance separable (MDS) array codes over the binary quotient ring $(F_{2}[x]/(M_{p}(x)))$, where $(M_{p}(x)=1+x+\cdots+xp-1)$, and p is a prime number. Two existing all-erasure decoding methods for Blaum-Roth codes are the syndrome-based decoding method and the interpolation-based…
Qi Zhang, Chang Liu, Stephen Wu, Ryo Yoshida
In the last few years, de novo molecular design using machine learning has made great technical progress but its practical deployment has not been as successful. This is mostly owing to the cost and technical difficulty of synthesizing such computationally designed molecules. To overcome such barriers, various methods…
Authors not listed
Accurately modeling the dynamics of open quantum systems is critical for advancing quantum technologies, yet traditional methods often struggle with balancing accuracy and efficiency. Machine learning (ML) offers a promising alternative, particularly through recursive models that predict system evolution based on the…
Lu Xu, Yixin Ma, Rui Shi, Juanjuan Li + 2 more
'Antonio Guerrieri'] The accurate identification of channel-coding types plays a crucial role in wireless communication systems. The recognition of convolutional codes presents challenges, primarily due to their strong temporal dependencies, varying constraint lengths, and additional contamination from noise. However…
Jingcheng Zhang, Lei Chen, Jinlin Sun, Shumin Li + 5 more
DNA has emerged as a compelling archival storage medium, offering unprecedented information density and millennia-scale durability. Despite its promise, DNA-based data storage faces critical challenges due to error-prone processes during DNA synthesis, storage, and sequencing. In this study, we introduce Gungnir, a…
Willie K. Harrison, Truman Welling, Andrew Swain, Morteza Shoushtari + 1 more
Physical-layer security can aid in establishing secure telecommunication networks including cellular, Internet of Things, and telemetry networks, among others. Channel sounding techniques and/or telemetry systems for reporting channel conditions, coupled with superior wiretap code design are necessary to implement such…
Rajeev Kohli
Genetic codes assign sixty-four codons to twenty amino acids. These assignments are known to follow certain rules. One question long considered but still unresolved is if these rules are derived from an underlying structure in genetic codes. Knowledge of such structure could facilitate better understanding of the…