activity
20052026
most citedLinear-Programming Decoding of Nonbinary Linear Codes

67 citations · 195 across the 36 of their papers we have counts for

collaborators
Showing 2017 · cs.ITShow all

5 papers · 2 filters

cs.IT2017★ 1 cited

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…

cs.IT2017

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…

cs.IT2017

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…

cs.IT2017★ 1 cited

Explicit Constructions and Bounds for Batch Codes with Restricted Size of Reconstruction Sets

Eldho K. Thomas, Vitaly Skachek

Linear batch codes and codes for private information retrieval (PIR) with a query size and a restricted size of the reconstruction sets are studied. New bounds on the param…

cs.IT2017

Two-Party Function Computation on the Reconciled Data

Ivo Kubjas, Vitaly Skachek

In this paper, we initiate a study of a new problem termed function computation on the reconciled data, which generalizes a set reconciliation problem in the literature. Assume a d…