Zobrazeno 1 - 10
of 6 152
pro vyhledávání: '"A. A. Korkin"'
Autor:
Regavim, Shvo
Let $\lambda_k$ denote the $k$-th successive minimum of a lattice $L$. We study properties of the lengths of certain bases of $L$. If $v_1, \dots v_n$ is a basis which is reduced in the sense of Minkowski we show that $\lvert v_k \rvert^2 \leq \frac{
Externí odkaz:
http://arxiv.org/abs/2106.03183
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Usatyuk, Vasily
In article present measure code distance algorithm of binary and ternary linear block code using block Korkin-Zolotarev (BKZ). Proved the upper bound on scaling constant for measure code distance of non-systematic linear block code using BKZ-method f
Externí odkaz:
http://arxiv.org/abs/1511.00125
Autor:
Usatyuk, Vasily
This article present a application of Block Korkin---Zolotarev lattice reduction method for Lattice Reduction---Aided decoding under MIMO---channel. We give a upper bound estimate on the lattice reduced by block Korkin---Zolotarev method (BKZ) for di
Externí odkaz:
http://arxiv.org/abs/1405.3599
Autor:
Akhiezer, N. I.
This is an English translation of the paper in which N. I. Akhiezer discovered his famous orthogonal polynomials on two intervals in a connection with a generalization of the Korkin-Zolotarev (Korkine-Zolotaref) problem (see the small commentary by P
Externí odkaz:
http://arxiv.org/abs/1401.5642
Autor:
Usatyuk, Vasily
This article present a parallel CPU implementation of Kannan algorithm for solving shortest vector problem in Block Korkin-Zolotarev lattice reduction method. Implementation based on Native POSIX Thread Library and show linear decrease of runtime fro
Externí odkaz:
http://arxiv.org/abs/1304.1900
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:
Pendavingh, R. A.1 rudi@win.tue.nl, Van Zwam, S. H. M.1 svzwam@win.tue.nl
Publikováno v:
SIAM Journal on Optimization. 2007, Vol. 18 Issue 1, p364-378. 15p. 3 Charts.