Victor A. Zinoviev

According to our database1, Victor A. Zinoviev authored at least 96 papers between 1979 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On new infinite families of completely regular and completely transitive codes.
Discret. Math., April, 2024

Constructions of Nonbinary Codes Meeting the Johnson Bound.
Probl. Inf. Transm., March, 2024

On completely regular self-dual codes with covering radius ρ=2.
CoRR, 2024

2023
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals.
Probl. Inf. Transm., July, 2023

On the classification of completely regular codes with covering radius two and antipodal dual.
CoRR, 2023

2022
On One Construction Method for Hadamard Matrices.
Probl. Inf. Transm., 2022

On Codes with Distances d and n.
Probl. Inf. Transm., 2022

Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound.
Probl. Inf. Transm., 2022

2021
On the Generalized Concatenated Construction for the Nordstrom-Robinson Code and the Binary Golay Code.
Probl. Inf. Transm., 2021

On the Generalized Concatenated Construction for Codes in L<sub>1</sub> and Lee Metrics.
Probl. Inf. Transm., 2021

On two-weight codes.
Discret. Math., 2021

2020
On <i>q</i>-ary Codes with Two Distances <i>d</i> and <i>d</i> + 1.
Probl. Inf. Transm., 2020

Symmetric Block Designs and Optimal Equidistant Codes.
Probl. Inf. Transm., 2020

On completely regular and completely transitive supplementary codes.
Discret. Math., 2020

On two-weight (linear and nonlinear) codes.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
Erratum to: On Completely Regular Codes.
Probl. Inf. Transm., 2019

On Completely Regular Codes.
Probl. Inf. Transm., 2019

Editorial: Special issue on coding and cryptography.
Des. Codes Cryptogr., 2019

On q-ary codes with two distances d and d+1.
CoRR, 2019

On classical Kloosterman sums.
Cryptogr. Commun., 2019

2018
On <i>m</i>-Near-Resolvable Block Designs and <i>q</i>-ary Constant-Weight Codes.
Probl. Inf. Transm., 2018

Completely regular codes by concatenating Hamming codes.
Adv. Math. Commun., 2018

2017
Erratum to: "Remark on balanced incomplete block designs, near-resolvable block designs, and <i>q</i>-ary constant-weight codes".
Probl. Inf. Transm., 2017

Remark on balanced incomplete block designs, near-resolvable block designs, and <i>q</i>-ary constant-weight codes.
Probl. Inf. Transm., 2017

About non equivalent completely regular codes with identical intersection array.
Electron. Notes Discret. Math., 2017

Completely regular codes with different parameters giving the same distance-regular coset graphs.
Discret. Math., 2017

On Kloosterman sums over finite fields of characteristic 3.
Discret. Appl. Math., 2017

2016
Generalized Preparata codes and 2-resolvable Steiner quadruple systems.
Probl. Inf. Transm., 2016

2015
Permutation and complete permutation polynomials.
Finite Fields Their Appl., 2015

Families of nested completely regular codes and distance-regular graphs.
Adv. Math. Commun., 2015

2014
Non-full-rank Steiner quadruple systems <i>S</i>(<i>v</i>, 4, 3).
Probl. Inf. Transm., 2014

Optimal almost equisymbol codes based on difference matrices.
Probl. Inf. Transm., 2014

On a family of binary completely transitive codes with growing covering radius.
Discret. Math., 2014

Families of completely transitive codes and distance transitive graphs.
Discret. Math., 2014

Editorial: 3rd International Castle Meeting on Coding Theory and Applications.
Des. Codes Cryptogr., 2014

New families of completely regular codes and their corresponding distance regular coset graphs.
Des. Codes Cryptogr., 2014

2013
Structure of steiner triple systems <i>S</i>(2<sup>m</sup> - 1, 3, 2) of rank 2<sup>m</sup> - <i>m</i> + 2 over (𝔽<sub>2</sub>).
Probl. Inf. Transm., 2013

Remark on "Steiner triple systems <i>S</i>(2<sup>m</sup> - 1, 3, 2) of rank 2<sup>m</sup> -<i>m</i>+ 1 over (𝔽<sub>2</sub>)" published in <i>Probl. Peredachi Inf.</i>, 2012, no. 2.
Probl. Inf. Transm., 2013

On divisibility of exponential sums of polynomials of special type over fields of characteristic 2.
Des. Codes Cryptogr., 2013

2012
Steiner triple systems <i>S</i>(2<sup>m</sup> - 1, 3, 2) of rank 2<sup>m</sup> - <i>m</i>+ 1 over (𝔽<sub>2</sub>).
Probl. Inf. Transm., 2012

On two families of binary quadratic bent functions
CoRR, 2012

2011
On Lifting Perfect Codes.
IEEE Trans. Inf. Theory, 2011

Steiner systems <i>S</i>(<i>v, k, k</i> - 1): Components and rank.
Probl. Inf. Transm., 2011

2010
New completely regular q-ary codes based on Kronecker products.
IEEE Trans. Inf. Theory, 2010

Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14.
Probl. Inf. Transm., 2010

On linear q-ary completely regular codes with rho=2 and dual antipodal
CoRR, 2010

On q-ary linear completely regular codes with ρ=2 and antipodal dual.
Adv. Math. Commun., 2010

