V.N.Potapov. epsilon-Entropy of compacta in C, and tabulation of continuous functions // Siberian Math. J. 38 (1997), no. 4, 759–771. .pdf
R.E.Krichevskii, V.N.Potapov. Encoding of run lengths and pyramid cubic lattices // IEEE Trans. Inform. Theory. 1999. V. 45, N. 4. P. 1347--1350. .pdf
V.N.Potapov. Redundancy estimates for the Lempel-Ziv algorithm of data compression // Discrete Appl. Math. 2004. V. 135, N 1-3. P. 245--254. .pdf
Y.L.Orlov, V.P.Filippov, V.N.Potapov, N.A.Kolchanov. Construction of stochastic context trees for genetic texts // In Silico Biology. 2002. v. 2, N. 3. P. 233--247.
Krotov D.S., Potapov V.N. On multifold MDS and perfect codes that are not splittable into onefold codes // Problems of Information Transmission. 2004. V. 40, N 1. P. 5--12. .pdf
Y.L.Orlov, V.N.Potapov. Complexity: an internet resource for analysis of DNA sequence complexity // Nucl. Acids. Res. 2004. V. 32. P. 628-633.
V.N.Potapov, D.S.Krotov. Asymptotics of the number of n-quasigroups of order 4 // Siberian Math. J. 47 (2006), no. 4, 720–731. .pdf
V. N.Potapov. A lower bound for the number of transitive perfect codes // Journal of Applied and Industrial Mathematics. 2007. V.1, N 3. P. 373-379. .pdf
D.S.Krotov, V.N.Potapov, P.V.Sokolova. On reconstructing reducible n-ary quasigroups and switching subquasigroups. // Quasigroups and Related Systems. 2008. V. 16. P. 55--67. .pdf
D.S.Krotov, V.N.Potapov. n-Ary quasigroups of order 4 // SIAM J. Discrete Math. 2009. V. 23, N 2. P. 561--570. .pdf
Krotov D.S., Potapov V.N. Switching equivalence of n-ary quasigroups of order 4 and perfect binary codes // Problems of Information Transmission. 2010. V. 46, N 3. P. 219--224. .pdf
Krotov D.S., Potapov V.N. On connection between reducibility on an n-ary quasigroup and that of its retracts // Discrete Math. 2011. V. 311, N 1. P.58--66. .pdf
V.N.Potapov. Clique matchings in the k-ary n-dimensional cube // Siberian Math. J. 2011. V. 52, N 2. P.303--310. .pdf
V.N.Potapov. On extensions of partial n-quasigroups of order 4 // Siberian Advances in Mathematics. 2012. V.22, N 2. P.135--151. .pdf
V. N. Potapov, D. S. Krotov. On the number of n-ary quasigroups of finite order // Discrete Mathematics and Applications. 2011. V. 21, N 5-6. P. 575--585. .pdf
V.N.Potapov. perfect 2-colorings of the q-ary n-cube // Discrete Math. 2012. V. 312, N 6. P.1269--1272. .pdf
V.N.Potapov. Construction of hamiltonian cycles with a given spectrum of edge directions in an n-dimensional Boolean cube // Journal of Applied and Industrial Mathematics. 2012. V.6, N 3. P. 339-345. .pdf
Potapov V.N. Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes // Problems of Information Transmission. 2012. V. 48, N1. P. 47--55 .pdf
V.N.Potapov. Infinite-dimensional quasigroups of finite orders // Math. Notes. 2013. V. 93, N 3. P. 479--486. .pdf
V.N.Potapov. Multidimensional latin bitrade // Siberian Math. J. 2013. V. 54, N 2. P. 317--324. .pdf
Krotov D.S., Potapov V.N. Propelinear 1-perfect codes from quadratic functions // IEEE Trans. Inform. Theory. 2014. V. 60, N 4. P. 2065--2068. .pdf
Potapov V.N. On the multidimensional permanent and q-ary designs // Siberian Electronic Mathematical Reports. 2014. V. 11, 451--456.
Krotov D.S., Potapov V.N. Constructions of transitive latin hypercubes // European Journal of Combinatorics. 2016. V. 54. P. 51--64 .pdf
Potapov V.N. On the number of transversals in latin squares // Discrete Applied Math. 2016. .pdf
D.Krotov, I.Mogilnykh, V.Potapov. To the theory of q-ary Steiner and other-type trade // Discrete Mathematics. 2016. V. 339, N 3. P. 1150--1157. .pdf
S. Avgustinovich, S. Kitaev, V.N. Potapov, V. Vajnovszki. Gray coding cubic planar maps // Theoretical Computer Sc. 2016. V. 616. P. 59--69. .pdf
V.N. Potapov. Partial covering arrays for data hiding and quantization // Siberian Electronic Mathematical Reports. 2018. V. 15, 561--569.
Potapov V.N. On the number of SQSs, latin hypercubes and MDS codes // Journal of Combinatorial Designs. 2018. V. 26 (5). P. 237--248. .pdf
S. Kitaev, V.N. Potapov, V. Vajnovszki. On shortening u-cycles and u-words for permutations // Discrete Appl. Math. 2019. V. 260. P. 203--213. .pdf
D.S. Krotov, V.N. Potapov. On the Cardinality Spectrum and the Number of Latin Bitrades of Order 3 // Problems of Information Transmission, 2019. Vol. 55. No. 4, P. 344–366. .pdf
D.S.Krotov, V.N.Potapov. On two-fold packings of radius-1 balls in Hamming graphs // 2019 IEEE International Symposium on Information Theory (ISIT) (7-12 July 2019 Paris, France), P. 2773-2777. .pdf
E.V. Gorkunov, D.S. Krotov, V.N. Potapov. On the number of autotopies of an n-ary quasigroup of order 4 // Quasigroups and Related Systems, 2019. V. 27 (2), P. 227--250.
V.N. Potapov. A Lower Bound on the Number of Boolean Functions with Median Correlation Immunity // 2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems", IEEE, 2019. P. 45-46 .pdf
V.N. Potapov. Constructions of pairs of orthogonal latin cubes // Journal of Combinatorial Designs. 2020. V. 28 (8). P. 604--613. .pdf
V.N. Potapov. On q-ary bent and plateaued functions // Des. Codes Cryptogr. V. 88 (10), P. 2037-2049 (2020) .pdf
V.N. Potapov, S.V. Avgustinovich. Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs // Siberian Mathematical Journal, 2020, Vol. 61, No. 5, P. 867-877. .pdf
D.S. Krotov and V.N. Potapov. On Multifold Packings of Radius-1 Balls in Hamming Graphs // IEEE Transactions on Information Theory, vol. 67, no. 6, P. 3585-3598. .pdf
V.N. Potapov. DP-Colorings of Uniform Hypergraphs and Splittings of Boolean Hypercube into Faces // Electronic J. Combin. 2022. 29(3), #P3.37. .pdf
V.N.Potapov. An Upper Bound on the Number of Bent Functions // 2021 XVII International Symposium on Problems of Redundancy in Information and Control Systems, IEEE, 2021. P. 95-96. .pdf
V.N. Potapov. On Weight Spectrum of Linear Codes // 2021 XVII International Symposium on Problems of Redundancy in Information and Control Systems, IEEE, 2021. P. 116-118. .pdf
V.N. Potapov. Embedding in MDS codes and Latin cubes // Journal of Combinatorial Designs. 2022. V. 30 (9). P. 626--633. .pdf
A.Greshnov, V.Potapov. About coincidence points theorems on 2-step Carnot groups with 1-dimensional centre equipped with Box-quasimetrics // AIMS Mathematics, 2023, 8(3): 6191--6205. .pdf
V.N. Potapov, A.A. Taranenko, Yu.V. Tarannikov. An asymptotic lower bound on the number of bent functions // Designs, Codes and Cryptography (2023) "Special Issue: Coding and Cryptography 2022" .pdf
S. Avgustinovich, S. Kitaev, J. Liese, V. Potapov and A. Taranenko.Singleton mesh patterns in multidimensional permutations // J. Combin. Th. A, V. 201, (2024) 105801 .pdf
D.S. Krotov, V. N. Potapov. An upper bound on the number of frequency hypercubes// Discrete Mathematics 347 (2024) 113657 .pdf
V. N. Potapov On extremal properties of perfect 2-colorings .pdf
V. N. Potapov, “Upper bounds on the numbers of binary plateaued and bent functions”, Cryptography and Comm., 16:6, Boolean Functions and their Applications VIII (2024), 1347 - 1356 , .pdf
V. N. Potapov, Existence of balanced functions that are not derivative of bent functions, 2023 , arXiv: 2309.04244 .pdf
A. L. Perezhogin, V. N. Potapov, S. Yu. Vladimirov, “Every latin hypercube of order 5 has transversals”, Journal of Combinatorial designs, 2024 .pdf
V. N. Potapov, F. Ozbudak, “Asymptotic bounds on the numbers of certain bent functions”, Cryptography and Communications, 2024, Boolean Functions and Their Applications VIII 2023, .pdf
V. N. Potapov, A. A. Taranenko, Asymptotic bounds on the numbers of vertices of polytopes of polystochastic matrices, 2024, .pdf
N. Alon, J. Balogh, V. N. Potapov, “Partitioning the hypercube into smaller hypercubes”, Illinois J. Math., 69:1 (2025), 109–122 .pdf
A.L. Perezhogin, V.N. Potapov, A.A. Taranenko, S.Y. Vladimirov, “Characterization of polystochastic matrices of order 4 with zero permanent”, Journal of Combinatorial Theory. Series A., 2015, 106060 (2025), 1–23 .pdf
V. N. Potapov, “On the number of relevant variables for discrete functions”, Cryptography and Communications, 17, Boolean Functions and Their Applications, 2024 (2025) .pdf
D. S. Krotov, V. N. Potapov, Completely Regular Codes in Distance-Regular Graphs, Monographs and Research Notes in Mathematics, Completely regular codes and equitable partitions , eds. Shi, M., Sole, P., Chapman & Hall/CRC, 2025 , 83 pp. .pdf
D. S. Krotov, F. Ozbudak, V. N. Potapov, Generalizing the Bierbrauer-Friedman bound for orthogonal arrays, 2024, 13 pp., arXiv: 2411.16559 .pdf