Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Bocharova, Irina E."'
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 practically important NB LDPC codes over extensions of the Galois field GF$
Externí odkaz:
http://arxiv.org/abs/2108.08716
Autor:
Bocharova, Irina E., Kudryashov, Boris D., Ovsyannikov, Evgenii P., Skachek, Vitaly, Uustalu, Tähvend
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 labeling the obtained base matrices aimed at maximizing the so-called gene
Externí odkaz:
http://arxiv.org/abs/2006.12147
Stopping sets play a crucial role in failure events of iterative decoders over a binary erasure channel (BEC). The $\ell$-th stopping redundancy is the minimum number of rows in the parity-check matrix of a code, which contains no stopping sets of si
Externí odkaz:
http://arxiv.org/abs/1804.06770
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 theoretical average spectrum of the Gallager ensemble is computed by u
Externí odkaz:
http://arxiv.org/abs/1709.01455
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 the BP, ML and near-ML decoding over a BEC and an AWGN channel are studi
Externí odkaz:
http://arxiv.org/abs/1707.01025
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 proposed method termed belief-propagation--list erasure decoding (BP-LED)
Externí odkaz:
http://arxiv.org/abs/1705.09507
Autor:
Bocharova, Irina E., Fàbregas, Albert Guillén i, Kudryashov, Boris D., Martinez, Alfonso, Campo, Adrià Tauste, Vazquez-Vilar, Gonzalo
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 class index. The code performance is analyzed by means of random-coding
Externí odkaz:
http://arxiv.org/abs/1410.8714
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 matrix G(D)=(1 1+D) when used to communicate over the binary symmetric chan
Externí odkaz:
http://arxiv.org/abs/1111.3820
Autor:
Bocharova, Irina E., Hug, Florian, Johannesson, Rolf, Kudryashov, Boris D., Satyukov, Roman V.
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 LDPC block codes. Using the principle of tailbiting, compact representa
Externí odkaz:
http://arxiv.org/abs/1108.0840
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 $s$-partite, $s$-uniform hypergraphs, where $s$ depends only on the code rate, there
Externí odkaz:
http://arxiv.org/abs/0804.0996