Zobrazeno 1 - 10
of 124
pro vyhledávání: '"Bezzateev, Sergey"'
Autor:
Ometov, Aleksandr, Petrov, Vitaly, Bezzateev, Sergey, Andreev, Sergey, Koucheryavy, Yevgeni, Gerla, Mario
The unprecedented proliferation of smart devices together with novel communication, computing, and control technologies have paved the way for the Advanced Internet of Things~(A-IoT). This development involves new categories of capable devices, such
Externí odkaz:
http://arxiv.org/abs/1901.06977
Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to t
Externí odkaz:
http://arxiv.org/abs/1301.6231
Autor:
Zeh, Alexander, Bezzateev, Sergey
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated explicitly. We
Externí odkaz:
http://arxiv.org/abs/1206.4976
Autor:
Zeh, Alexander, Bezzateev, Sergey
Publikováno v:
IEEE International Symposium on Information Theory (ISIT) (2012) 2896-2900
A new approach to bound the minimum distance of $q$-ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a second cyclic c
Externí odkaz:
http://arxiv.org/abs/1204.4563
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our b
Externí odkaz:
http://arxiv.org/abs/1105.1894
Autor:
Bezzateev, Sergey, Shekhunova, Natalia
q-ary cumulative-separable $\Gamma(L,G^{(j)})$-codes $L=\{ \alpha \in GF(q^{m}):G(\alpha )\neq 0 \}$ and $G^{(j)}(x)=G(x)^{j}, 1 \leq i\leq q$ are considered. The relation between different codes from this class is demonstrated. Improved boundaries o
Externí odkaz:
http://arxiv.org/abs/1005.1524
Autor:
Bezzateev, Sergey, Shekhunova, Natalia
It is shown that subclasses of separable binary Goppa codes, $\Gamma(L,G)$ - codes, with $L=\{\alpha \in GF(2^{2l}):G(\alpha)\neq 0 \}$ and special Goppa polynomials G(x) can be presented as a chain of embedded codes. The true minimal distance has be
Externí odkaz:
http://arxiv.org/abs/0707.4083
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.
Publikováno v:
Cryptography (2410-387X); Sep2023, Vol. 7 Issue 3, p33, 16p
Autor:
Ometov, Aleksandr, Bardinova, Yulia, Afanasyeva , Alexandra, Masek, Pavel, Zhidanov, Konstantin, Sayfullin, Mikhail, Shubina, Viktoriia, Komarov, Mikhail, Bezzateev, Sergey
The blockchain technology is currently penetrating different areas of the modern Information and Communications Technology community. Most of the devices involved in blockchain-related processes are specially designed targeting only the mining aspect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2659::3a40be445b5d5bdcd5470778b2dbf866
https://zenodo.org/record/3894422
https://zenodo.org/record/3894422