RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Potapov, Vladimir Nikolaevich

Total publications: 55 (55)
in MathSciNet: 36 (36)
in zbMATH: 32 (32)
in Web of Science: 30 (30)
in Scopus: 34 (34)
Cited articles: 26
Citations in Math-Net.Ru: 79
Citations in Web of Science: 124
Citations in Scopus: 192
Presentations: 5

Number of views:
This page:4524
Abstract pages:6246
Full texts:1518
References:538
Potapov, Vladimir Nikolaevich
Senior Researcher
Candidate of physico-mathematical sciences (1997)
Speciality: 01.01.01 (Real analysis, complex analysis, and functional analysis)
Birth date: 2.09.1971
E-mail:
Website: http://math.nsc.ru/~potapov
Keywords: boolean cube; matching; Hamiltonian cycles; Latin squares; $n$-quasigroups; perfect codes; perfect coloring, source coding; data retrieval; hash-functions; combinatorics on words; genetic sequences; entropy and widths; wavelets.
   
Main publications:
  1. V. N. Potapov, “On the number of SQSs, latin hypercubes and MDS codes”, Journal of Combinatorial Designs, 26:5 (2018), 237–248  crossref  mathscinet  zmath  isi  scopus
  2. D. S. Krotov, V. N. Potapov, “Propelinear 1-perfect codes from quadratic functions”, IEEE Trans. Inform. Theory, 60:4 (2014), 2065–2068  crossref  mathscinet  zmath  isi  scopus
  3. V. N. Potapov, Vvedenie v teoriyu informatsii, NITs “Regulyarnaya i khaoticheskaya dinamika”, Izhevsk, 2014 , 152 pp.
  4. V. N. Potapov, “Clique matchings in the $k$-ary $n$-dimensional cube”, Siberian Math. J., 52:2 (2011), 303–310  mathnet  crossref  mathscinet  zmath  isi  scopus
  5. D. S. Krotov, V. N. Potapov, “n-Ary quasigroups of order 4”, SIAM J. Discrete Math., 23:2 (2009), 561–570  crossref  mathscinet  zmath  isi  scopus

http://www.mathnet.ru/eng/person18014
http://scholar.google.com/citations?user=0DynDV0AAAAJ&hl=en
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/342859
http://elibrary.ru/author_items.asp?authorid=15017
http://orcid.org/0000-0001-9461-2064
http://www.researcherid.com/rid/A-1997-2011
http://www.scopus.com/authid/detail.url?authorId=7102561165
https://www.researchgate.net/profile/Vladimir_Potapov2
https://arxiv.org/a/Potapov_V_1

Full list of publications:
| by years | by types | by times cited in WoS | by times cited in Scopus | scientific publications | common list |



   2018
1. Vladimir N. Potapov, “Partial covering arrays for data hiding and quantization”, Sib. elektron. matem. izv., 15 (2018), 561–569  mathnet  crossref  mathscinet  zmath  isi  scopus
2. V. N. Potapov, “On the number of SQSs, latin hypercubes and MDS codes”, Journal of Combinatorial Designs, 26:5 (2018), 237–248  crossref  mathscinet  zmath  isi  scopus

   2016
3. D. S. Krotov, I. Yu. Mogilnykh, V. N. Potapov, “To the theory of q-ary Steiner and other-type trades”, Discrete Math., 339:3 (2016), 1150–1157  crossref  mathscinet  zmath  isi (cited: 11)  scopus (cited: 12)
4. D. S. Krotov, V. N. Potapov, “Constructions of transitive latin hypercubes”, European Journal of Combinatorics, 54:1 (2016), 51–64  crossref  mathscinet  zmath  isi  scopus
5. S. Avgustinovich , S. Kitaev, V. N. Potapov, V. Vajnovszki, “Gray coding cubic planar maps”, Theoret. Comput. Sci., 616 (2016), 59–69  crossref  mathscinet  zmath  isi  scopus
6. V. N. Potapov, “On the number of transversals in latin squares”, Discrete Appl. Math., 202 (2016), 194–196  crossref  mathscinet  zmath  isi  scopus
7. V. N. Potapov, “Linear Codes for an Effective Quantization of Data”, 2016 XV International Symposium "Problems of Redundancy in Information and Control Systems (Saint-Petersburg, 26-29 September 2016), IEEE, 2016, 116–117  crossref  isi  scopus
8. V. N. Potapov, “On Minimal Distance Between q-ary Bent Functions”, 2016 XV International Symposium "Problems of Redundancy in Information and Control Systems (Saint-Petersburg, 26-29 September 2016), IEEE, 2016, 115–116  crossref  isi  scopus (cited: 1)

   2015
