Victor A. Zinoviev

Discret. Math., April, 2024

2023

On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals.

[BibT_eX]

[DOI]

Probl. Inf. Transm., July, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

2022

On One Construction Method for Hadamard Matrices.

[BibT_eX]

[DOI]

Mercè Villanueva

Probl. Inf. Transm., 2022

On Codes with Distances d and n.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2022

Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound.

[BibT_eX]

[DOI]

Vladimir S. Lebedev

Probl. Inf. Transm., 2022

2021

On the Generalized Concatenated Construction for the Nordstrom-Robinson Code and the Binary Golay Code.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2021

On the Generalized Concatenated Construction for Codes in L1 and Lee Metrics.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2021

On two-weight codes.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

On q-ary Codes with Two Distances d and d + 1.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2020

Symmetric Block Designs and Optimal Equidistant Codes.

[BibT_eX]

[DOI]

Vladimir S. Lebedev

Probl. Inf. Transm., 2020

On completely regular and completely transitive supplementary codes.

[BibT_eX]

[DOI]

Discret. Math., 2020

On two-weight (linear and nonlinear) codes.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019

Erratum to: On Completely Regular Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2019

On Completely Regular Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2019

Editorial: Special issue on coding and cryptography.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

On classical Kloosterman sums.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

2018

On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes.

[BibT_eX]

[DOI]

Vladimir S. Lebedev

Probl. Inf. Transm., 2018

Completely regular codes by concatenating Hamming codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2018

2017

Erratum to: "Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes".

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2017

Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2017

About non equivalent completely regular codes with identical intersection array.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Completely regular codes with different parameters giving the same distance-regular coset graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

On Kloosterman sums over finite fields of characteristic 3.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Generalized Preparata codes and 2-resolvable Steiner quadruple systems.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2016

2015

Permutation and complete permutation polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Families of nested completely regular codes and distance-regular graphs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

2014

Non-full-rank Steiner quadruple systems S(v, 4, 3).

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2014

Optimal almost equisymbol codes based on difference matrices.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2014

On a family of binary completely transitive codes with growing covering radius.

[BibT_eX]

[DOI]

Discret. Math., 2014

Families of completely transitive codes and distance transitive graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

Editorial: 3rd International Castle Meeting on Coding Theory and Applications.

[BibT_eX]

[DOI]

Mercè Villanueva

Des. Codes Cryptogr., 2014

New families of completely regular codes and their corresponding distance regular coset graphs.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

2013

Structure of steiner triple systems S(2m - 1, 3, 2) of rank 2m - m + 2 over (𝔽2).

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

Remark on "Steiner triple systems S(2m - 1, 3, 2) of rank 2m -m+ 1 over (𝔽2)" published in Probl. Peredachi Inf., 2012, no. 2.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

On divisibility of exponential sums of polynomials of special type over fields of characteristic 2.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

2012

Steiner triple systems S(2m - 1, 3, 2) of rank 2m - m+ 1 over (𝔽2).

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

On two families of binary quadratic bent functions

[BibT_eX]

[DOI]

CoRR, 2012

2011

On Lifting Perfect Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Steiner systems S(v, k, k - 1): Components and rank.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2011

2010

New completely regular q-ary codes based on Kronecker products.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2010

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

[BibT_eX]

[DOI]

CoRR, 2010

On q-ary linear completely regular codes with ρ=2 and antipodal dual.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2010

2009

On one transformation of Steiner quadruple systems S(υ, 4, 3).

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2009

Fourier-invariant pairs of partitions of finite abelian groups and association schemes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2009

On a class of binary linear completely transitive codes with arbitrary covering radius.

[BibT_eX]

[DOI]

Discret. Math., 2009

Divisibility properties of classical binary Kloosterman sums.

[BibT_eX]

[DOI]

Discret. Math., 2009

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

[BibT_eX]

[DOI]

CoRR, 2009

2008

