Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Riazanov, Andrii"'
We revisit the linear programming bounds for the size vs. distance trade-off for binary codes, focusing on the bounds for the almost-balanced case, when all pairwise distances are between $d$ and $n-d$, where $d$ is the code distance and $n$ is the b
Externí odkaz:
http://arxiv.org/abs/2107.07672
The Shannon capacity of a graph is a fundamental quantity in zero-error information theory measuring the rate of growth of independent sets in graph powers. Despite being well-studied, this quantity continues to hold several mysteries. Lov\'asz famou
Externí odkaz:
http://arxiv.org/abs/2009.05685
Let $W$ be a binary-input memoryless symmetric (BMS) channel with Shannon capacity $I(W)$ and fix any $\alpha > 0$. We construct, for any sufficiently small $\delta > 0$, binary linear codes of block length $O(1/\delta^{2+\alpha})$ and rate $I(W)-\de
Externí odkaz:
http://arxiv.org/abs/1911.03858
We say a subset $C \subseteq \{1,2,\dots,k\}^n$ is a $k$-hash code (also called $k$-separated) if for every subset of $k$ codewords from $C$, there exists a coordinate where all these codewords have distinct values. Understanding the largest possible
Externí odkaz:
http://arxiv.org/abs/1805.04151
Publikováno v:
In Journal of Combinatorial Theory, Series A May 2022 188
Publikováno v:
2018 Annual American Control Conference (ACC)
Belief Propagation algorithms are instruments used broadly to solve graphical model optimization and statistical inference problems. In the general case of a loopy Graphical Model, Belief Propagation is a heuristic which is quite successful in practi
Externí odkaz:
http://arxiv.org/abs/1710.07600
Autor:
Riazanov, Andrii, Vyalyiy, Mikhail
The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this polytope.
Externí odkaz:
http://arxiv.org/abs/1704.06507
Publikováno v:
Information Technology and Systems 2016, Sep 2016, Repino, St. Petersburg, Russia. pp.561-568
This paper presents a method of reconstruction a primary structure of a protein that folds into a given geometrical shape. This method predicts the primary structure of a protein and restores its linear sequence of amino acids in the polypeptide chai
Externí odkaz:
http://arxiv.org/abs/1701.00673
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.