9. V. N. Potapov, “Properties of $p$-ary bent functions that are at minimal distance from each other”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 39–43  mathnet  crossref

   2014
10. V. N. Potapov, “On the multidimensional permanent and $q$-ary designs”, Sib. Èlektron. Mat. Izv., 11 (2014), 451–456  mathnet  mathscinet  zmath  isi  scopus
11. D. S. Krotov, V. N. Potapov, “Propelinear 1-perfect codes from quadratic functions”, IEEE Trans. Inform. Theory, 60:4 (2014), 2065–2068  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 3)
12. A. Filippov, V. Rufitskiy, V. Potapov, “Scalar-quantization-based multi-layer data hiding for video coding applications”, Visual Communications and Image Processing Conference, IEEE, 2014, 262–265  crossref  isi (cited: 2)  scopus (cited: 2)
13. V. N. Potapov, Vvedenie v teoriyu informatsii, NITs “Regulyarnaya i khaoticheskaya dinamika”, Izhevsk, 2014 , 152 pp.

   2013
14. V. N. Potapov, “Infinite-Dimensional Quasigroups of Finite Orders”, Math. Notes, 93:3 (2013), 479–486  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 1)  elib  elib  scopus (cited: 2)
15. V. N. Potapov, “Multidimensional Latin bitrades”, Siberian Math. J., 54:2 (2013), 317–324  mathnet  crossref  mathscinet  zmath  isi (cited: 4)  scopus (cited: 5)
16. V. Potapov, N. Shlyakhov, A. Silantiev, M. Tchobanou, “What could be after HEVC?”, Proceedings of 9th International Conference, Information, Communications and Signal Processing (ICICS), 2013, 1–5  crossref  isi  scopus

   2012
17. V. N. Potapov, “Construction of Hamiltonian cycles with a given range of directions of edges in the Boolean $n$-dimensional cube”, J. Appl. Industr. Math., 6:3 (2012), 339–345  mathnet  crossref  mathscinet  zmath  isi  scopus

   2011
18. V. N. Potapov, D. S. Krotov, “On the number of n-ary quasigroups of finite order”, Discrete Math. Appl., 21:5-6 (2011), 575–585  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus (cited: 9)

   2012
19. V. N. Potapov, “On almost balanced Boolean functions”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 23–25  mathnet
20. V. N. Potapov, “Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes”, Problems Inform. Transmission, 48:1 (2012), 47–55  mathnet  crossref  mathscinet  zmath  isi (cited: 7)  scopus (cited: 9)
21. V. N. Potapov, “On perfect 2-colorings of the q-ary n-cube”, Discrete Math., 312:6 (2012), 1269–1272  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 6)
22. V. N. Potapov, “On extensions of partial $n$-quasigroups of order 4”, Siberian Adv. Math., 22:2 (2012), 135–151  mathnet  crossref  mathscinet  zmath  scopus (cited: 5)

   2011
23. V. N. Potapov, “On perfect 2-colorings of the $q$-ary hypercube”, Prikl. Diskr. Mat., 2011, no. supplement № 4, 18–20  mathnet
24. V. N. Potapov, “Clique matchings in the $k$-ary $n$-dimensional cube”, Siberian Math. J., 52:2 (2011), 303–310  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 1)
25. D. S. Krotov, V. N. Potapov, “On connection between reducibility of an n-ary quasigroup and that of its retracts”, Discrete Math., 311:1 (2011), 58–66  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 4)

   2010