On Cosets of Weight 4 of BCH(2m, 8), m Even, and Exponential Sums.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

On non-antipodal binary completely regular codes.

[BibT_eX]

[DOI]

Discret. Math., 2008

Divisibility properties of Kloosterman sums over finite fields of characteristic two.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On the Kronecker Product Construction of Completely Transitive q-Ary Codes.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007

On resolvability of Steiner systems S(v = 2m, 4, 3) of rank r ≤ v - m + 1 over (𝔽2).

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2007

On new completely regular q-ary codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2007

On the construction of q-ary equidistant codes.

[BibT_eX]

[DOI]

Galina T. Bogdanova

Todor Todorov

Probl. Inf. Transm., 2007

The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2007

Propagation characteristics of xx-1 and Kloosterman sums.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2007

On binary primitive BCH codes with minimum distance 8 and exponential sums.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

The coset distribution of triple-error-correcting binary primitive BCH codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Classification of steiner quadruple systems of order 16 and rank 14.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2006

Binary extended perfect codes of length 16 and rank 14.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2006

Vasil'ev codes of length n = 2m and doubling of Steiner systems S(n, 4, 3) of a given rank.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2006

The Grey-Rankin bound for nonbinary codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2006

On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2005

2004

Classification of steiner quadruple systems of order 16 and rank at most 13.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2004

Binary Perfect Codes of Length 15 by the Generalized Concatenated Construction.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2004

On Weight Distributions of Shifts of Goethals-like Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2004

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

[BibT_eX]

[DOI]

Discret. Math., 2004

On q-ary Grey-Rankin bound and codes meeting this bound.

[BibT_eX]

[DOI]

Stefan M. Dodunekov

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

On Z4-linear Preparata-like and Kerdock-like code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

2002

Binary Extended Perfect Codes of Length 16 by the Generalized Concatenated Construction.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2002

2001

On coset weight distributions of the Z4-linear Goethals codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Codes with the same coset weight distributions as the Z4-linear Goethals codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property.

[BibT_eX]

[DOI]

Aimo Tietäväinen

IEEE Trans. Inf. Theory, 2001

Nonexistence of completely transitive codes with error-correcting capability e>3.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

On completely regular binary codes and t-designs*.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

1999

On Linear Goethals Codes and Kloosterman Sums.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1999

On the Minimum Distances of Non-Binary Cyclic Codes.

[BibT_eX]

[DOI]

Aimo Tietäväinen

Des. Codes Cryptogr., 1999

1998

Three-regular Subgraphs of Four-regular Graphs'.

[BibT_eX]

[DOI]

Oscar Moreno

Eur. J. Comb., 1998

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

[BibT_eX]

[DOI]

Claude Carlet

Des. Codes Cryptogr., 1998

1997

On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

On New Perfect Binary Nonlinear Codes.

[BibT_eX]

[DOI]

Antoine Lobstein

Appl. Algebra Eng. Commun. Comput., 1997

F-partitions of Cyclic Groups.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1997

1995

On several new projective curves over F2 of genus 3, 4, and 5.

[BibT_eX]

[DOI]

Oscar Moreno

IEEE Trans. Inf. Theory, 1995

New constructions of optimal cyclically permutable constant weight codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Spherical codes generated by binary partitions of symmetric pointsets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1993

Some sufficient conditions for 4-regular graphs to have 3-regular subgraphs.

[BibT_eX]

[DOI]

Oscar Moreno

Proceedings of the Algebraic Coding, 1993

1992

On spherical codes generating the kissing number in dimensions 8 and 24.

[BibT_eX]

[DOI]

Discret. Math., 1992

1990

Concatenated spherical codes.

[BibT_eX]

[DOI]

Proceedings of the EUROCODE '90, 1990

1987

An improvement of the Gilbert bound for constant weight codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1987

1979

Letter to the editor.

[BibT_eX]

[DOI]