13 papers · ranked by Valyu relevance
Henrique K. Miyamoto, Richard Combes, Sheng Yang
We study both the deterministic and randomised variants of noise-guessing decoding in additive memoryless channels. The error and complexity exponents of such decoding schemes are analysed under mismatched decoding metrics, and then specialised to matched, $α$-tilted, and universal decoding metrics. The $α$-tilted…
Benny Applebaum, Liron David, Guy Even
A rateless code encodes a finite length information word into an infinitely long codeword such that longer prefixes of the codeword can tolerate a larger fraction of errors. A rateless code achieves capacity for a family of channels if, for every channel in the family, reliable communication is obtained by a prefix of…
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…
Barış Göktepe, Cornelius Hellge, Tatiana Rykova, Thomas Schierl + 1 more
'Sławomir Stańczak'] Abstract—We provide a mathematical framework to analyze the limits of Hybrid Automatic Repeat reQuest (HARQ) and derive analytical expressions for the most powerful test for estimating the decodability under maximum-likelihood decoding and t-error decoding. Furthermore, we numerically approximate…
Jia Lu, Ryan Tsoi, Nan Luo, Yuanchi Ha + 8 more
Dynamical systems often generate distinct outputs according to different initial conditions, and one can infer the corresponding input configuration given an output. This property captures the essence of information encoding and decoding. Here, we demonstrate the use of self-organized patterns, combined with machine…
Ximing Fu, Shenghao Yang, Zhiqing Xiao
Decoding and repair schemes are proposed for shift-exclusive-or (shift-XOR) product-matrix (PM) regenerating codes, which outperform the existing schemes in terms of both communication and computation costs. In particular, for the shift-XOR minimum bandwidth regenerating (MBR) codes, our decoding and repair schemes…
Maria Beatriz Ramos, José Diogo Marques dos Santos, Bruno Direito, Luís Paulo Reis + 1 more
Brain decoding from fMRI data using artificial neural networks traditionally operates at the regional level, identifying which brain areas activate during tasks but ignoring how these regions interact through structural networks. While Graph Neural Networks can capture connectivity, they require prohibitively large…
Geraldo A. Barbosa
Polar encoding, described by Arikan in "IEEE Transactions on Information Theory, Vol. 55, No. 7, July 2009", was a milestone for telecommunications. A Polar code distributes information among high and low-capacity channels, showing the possibility of achieving perfect channel capacity. The high-capacity channels allow…
Martin Bossert
We present novel decoding schemes for hard and soft decision decoding of block codes using the minimal weight codewords of the dual code. The decoding schemes will be described for cyclic codes where polynomials can be used, however, the modification for non-cyclic codes is possible and straight forward. The hard…
Kevin D. Volkel, Paul W. Hook, Albert Keung, Winston Timp + 1 more
As nanopore technology reaches ever higher throughput and accuracy, it becomes an increasingly viable candidate for reading out DNA data storage. Nanopore sequencing offers considerable flexibility by allowing long reads, real-time signal analysis, and the ability to read both DNA and RNA. We need flexible and…
Maximilian Gehri, Lukas Stelzl, Heinz Koeppl
Biochemical systems process signals through stochastic reaction dynamics that are inherently continuous in time and often exhibit memory, feedback, and nonequilibrium driving. At the same time, they are frequently modeled by effective reactions, e.g., multi-step processes such as transcription are treated as single…
Inbal Preuss, Ben Galili, Zohar Yakhini, Leon Anavy
This study introduces a novel model for analyzing and determining the required sequencing coverage in DNA-based data storage, focusing on combinatorial DNA encoding. We explore the application of the coupon collector model for combinatorial-letter reconstruction, post-sequencing, which ensure efficient data retrieval…
Ian Holmes
We describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by interleaving watermark and periodic marker signals; conversion from binary to…