The following pages link to Vladimir Blinovsky (Q311511):
Displayed 50 items.
- Item:Q311511 (redirect page) (← links)
- Item:Q311511 (redirect page) (← links)
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees (Q311513) (← links)
- Proof of one inequality in identification theory (Q375958) (← links)
- Remark on one problem in extremal combinatorics (Q376113) (← links)
- Asymptotic enumeration of sparse uniform hypergraphs with given degrees (Q499481) (← links)
- Item:Q311511 (redirect page) (← links)
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere (Q650105) (← links)
- Item:Q311511 (redirect page) (← links)
- Plotkin bound generalization to the case of multiple packings (Q734281) (← links)
- BSC reliability function under list decoding (Q764083) (← links)
- Intersection theorem for finite permutations (Q764250) (← links)
- Remark on the reliability function of a symmetric channel under list decoding (Q764384) (← links)
- Maximal sets of numbers not containing \(k+1\) pairwise coprimes and having divisors from a specified set of primes (Q855861) (← links)
- Asymptotically exact uniform bounds for spectra of cosets of linear codes (Q917523) (← links)
- Lectures on advances in combinatorics (Q929393) (← links)
- Multiple packing in sum-type metric spaces (Q947090) (← links)
- On the convexity of a function in coding theory (Q950709) (← links)
- A proof of one correlation inequality (Q1049392) (← links)
- Bounds for codes in the case of list decoding of finite volume (Q1090661) (← links)
- Lower asymptotic bound on the number of linear code words in a sphere of given radius in \(F_ q^ n\). (Q1098823) (← links)
- Lower bound on error probability in fixed-volume list decoding (Q1190024) (← links)
- List decoding (Q1199579) (← links)
- An estimate for the probability of undetected error. (Q1389279) (← links)
- Large deviation principle for the border of a random Young diagram (Q1567729) (← links)
- Item:Q311511 (redirect page) (← links)
- Lower bound for the linear multiple packing of the binary Hamming space (Q1586134) (← links)
- New approach to estimation of the decoding error probability (Q1812333) (← links)
- Random Young diagram, variational method, and related problems (Q1812351) (← links)
- Size of the largest antichain in a partition poset (Q1812372) (← links)
- Uniform estimate for a spectrum of a linear code (Q1812375) (← links)
- Error probability exponent of list decoding at low rates (Q1812387) (← links)
- A remark on the problem of nonnegative \(k\)-subset sums (Q1945146) (← links)
- Asymptotical properties of linear codes (Q1970696) (← links)
- Proof of two conjectures on correlation inequalities for one class of monotone functions (Q2263011) (← links)
- Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture (Q2352636) (← links)
- Fractional matchings in hypergraphs (Q2355661) (← links)
- Large deviations in quantum information theory (Q2388460) (← links)
- Random sphere packing (Q2432957) (← links)
- Code bounds for multiple packings over a nonbinary finite alphabet (Q2577280) (← links)
- Weight distribution moments of random linear/coset codes (Q2638422) (← links)
- Covering the Hamming space with sets translated by linear code vectors (Q2640570) (← links)
- (Q2857335) (← links)
- On the Number of Step Functions with Restrictions (Q3429706) (← links)
- (Q3433957) (← links)
- Correlation Inequalities in Function Spaces (Q3439230) (← links)
- Multiple Packing in Sum-type Metric Spaces (Q3439231) (← links)
- Classical Capacity of Classical-Quantum Arbitrarily Varying Channels (Q3548139) (← links)
- (Q3576714) (← links)
- (Q3737375) (← links)