English
Related papers

Related papers: Sequential Decoding of Multiple Traces Over the Sy…

200 papers

In this work, we introduce convolutional codes for network-error correction in the context of coherent network coding. We give a construction of convolutional codes that correct a given set of error patterns, as long as consecutive errors…

Information Theory · Computer Science 2009-08-06 K. Prasad , B. Sundar Rajan

A pragmatic approach for the construction of space-time codes over block fading channels is investigated. The approach consists in using common convolutional encoders and Viterbi decoders with suitable generators and rates, thus greatly…

Information Theory · Computer Science 2007-07-13 Marco Chiani , Andrea Conti , Velio Tralli

An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…

Information Theory · Computer Science 2009-08-07 H. Gluesing-Luerssen , U. Helmke , J. I. Iglesias Curto

This is the second part of a series of papers on a revisit to the bidirectional Bahl-Cocke-Jelinek-Raviv (BCJR) soft-in-soft-out (SISO) maximum a posteriori probability (MAP) decoding algorithm. Part I revisited the BCJR MAP decoding…

Information Theory · Computer Science 2018-01-16 Qimin You , Yonghui Li , Soung Chang Liew , Branka Vucetic

A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in…

Information Theory · Computer Science 2012-05-22 Dung Viet Nguyen , Bane Vasic , Michael W. Marcellin

We introduce the notion of innovations for Viterbi decoding of convolutional codes. First we define a kind of innovation corresponding to the received data, i.e., the input to a Viterbi decoder. Then the structure of a…

Information Theory · Computer Science 2018-11-06 Masato Tajima

Nowadays, multivariate time series data are increasingly collected in various real world systems, e.g., power plants, wearable devices, etc. Anomaly detection and diagnosis in multivariate time series refer to identifying abnormal status in…

Recently, rate-$1/\omega$ zero-terminated and tail-biting convolutional codes (ZTCCs and TBCCs) with cyclic-redundancy-check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short…

Information Theory · Computer Science 2022-06-09 Wenhui Sui , Hengjie Yang , Brendan Towell , Ava Asmani , Richard D. Wesel

We investigate joint network and channel coding schemes for networks when relay nodes are not capable of performing channel coding operations. Rather, channel encoding is performed at the source node while channel decoding is done only at…

Information Theory · Computer Science 2011-12-12 Sarah J. Johnson , Lawrence Ong , Christopher M. Kellett

In this paper, we study the impact of locality on the decoding of binary cyclic codes under two approaches, namely ordered statistics decoding (OSD) and trellis decoding. Given a binary cyclic code having locality or availability, we…

Information Theory · Computer Science 2017-02-14 M. Nikhil Krishnan , Bhagyashree Puranik , P. Vijay Kumar , Itzhak Tamo , Alexander Barg

In this paper, we study sliding window decoding of braided convolutional codes (BCCs) in the context of a streaming application, where decoder error propagation can be a serious problem. A window extension algorithm and a resynchronization…

Information Theory · Computer Science 2018-01-11 Min Zhu , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello, , Baoming Bai

Labeling of DNA molecules is a fundamental technique for DNA visualization and analysis. This process was mathematically modeled in [1], where the received sequence indicates the positions of the used labels. In this work, we develop error…

Information Theory · Computer Science 2025-11-04 Dganit Hanania , Eitan Yaakobi

In this paper, we propose a parallel block-based Viterbi decoder (PBVD) on the graphic processing unit (GPU) platform for the decoding of convolutional codes. The decoding procedure is simplified and parallelized, and the characteristic of…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-08-02 Hao Peng , Rongke Liu , Yi Hou , Ling Zhao

Tensor ring (TR) decomposition is a simple but effective tensor network for analyzing and interpreting latent patterns of tensors. In this work, we propose a doubly randomized optimization framework for computing TR decomposition. It can be…

Numerical Analysis · Mathematics 2023-03-30 Yajie Yu , Hanyu Li , Jingchun Zhou

We construct error correcting codes for jointly transmitting a finite set of independent messages to an 'informed receiver' which has prior knowledge of the values of some subset of the messages as side information. The transmitter is…

Information Theory · Computer Science 2016-04-08 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

Linear Programming (LP) decoding is emerging as an attractive alternative to decode Low-Density Parity-Check (LDPC) codes. However, the earliest LP decoders proposed for binary and nonbinary LDPC codes are not suitable for use at moderate…

Information Theory · Computer Science 2011-02-17 Mayur Punekar , Mark F. Flanagan

Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number…

In this work, we investigate the problem of neural-based error correction decoding, and more specifically, the new so-called syndrome-based decoding technique introduced to tackle scalability in the training phase for larger code sizes. We…

Information Theory · Computer Science 2024-03-06 Gastón De Boni Rovella , Meryem Benammar

In this paper, we propose an efficient reliability based segmentation-discarding decoding (SDD) algorithm for short block-length codes. A novel segmentation-discarding technique is proposed along with the stopping rule to significantly…

Information Theory · Computer Science 2019-01-23 Chentao Yue , Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

Let G be a finite strongly connected aperiodic directed graph in which each edge carries a label from a finite alphabet A. Then G induces a trellis coded quantizer for encoding an alphabet A memoryless source. A source sequence of long…

Information Theory · Computer Science 2010-10-08 John Kieffer , Yu Liao