Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Irina E. Bocharova"'
Autor:
Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov, Vitaly Skachek, Tahvend Uustalu
Publikováno v:
IEEE Transactions on Communications. 70:2964-2976
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Autor:
Irina E. Bocharova, Henk D. L. Hollmann, Karan Khathuria, Boris D. Kudryashov, Vitaly Skachek
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Publikováno v:
IEEE Transactions on Information Theory. :1-1
Publikováno v:
ISIT
Properties of non-binary (NB) LDPC codes used in conjunction with coded modulation systems are studied. It is observed that the performance of the NB LDPC coded transmission schemes strongly depends on the mapping between the NB symbols and the signa
Publikováno v:
ISIT
A new “Weighted Bit-flipping” (WBF) iterative decoder is presented and analyzed with respect to its Decoding Failure Rate (DFR). We show that the DFR is indeed lower than that of the BGF decoder as suggested by the BIKE third round submission to
Autor:
Irina E. Bocharova, Maben Rabi, Boris D. Kudryashov, Erik Frick, Alexey Vinel, Wouter Dankers, Nikita Lyamin
Publikováno v:
IEEE Transactions on Vehicular Technology. 68:8347-8358
To enable testing and performance evaluation of new connected and autonomous driving functions, it is important to characterize packet losses caused by degradation in vehicular (V2X) communication channels. In this paper we suggest an approach to con
Publikováno v:
IEEE Transactions on Information Theory. 65:3724-3737
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
Publikováno v:
IEEE Transactions on Communications. 67:1754-1769
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. A tightened union-type upper bound on the ML decoding error probability ba
Autor:
Evgenii P. Ovsyannikov, Boris D. Kudryashov, Irina E. Bocharova, Tahvend Uustalu, Vitaly Skachek
Publikováno v:
ITW
We propose a novel approach for optimization of nonbinary (NB) quasi-cyclic (QC)-LDPC codes. In this approach, the base parity-check matrices are constructed by the simulated annealing method, and then labeled while maximizing the so-called generaliz