Vladimir N. Potapov

Orcid: 0000-0001-9461-2064

Affiliations:
  • Sobolev Institute of Mathematics, Novosibirsk, Russia


According to our database1, Vladimir N. Potapov authored at least 42 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An asymptotic lower bound on the number of bent functions.
Des. Codes Cryptogr., March, 2024

Singleton mesh patterns in multidimensional permutations.
J. Comb. Theory A, January, 2024

An upper bound on the number of frequency hypercubes.
Discret. Math., January, 2024

2023
Every latin hypercube of order 5 has transversals.
CoRR, 2023

Existence of balanced functions that are not derivative of bent functions.
CoRR, 2023

Upper bounds on the numbers of binary plateaued and bent functions.
CoRR, 2023

2022
DP-Colorings of Uniform Hypergraphs and Splittings of Boolean Hypercube into Faces.
Electron. J. Comb., 2022

2021
On Multifold Packings of Radius-1 Balls in Hamming Graphs.
IEEE Trans. Inf. Theory, 2021

On Weight Spectrum of Linear Codes.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

An Upper Bound on the Number of Bent Functions.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

2020
Graeco-Latin cubes.
Dataset, December, 2020

On q-ary bent and plateaued functions.
Des. Codes Cryptogr., 2020

2019
On the Cardinality Spectrum and the Number of Latin Bitrades of Order 3.
Probl. Inf. Transm., 2019

On shortening u-cycles and u-words for permutations.
Discret. Appl. Math., 2019

Constructions of Pairs of Orthogonal Latin Cubes.
CoRR, 2019

On the number of autotopies of an n-ary qusigroup of order 4.
CoRR, 2019

A Lower Bound on the Number of Boolean Functions with Median Correlation Immunity.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

On Minimal Distance between q-ary Plateaued Functions.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

On two-fold packings of radius-1 balls in Hamming graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2016
Gray coding cubic planar maps.
Theor. Comput. Sci., 2016

Constructions of transitive latin hypercubes.
Eur. J. Comb., 2016

To the theory of q-ary Steiner and other-type trades.
Discret. Math., 2016

On the number of transversals in latin squares.
Discret. Appl. Math., 2016

On minimal distance between q-ary bent functions.
CoRR, 2016

2015
Linear codes for an effective quantization of data.
CoRR, 2015

Gray coding planar maps.
CoRR, 2015

2014
Propelinear 1-Perfect Codes From Quadratic Functions.
IEEE Trans. Inf. Theory, 2014

Scalar-quantization-based multi-layer data hiding for video coding applications.
Proceedings of the 2014 IEEE Visual Communications and Image Processing Conference, 2014

2013
Construction of transitive MDS codes
CoRR, 2013

Transitive 1-perfect codes from quadratic functions
CoRR, 2013

What could be after HEVC?
Proceedings of the 9th International Conference on Information, 2013

2012
Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes.
Probl. Inf. Transm., 2012

On perfect 2-colorings of the q-ary n-cube.
Discret. Math., 2012

2011
On connection between reducibility of an n-ary quasigroup and that of its retracts.
Discret. Math., 2011

2010
On switching equivalence of <i>n</i>-ary quasigroups of order 4 and perfect binary codes.
Probl. Inf. Transm., 2010

2009
n-Ary Quasigroups of Order 4.
SIAM J. Discret. Math., 2009

2004
On Multifold MDS and Perfect Codes That Are Not Splittable into Onefold Codes.
Probl. Inf. Transm., 2004

Complexity: an internet resource for analysis of DNA sequence complexity.
Nucleic Acids Res., 2004

Redundancy estimates for the Lempel-Ziv algorithm of data compression.
Discret. Appl. Math., 2004

2003
Internet-Available Software Packages for Analysis of DNA Sequence Complexity.
Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Scienes, 2003

2002
Construction of stochastic context trees for genetical texts.
Silico Biol., 2002

1999
Rapid Encoding of Run Lengths and Pyramid Cubic Lattices.
IEEE Trans. Inf. Theory, 1999


  Loading...