26. D. S. Krotov, V. N. Potapov, “On switching equivalence of $n$-ary quasigroups of order 4 and perfect binary codes”, Problems Inform. Transmission, 46:3 (2010), 219–224  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 3)
27. V. N. Potapov, “On perfect colorings of Boolean $n$-cube and correlation immune functions with small density”, Sib. Èlektron. Mat. Izv., 7 (2010), 372–382  mathnet  mathscinet  zmath  isi

   2009
28. D. S. Krotov, V. N. Potapov, “n-Ary quasigroups of order 4”, SIAM J. Discrete Math., 23:2 (2009), 561–570  crossref  mathscinet  zmath  isi (cited: 16)  scopus (cited: 20)
29. A. V. Greshnov, S. A. Malyugin, V. N, Potapov, Sbornik zadach i uprazhnenii po matematicheskomu analizu. 2-i semestr, Novosib. gos. un-t., Novosibirsk, 2009 , 240 pp.  mathscinet

   2008
30. V. N. Potapov, “Arithmetic coding of messages using random sequence”, Prikl. Diskr. Mat., 2008, no. 2(2), 131–133  mathnet
31. D. S. Krotov, V. N. Potapov, P. V. Sokolova, “On reconstructing reducible n-ary quasigroups and switching subquasigroups”, Quasigroups and Related Systems, 16 (2008), 55–67  mathscinet  zmath
32. A. V. Greshnov, S. A. Malyugin , V. N. Potapov, Sbornik zadach i uprazhnenii po matematicheskomu analizu. 1-i semestr, Novosib. gos. un-t., Novosibirsk, 2008 , 150 pp.

   2007
33. D. C. Krotov, V. N. Potapov, “Konstruktsii n-kvazigrupp”, Vestnik TGU. Prilozhenie, 23 (2007), 35–36
34. V. N. Potapov, “A lower bound for the number of transitive perfect codes”, J. Appl. Industr. Math., 1:3 (2007), 373–379  mathnet  crossref  mathscinet  zmath  scopus (cited: 8)

   2006
35. V. N. Potapov, D. S. Krotov, “Asymptotics for the number of $n$-quasigroups of order 4”, Siberian Math. J., 47:4 (2006), 720–731  mathnet  crossref  mathscinet  zmath  isi (cited: 15)  scopus (cited: 17)

   2004
36. V. N. Potapov, “On the maximum length of binary words with bounded frequency of units and without identical subwords of given length”, Diskretn. Anal. Issled. Oper., 11:3 (2004), 48–58  mathnet  mathscinet
37. V. N. Potapov, “Additive complexity of words with restrictions on the composition of subwords”, Diskretn. Anal. Issled. Oper., 11:1 (2004), 52–78  mathnet  mathscinet  zmath
38. D. S. Krotov, V. N. Potapov, “On Multifold MDS and Perfect Codes That Are Not Splittable into Onefold Codes”, Problems Inform. Transmission, 40:1 (2004), 5–12  mathnet  crossref  mathscinet  zmath  scopus (cited: 6)
39. Y. L. Orlov, V. N. Potapov, “Complexity: an internet resource for analysis of DNA sequence complexity”, Nucl. Acids. Res., 32 (2004), 628–633  crossref  isi (cited: 52)  scopus (cited: 65)
40. V. N. Potapov, “Redundancy estimates for the Lempel–Ziv algorithm of data compression”, perevod: Otsenki izbytochnosti kodirovaniya posledovatelnostei algoritmom Lempela–Ziva, Discrete Appl. Math., 135:1-3 (2004), 245–254  crossref  mathscinet  isi (cited: 4)  scopus

   2002
41. Y. L. Orlov, V. P. Filippov, V. N. Potapov , N. A. Kolchanov, “Construction of stochastic context trees for genetic texts”, In Silico Biology, 2:3 (2002), 233–247  scopus (cited: 11)

   2001
