Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Usatyuk, Vasiliy"'
This paper introduces a novel approach to enumerate and assess Trapping sets in quasi-cyclic codes, those with circulant sizes that are non-prime numbers. Leveraging the quasi-cyclic properties, the method employs a tabular technique to streamline th
Externí odkaz:
http://arxiv.org/abs/2401.14810
This paper presents a method for achieving equilibrium in the ISING Hamiltonian when confronted with unevenly distributed charges on an irregular grid. Employing (Multi-Edge) QC-LDPC codes and the Boltzmann machine, our approach involves dimensionall
Externí odkaz:
http://arxiv.org/abs/2401.14749
The paper introduces the application of information geometry to describe the ground states of Ising models by utilizing parity-check matrices of cyclic and quasi-cyclic codes on toric and spherical topologies. The approach establishes a connection be
Externí odkaz:
http://arxiv.org/abs/2307.15778
Autor:
Usatyuk, Vasiliy
We modified Cole's Importance Sampling (IS) method for enumerating of Trapping Sets (TS, asymmetric subgraphs) causing an error under message-passing decoder. Proposed Cole's IS modifications based on combination of several ideas: parallel TS impulse
Externí odkaz:
http://arxiv.org/abs/2208.05795
In this Phd thesis discusses modern methods for constructing MET QC-LDPC codes with a given error correction ("waterfall, error-floor") and complexity (parallelism level according circulant size plus scheduler orthogonality of checks) profiles: 1. we
Externí odkaz:
http://arxiv.org/abs/2011.14753
In the given paper we present a novel approach for constructing a QC-LDPC code of smaller length by lifting a given QC-LDPC code. The proposed method can be considered as a generalization of floor lifting. Also we prove several probabilistic statemen
Externí odkaz:
http://arxiv.org/abs/1701.07521
Autor:
Usatyuk, Vasiliy
Short survey about code on the graph by example of hardware friendly quasi-cycle LDPC code. We consider two main properties of code: weight enumerator (well known from classic code theory) and Trapping sets pseudocodewords weight spectrum (a subgraph
Externí odkaz:
http://arxiv.org/abs/1511.00133
Autor:
Usatyuk, Vasiliy
This article present a concise estimate of upper and lower bound on the cardinality containing shortest vector in a lattice reduced by block Korkin-Zolotarev method (BKZ) for different value of the block size. Paper show how density affect to this ca
Externí odkaz:
http://arxiv.org/abs/1302.4062
Autor:
Usatyuk, Vasiliy
We propose a practical algorithm for block Korkin-Zolotarev reduction, a concept introduced by Schnorr, using CPU arbitrary length Householder QR-decomposition for orthogonalization and double precision OpenCL GPU Finke-Post shortest vector enumerati
Externí odkaz:
http://arxiv.org/abs/1210.6502
Autor:
Usatyuk, Vasiliy
This article presets a review of lattice lattice basis reduction types. Paper contains the main five types of lattice basis reduction: size reduced (weak Hermit), c-reduced, Lovasz condition, Hermit-Korkin-Zolotarev, Minkowski reduced. The article pr
Externí odkaz:
http://arxiv.org/abs/1210.6494