V. S. Usatyuk

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 cardinality, in form of the ratio of shortest vector size and sucessive minimal. Moreover we give upper(More)
A) , (L J regular QC-LDPC code of length N is defined by a parity-check matrix L L p I p I p I p I p I p I p I p I p I H     (1) where 1 1    J j , 1 1    L l and   l j p I , represents the p p  circulant permutation matrix obtained by cyclically right-shifting the p p  identity matrix   0 I by l j p , positions, with. / L N p  For a(More)
—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 statements concerning a theoretical improvement of the method with respect to the number of small cycles. Making(More)
  • 1