82 citations · 109 across the 9 of their papers we have counts for
11 papers
Non-binary LDPC codes for Data Storage
Irina Bocharova, Boris Kudryashov, Henk D. L. Hollmann +1
In modern data storage systems, non-binary LDPC codes for recovering from disk failures are increasingly considered strong competitors to MDS codes such as Reed-Solomon codes. Sinc…
NB QC-LDPC Coded QAM Signals with Optimized Mapping: Bounds and Simulation Results
Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov +1
The goal of the paper is to study specific properties of nonbinary low-density parity-check (NB LDPC) codes when used in coded modulation systems. The paper is focused on the pract…
Optimization of NB QC-LDPC Block Codes and Their Performance Analysis
Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov +2
We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labe…
Stopping Redundancy Hierarchy Beyond the Minimum Distance
Yauhen Yakimenka, Vitaly Skachek, Irina E. Bocharova +1
Stopping sets play a crucial role in failure events of iterative decoders over a binary erasure channel (BEC). The -th stopping redundancy is the minimum number of rows in th…
ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms
Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek +2
The performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite-length low-density parity-check (LDPC) codes from two random ensembles is studied. The…
Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance
Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek +1
Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of th…
BP-LED decoding algorithm for LDPC codes over AWGN channels
Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek +1
A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The prop…
Multi-Class Source-Channel Coding
Irina E. Bocharova, Albert Guillén i Fàbregas, Boris D. Kudryashov +3
This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the cl…
A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes
Irina E. Bocharova, Florian Hug, Rolf Johannesson +1
In 1995, Best et al. published a formula for the exact bit error probability for Viterbi decoding of the rate R=1/2, memory m=1 (2-state) convolutional encoder with generator matri…
Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth
Irina E. Bocharova, Florian Hug, Rolf Johannesson +2
The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful L…
Woven Graph Codes: Asymptotic Performances and Examples
Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov +1
Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on -partite, $…