2009
On one transformation of Steiner quadruple systems <i>S</i>(<i>υ</i>, 4, 3).
Probl. Inf. Transm., 2009

Fourier-invariant pairs of partitions of finite abelian groups and association schemes.
Probl. Inf. Transm., 2009

On a class of binary linear completely transitive codes with arbitrary covering radius.
Discret. Math., 2009

Divisibility properties of classical binary Kloosterman sums.
Discret. Math., 2009

On linear completely regular codes with covering radius rho=1. Construction and classification
CoRR, 2009

2008
On Cosets of Weight 4 of BCH(2<sup>m</sup>, 8), m Even, and Exponential Sums.
SIAM J. Discret. Math., 2008

On non-antipodal binary completely regular codes.
Discret. Math., 2008

Divisibility properties of Kloosterman sums over finite fields of characteristic two.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On the Kronecker Product Construction of Completely Transitive q-Ary Codes.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007
On resolvability of Steiner systems <i>S</i>(<i>v</i> = 2<sup>m</sup>, 4, 3) of rank <i>r</i> ≤ <i>v - m</i> + 1 over (𝔽<sub>2</sub>).
Probl. Inf. Transm., 2007

On new completely regular <i>q</i>-ary codes.
Probl. Inf. Transm., 2007

On the construction of <i>q</i>-ary equidistant codes.
Probl. Inf. Transm., 2007

The divisibility modulo 24 of Kloosterman sums on <i>GF</i>(2<sup><i>m</i></sup>), <i>m</i> odd.
J. Comb. Theory A, 2007

Propagation characteristics of xx<sup>-1</sup> and Kloosterman sums.
Finite Fields Their Appl., 2007

On binary primitive BCH codes with minimum distance 8 and exponential sums.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
The coset distribution of triple-error-correcting binary primitive BCH codes.
IEEE Trans. Inf. Theory, 2006

Classification of steiner quadruple systems of order 16 and rank 14.
Probl. Inf. Transm., 2006

Binary extended perfect codes of length 16 and rank 14.
Probl. Inf. Transm., 2006

Vasil'ev codes of length <i>n</i> = 2<sup>m</sup> and doubling of Steiner systems <i>S</i>(<i>n</i>, 4, 3) of a given rank.
Probl. Inf. Transm., 2006

The Grey-Rankin bound for nonbinary codes.
Probl. Inf. Transm., 2006

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2005
On Cosets of Weight 4 of Binary BCH Codes with Minimum Distance 8 and Exponential Sums.
Probl. Inf. Transm., 2005

2004
Classification of steiner quadruple systems of order 16 and rank at most 13.
Probl. Inf. Transm., 2004

Binary Perfect Codes of Length 15 by the Generalized Concatenated Construction.
Probl. Inf. Transm., 2004

On Weight Distributions of Shifts of Goethals-like Codes.
Probl. Inf. Transm., 2004

On a new identity for Kloosterman sums and nonlinear system of equations over finite fields of characteristic 2.
Discret. Math., 2004

On q-ary Grey-Rankin bound and codes meeting this bound.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On Z<sub>4</sub>-linear Preparata-like and Kerdock-like code.
IEEE Trans. Inf. Theory, 2003

2002
Binary Extended Perfect Codes of Length 16 by the Generalized Concatenated Construction.
Probl. Inf. Transm., 2002

2001
On coset weight distributions of the Z4-linear Goethals codes.
IEEE Trans. Inf. Theory, 2001

Codes with the same coset weight distributions as the Z<sub>4</sub>-linear Goethals codes.
IEEE Trans. Inf. Theory, 2001

On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property.
IEEE Trans. Inf. Theory, 2001

Nonexistence of completely transitive codes with error-correcting capability e>3.
IEEE Trans. Inf. Theory, 2001

On completely regular binary codes and t-designs<sup>*</sup>.
Electron. Notes Discret. Math., 2001

1999
On Linear Goethals Codes and Kloosterman Sums.
Des. Codes Cryptogr., 1999

On the Minimum Distances of Non-Binary Cyclic Codes.
Des. Codes Cryptogr., 1999

1998
Three-regular Subgraphs of Four-regular Graphs'.
Eur. J. Comb., 1998

Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems.
Des. Codes Cryptogr., 1998

1997
On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes.
SIAM J. Discret. Math., 1997

On New Perfect Binary Nonlinear Codes.
Appl. Algebra Eng. Commun. Comput., 1997

F-partitions of Cyclic Groups.
Appl. Algebra Eng. Commun. Comput., 1997

1995
On several new projective curves over F<sub>2</sub> of genus 3, 4, and 5.
IEEE Trans. Inf. Theory, 1995

New constructions of optimal cyclically permutable constant weight codes.
IEEE Trans. Inf. Theory, 1995

Spherical codes generated by binary partitions of symmetric pointsets.
IEEE Trans. Inf. Theory, 1995

1993
Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs.
Proceedings of the Algebraic Coding, 1993

1992
On spherical codes generating the kissing number in dimensions 8 and 24.
Discret. Math., 1992

1990
Concatenated spherical codes.
Proceedings of the EUROCODE '90, 1990

1987
An improvement of the Gilbert bound for constant weight codes.
IEEE Trans. Inf. Theory, 1987

1979
Letter to the editor.
Discret. Math., 1979


  Loading...