42. A. L. Perezhogin, V. N. Potapov, “On the number of Hamiltonian cycles in a Boolean cube”, Diskretn. Anal. Issled. Oper., 8:2 (2001), 52–62  mathnet  mathscinet  zmath

   2000
43. V. N. Potapov, “Numeratsiya tselochislennogo simpleksa”, Vestnik NNGU. Matematicheskoe modelirovanie i optimalnoe upravlenie, 22:1 (2000), 152–158  zmath
44. Yu. L. Orlov, V. N. Potapov, “Otsenka stokhasticheskoi slozhnosti geneticheskikh tekstov”, Vychislitelnye tekhnologii, 5, spetsvypusk (2000), 5–15

   1999
45. V. N. Potapov, “A survey of methods for the undistorted coding of discrete sources”, Diskretn. Anal. Issled. Oper., 6:4 (1999), 49–91  mathnet  mathscinet  zmath
46. V. N. Potapov, “Estimates for the redundancy of the coding of sequences by the Lempel–Ziv algorithm”, Diskretn. Anal. Issled. Oper., 6:2 (1999), 70–81  mathnet  mathscinet  zmath
47. R. E. Krichevskii, V. N. Potapov, “Rapid encoding of run lengths and pyramid cubic lattices”, IEEE Trans. Inform. Theory, 45:4 (1999), 1347–1350  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 1)
48. V. N. Potapov, Teoriya informatsii. Kodirovanie diskretnykh veroyatnostnykh istochnikov, Izd. tsentr NGU, 1999 , 71 pp.

   1997
49. V. N. Potapov, “$\varepsilon$-entropy of compacta in $C$, and tabulation of continuous functions”, Siberian Math. J., 38:4 (1997), 759–771  mathnet  crossref  mathscinet  zmath  isi  scopus
50. R. E. Krichevskii, V. N. Potapov, “Enumeration of rare events, pyramid and ball cubic lattices”, Proceedings of 1997 IEEE International Symposium on Information Theory, IEEE, 1997, 19  crossref  scopus

   1996
51. R. E. Krichevskii, V. N. Potapov, “Compression and restoration of square integrable function”, Electron. Res. Announc. Amer. Math. Soc., 2:1 (1996), 42–49  mathscinet  zmath

   1995
52. V. N. Potapov, “Tabulirovanie gladkikh funktsii”, Mezhvuz. sb. nauch. tr. Analiz i diskretnaya matematika, NGU, Novosibirsk, 1995, 115–125  mathscinet
53. R. E. Krichevskii, V. N. Potapov, “Compression of square integrable function: Fourier vs wavelets”, Proceedings of 1995 IEEE International Symposium on Information Theory, IEEE, 1995, 431  crossref  isi  scopus

   1994
54. R. E. Krichevskii, V. N. Potapov, “Combinatorial Source Encoding and Perfect Hashing”, Proceedings of 1994 IEEE International Symposium on Information Theory, IEEE, 1994, 319  crossref  scopus

   1993
55. V. N. Potapov, “Bystryi leksikograficheskii poisk”, Doklady RAN, 330:2 (1993), 158–160  mathnet  mathscinet  isi

Presentations in Math-Net.Ru
1. Perfect Coloring of Hypercube and Discrete Fourier Transforms
V. N. Potapov
Seminar on Coding Theory
November 12, 2013 19:00
2. Information theory and encoding. Lecture 4
V. N. Potapov
Summer School "Contemporary Mathematics", 2012
July 29, 2012 15:30   
3. Information theory and encoding. Lecture 3
V. N. Potapov
Summer School "Contemporary Mathematics", 2012
July 28, 2012 11:15   
4. Information theory and encoding. Lecture 2
V. N. Potapov
Summer School "Contemporary Mathematics", 2012
July 24, 2012 17:00   
5. Information theory and encoding. Lecture 1
V. N. Potapov
Summer School "Contemporary Mathematics", 2012
July 23, 2012 09:30   

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019