21 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…
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…
Nithin Nagaraj, Arun Somani
Error detection is a fundamental need in most computer networks and communication systems in order to combat the effect of noise. Error detection techniques have also been incorporated with lossless data compression algorithms for transmission across communication networks. In this paper, we propose to incorporate a…
David Kracht, Steffen Schober
Background Barcode multiplexing is a key strategy for sharing the rising capacity of next-generation sequencing devices: Synthetic DNA tags, called barcodes, are attached to natural DNA fragments within the library preparation procedure. Different libraries, can individually be labeled with barcodes for a joint…
Uzi Pereg, Yossef Steinberg
We study the arbitrarily varying relay channel, which models communication with relaying in the presence of an active adversary. We establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under…
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…
Fatemeh Hosseinigoki, Oliver Kosut
In this paper, we determine the capacity of the Gaussian arbitrarily-varying channel with a (possibly stochastic) encoder and a deterministic list-decoder under the average probability of error criterion. We assume that both the legitimate and the adversarial signals are restricted by their power constraints. We also…
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…
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…
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…
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…
Authors not listed
Strong coupling and environmental memory render many open quantum systems intractable to classical computation. To overcome this barrier, we present a variational quantum algorithm capable of solving generalized form time-local quantum master equations directly on Noisy Intermediate-Scale Quantum (NISQ) processors. Our…