Zobrazeno 1 - 10
of 88
pro vyhledávání: '"Victor Zinoviev"'
Autor:
Victor Zinoviev, Dmitrii Zinoviev
Publikováno v:
Problems of Information Transmission. 57:70-83
We consider a generalized concatenated construction for error-correcting codes over the q-ary alphabet in the modulus metric L1 and Lee metric L. Resulting codes have arbitrary length, arbitrary distance (independently of the alphabet size), and can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14ab263f6a51002a52feeba77e776de1
https://doi.org/10.1134/s003294602101004x
https://doi.org/10.1134/s003294602101004x
Publikováno v:
Problems of Information Transmission. 56:245-252
We prove that any symmetric block design (v, k, λ) generates optimal ternary and quaternary constant-weight equidistant codes, whose parameters n, N, w, d, q are uniquely determined by the parameters of the block design. For one rather special case,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ad3576a28eff1fcca6c928f017cb14f
https://doi.org/10.1134/s0032946020030023
https://doi.org/10.1134/s0032946020030023
Publikováno v:
Problems of Information Transmission. 56:33-44
We consider q-ary block codes with exactly two distances: d and d + 1. Several constructions of such codes are given. In the linear case, we show that all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b56fc8c7fd81fd950115c29baa810e30
https://doi.org/10.1134/s0032946020010044
https://doi.org/10.1134/s0032946020010044
Autor:
Victor Zinoviev
Publikováno v:
Cryptography and Communications. 11:461-496
It is a survey on the Kloosterman sums. We consider the known results on the classical Kloosterman sums, i.e. the Kloosterman sums over the finite fields $\mathbb {F}_{q}$ of order q = pm, p ≥ 2 is prime.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41c1635a47885cf4bf22ce21672c30e7
https://doi.org/10.1007/s12095-019-00357-7
https://doi.org/10.1007/s12095-019-00357-7
Autor:
Josep Rifà, Victor Zinoviev
Publikováno v:
Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Recercat. Dipósit de la Recerca de Catalunya
instname
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Recercat. Dipósit de la Recerca de Catalunya
instname
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a, b, we construct completely transitive codes over different fields with covering ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9734cd313228754ff609ef4c9eff4284
http://hdl.handle.net/2072/414089
http://hdl.handle.net/2072/414089
Publikováno v:
ACCT
We consider q-ary (linear and nonlinear) block codes with exactly two distances: d and d+δ. We obtain, as a necessary condition, a quadratic equation which relates the length n of the code to the remaining parameters. We also obtain upper bounds for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00598296b0c56fba4331f1d443a55c32
https://doi.org/10.1109/acct51235.2020.9383353
https://doi.org/10.1109/acct51235.2020.9383353
Publikováno v:
Problems of Information Transmission. 54:245-252
We introduce m-near-resolvable block designs. We establish a correspondence between such block designs and a subclass of (optimal equidistant) q-ary constant-weight codes meeting the Johnson bound. We present constructions of m-near-resolvable block
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59be78807fd59c893858b968c3875c23
https://doi.org/10.1134/s0032946018030031
https://doi.org/10.1134/s0032946018030031
Autor:
Victor Zinoviev, J. Rif
Publikováno v:
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Universitat Autònoma de Barcelona
We construct several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a,b, we construct completely transitive codes over different fields with covering
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81829d264f47a981260b4ffb607a6992
https://doi.org/10.1016/j.disc.2017.03.001
https://doi.org/10.1016/j.disc.2017.03.001
Publikováno v:
Discrete Mathematics. 344:112318
We consider q -ary (linear and nonlinear) block codes with exactly two distances: d and d + δ . We derive necessary conditions for existence of such codes (similar to the known conditions in the projective case). In the linear (but not necessary pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30a473a2378e6db1a2c53d99736b4516
https://doi.org/10.1016/j.disc.2021.112318
https://doi.org/10.1016/j.disc.2021.112318
Autor:
Victor Zinoviev, L. A. Bassalygo
Publikováno v:
Discrete Applied Mathematics. 216:518-523
We study the divisibility by 3 k of Kloosterman sums K ( a ) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k , such that 3 k divides the Kloosterman sum K ( a ) . This gives a new test for zeros of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84fb9c2fafc61c9d9cf92dda1baeae16
https://doi.org/10.1016/j.dam.2016.03.020
https://doi.org/10.1016/j.dam.2016.03.020