15 papers · ranked by Valyu relevance
Predrag Ivaniš, Srdjan Brkić, Bane Vasić, Syed A. Jafar
We propose a novel variant of the gradient descent bit-flipping (GDBF) algorithm for decoding low-density parity-check (LDPC) codes over the binary symmetric channel. The new bit-flipping rule is based on the reliability information passed from neighboring nodes in the corresponding Tanner graph. The name…
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…
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…
Henrique K. Miyamoto, Sheng Yang
—We study universal decoding over parametric discrete additive channels. Our decoders are variants of noise guessing decoders that use estimators for the probability of a noise sequence, when the actual channel law is unknown. A deterministic version produces noise sequences in a fixed order, and a randomised one draws…
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…
Martin Bossert, Rebekka Schulz, Sebastian Bitzer
—The binary primitive BCH codes are cyclic and are constructed by choosing a subset of the cyclotomic cosets. Which subset is chosen determines the dimension, the minimum distance and the weight distribution of the BCH code. We construct possible BCH codes and determine their coderate, true minimum distance and the…
Neri Merhav, Alex Dytso, Luca Barletta
We consider the problem of encoding a deterministic source sequence (i.e., individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite-state machines. Our first main result is a necessary condition for both reliable and secure transmission in terms of…
Thach V. Bui
Neural coding is an important tool to discover the inner workings of mind. In this work, we propose and consider a simple but novel self-decoding model for neural coding based on the principle that the neuron body represents ongoing stimulus while dendrites are used to store that stimulus as a memory. In particular…
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…
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…
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…
Niklas Gassner, Julia Lieb, Abhinaba Mazumder, Michael Schaller
In this paper, we present a framework for generic decoding of convolutional codes, which allows us to do cryptanalysis of code-based systems that use convolutional codes as public keys. We then apply this framework to information set decoding, study success probabilities and give tools to choose variables. Finally, we…
Licheng Mao, Shenghao Yang, Xuan Huang, Yanyan Dong + 1 more
Systematic codes are of important practical interest for communications. Network coding, however, seems to conflict with systematic codes: although the source node can transmit message packets, network coding at the intermediate network nodes may significantly reduce the number of message packets received by the…
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…