Results 41 to 50 of about 882,200 (283)
Universal decoding for arbitrary channels relative to a given class of decoding metrics [PDF]
We consider the problem of universal decoding for arbitrary unknown channels in the random coding regime. For a given random coding distribution and a given class of metric decoders, we propose a generic universal decoder whose average error probability is, within a sub-exponential multiplicative factor, no larger than that of the best decoder within ...
arxiv +1 more source
A method for constructing decodable de Bruijn sequences
We present two related methods of construction for de Bruijn (1946) sequences, both based on interleaving "smaller" de Bruijn sequences. Sequences obtained using these construction methods have the advantage that they can be "decoded" very efficiently, i.e., the position within the sequence of any particular "window" can be found very simply. Sequences
Mitchell, Chris J+2 more
openaire +11 more sources
Sequential Decoding of Convolutional Codes for Synchronization Errors [PDF]
Sequential decoding, commonly applied to substitution channels, is a sub-optimal alternative to Viterbi decoding with significantly reduced memory costs. In this work, a sequential decoder for convolutional codes over channels that are prone to insertion, deletion, and substitution errors, is described and analyzed. Our decoder expands the code trellis
arxiv
Systems theoretic methods in decoding [PDF]
In this paper we show how ideas based on system theoretic modeling of linear behaviors may be used for decoding of linear codes. In particular we show how Sudan's bivariate interpolation approach to list decoding of RS codes allows a system theoretic ...
Kuijper, M., Polderman, J.W.
core +2 more sources
Reduced complexity hard‐ and soft‐input BCH decoding with applications in concatenated codes
Error correction coding for optical communication and storage requires high rate codes that enable high data throughput and low residual errors. Recently, different concatenated coding schemes were proposed that are based on binary BCH codes with low ...
Jürgen Freudenberger+2 more
doaj +1 more source
Making tau amyloid models in vitro: a crucial and underestimated challenge
This review highlights the challenges of producing in vitro amyloid assemblies of the tau protein. We review how accurately the existing protocols mimic tau deposits found in the brain of patients affected with tauopathies. We discuss the important properties that should be considered when forming amyloids and the benchmarks that should be used to ...
Julien Broc, Clara Piersson, Yann Fichou
wiley +1 more source
Research of fast decoding for longer constraint length convolutional codes
To overcome the disadvantage of Viterbi decoding algorithm, in which its complexity exponentially increases with the increasing constraint length of convolutional codes, and the decoding delay was too large to fit the decoding of longer constraint length
HUANG Xiao-ling, YANG Hua-long
doaj +2 more sources
An efficient length- and rate-preserving concatenation of polar and repetition codes
We improve the method in \cite{Seidl:10} for increasing the finite-lengh performance of polar codes by protecting specific, less reliable symbols with simple outer repetition codes.
Huber, Johannes B., Seidl, Mathis
core +1 more source
Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression [PDF]
This paper discusses the Slepian–Wolf problem of distributed near-lossless compression of correlated sources. We introduce practical new tools for communicating at all rates in the achievable region.
Anna H. Lee+6 more
core +3 more sources
The S1025 peptide is the major antidote to the YrzI toxin, which we renamed here as SpyT (Small Peptide YrzI Toxin) and SpyA (Small Peptide YrzI Antitoxin) (1). Degradation of the toxin–antitoxin spyTA mRNA, either by a translation‐dependent cleavage by the endoribonuclease Rae1 (2) or by direct attack by 3′‐exoribonucleases (3), also contributes to ...
Laetitia Gilet+4 more
wiley +1 more source