activity
20122019
most citedAsymptotic enumeration of sparse uniform hypergraphs with given degrees

16 citations · 32 across the 19 of their papers we have counts for

collaborators
Showing 2016Show all

2 papers · 1 filter

cs.IT2016★ 1 cited

Proof of tightness of Varshamov - Gilbert bound for binary codes

Vladimir Blinovsky

We prove tightness of right logarithmic asymptotic of Varshamov- Gilbert bound for linear binary codes We find general asymptotic coding bound for linear codes

math.CO2016

Solution of Hypergraph Turan problem

Vladimir Blinovsky

Using original {\it Symmetrical Smoothing Method} we solve - hypergraph Turan problem