default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir N. Potapov
Person information
- affiliation: Sobolev Institute of Mathematics, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Vladimir N. Potapov
, Anna A. Taranenko, Yuriy V. Tarannikov:
An asymptotic lower bound on the number of bent functions. Des. Codes Cryptogr. 92(3): 639-651 (2024)- [j22]Denis S. Krotov, Vladimir N. Potapov:
An upper bound on the number of frequency hypercubes. Discret. Math. 347(1): 113657 (2024) - [j21]Sergey V. Avgustinovich, Sergey Kitaev, Jeffrey Liese, Vladimir N. Potapov, Anna A. Taranenko:
Singleton mesh patterns in multidimensional permutations. J. Comb. Theory A 201: 105801 (2024) - 2023
- [i16]Vladimir N. Potapov:
Upper bounds on the numbers of binary plateaued and bent functions. CoRR abs/2303.16547 (2023) - [i15]Vladimir N. Potapov:
Existence of balanced functions that are not derivative of bent functions. CoRR abs/2309.04244 (2023) - [i14]A. L. Perezhogin, Vladimir N. Potapov, S. Yu. Vladimirov:
Every latin hypercube of order 5 has transversals. CoRR abs/2311.14997 (2023) - 2022
- [j20]Vladimir N. Potapov:
DP-Colorings of Uniform Hypergraphs and Splittings of Boolean Hypercube into Faces. Electron. J. Comb. 29(3) (2022) - [i13]Denis S. Krotov, Vladimir N. Potapov:
An upper bound on the number of frequency hypercubes. CoRR abs/2212.03694 (2022) - 2021
- [j19]Denis S. Krotov, Vladimir N. Potapov:
On Multifold Packings of Radius-1 Balls in Hamming Graphs. IEEE Trans. Inf. Theory 67(6): 3585-3598 (2021) - [c9]Vladimir N. Potapov:
An Upper Bound on the Number of Bent Functions. REDUNDANCY 2021: 95-96 - [c8]Vladimir N. Potapov:
On Weight Spectrum of Linear Codes. REDUNDANCY 2021: 116-118 - [i12]Vladimir N. Potapov:
On weight spectrum of linear codes. CoRR abs/2107.14576 (2021) - [i11]Vladimir N. Potapov:
An Upper Bound on the Number of Bent Functions. CoRR abs/2107.14583 (2021) - 2020
- [j18]Vladimir N. Potapov:
On q-ary bent and plateaued functions. Des. Codes Cryptogr. 88(10): 2037-2049 (2020) - [d1]Vladimir N. Potapov:
Graeco-Latin cubes. IEEE DataPort, 2020
2010 – 2019
- 2019
- [j17]Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
On shortening u-cycles and u-words for permutations. Discret. Appl. Math. 260: 203-213 (2019) - [j16]Denis S. Krotov, Vladimir N. Potapov:
On the Cardinality Spectrum and the Number of Latin Bitrades of Order 3. Probl. Inf. Transm. 55(4): 343-365 (2019) - [c7]Denis S. Krotov, Vladimir N. Potapov:
On two-fold packings of radius-1 balls in Hamming graphs. ISIT 2019: 2773-2777 - [c6]Vladimir N. Potapov:
On Minimal Distance between q-ary Plateaued Functions. REDUNDANCY 2019: 42-44 - [c5]Vladimir N. Potapov:
A Lower Bound on the Number of Boolean Functions with Median Correlation Immunity. REDUNDANCY 2019: 45-46 - [i10]Denis S. Krotov, Vladimir N. Potapov:
On two-fold packings of radius-1 balls in Hamming graphs. CoRR abs/1902.00023 (2019) - [i9]Denis S. Krotov, Evgeny V. Gorkunov, Vladimir N. Potapov:
On the number of autotopies of an n-ary qusigroup of order 4. CoRR abs/1903.00188 (2019) - [i8]Vladimir N. Potapov:
A Lower Bound on the Number of Boolean Functions with Median Correlation Immunity. CoRR abs/1910.02621 (2019) - [i7]Vladimir N. Potapov:
On q-ary Bent and Plateaued Functions. CoRR abs/1911.06973 (2019) - [i6]Vladimir N. Potapov:
Constructions of Pairs of Orthogonal Latin Cubes. CoRR abs/1911.12960 (2019) - 2016
- [j15]Vladimir N. Potapov:
On the number of transversals in latin squares. Discret. Appl. Math. 202: 194-196 (2016) - [j14]Denis S. Krotov, Ivan Yu. Mogilnykh, Vladimir N. Potapov:
To the theory of q-ary Steiner and other-type trades. Discret. Math. 339(3): 1150-1157 (2016) - [j13]Denis S. Krotov, Vladimir N. Potapov:
Constructions of transitive latin hypercubes. Eur. J. Comb. 54: 51-64 (2016) - [j12]Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
Gray coding cubic planar maps. Theor. Comput. Sci. 616: 59-69 (2016) - [i5]Vladimir N. Potapov:
On minimal distance between q-ary bent functions. CoRR abs/1606.02430 (2016) - 2015
- [i4]Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
Gray coding planar maps. CoRR abs/1509.05807 (2015) - [i3]Vladimir N. Potapov:
Linear codes for an effective quantization of data. CoRR abs/1512.09287 (2015) - 2014
- [j11]Denis S. Krotov, Vladimir N. Potapov:
Propelinear 1-Perfect Codes From Quadratic Functions. IEEE Trans. Inf. Theory 60(4): 2065-2068 (2014) - [c4]Alexey Filippov, Vasily Rufitskiy, Vladimir N. Potapov:
Scalar-quantization-based multi-layer data hiding for video coding applications. VCIP 2014: 262-265 - 2013
- [c3]Vladimir N. Potapov, Nikolay Shlyakhov, Albert Silantiev, Mikhail Tchobanou:
What could be after HEVC? ICICS 2013: 1-5 - [i2]Denis S. Krotov, Vladimir N. Potapov:
Transitive 1-perfect codes from quadratic functions. CoRR abs/1301.0014 (2013) - [i1]Denis S. Krotov, Vladimir N. Potapov:
Construction of transitive MDS codes. CoRR abs/1303.0004 (2013) - 2012
- [j10]Vladimir N. Potapov:
On perfect 2-colorings of the q-ary n-cube. Discret. Math. 312(6): 1269-1272 (2012) - [j9]Vladimir N. Potapov:
Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes. Probl. Inf. Transm. 48(1): 47-55 (2012) - 2011
- [j8]Denis S. Krotov, Vladimir N. Potapov:
On connection between reducibility of an n-ary quasigroup and that of its retracts. Discret. Math. 311(1): 58-66 (2011) - 2010
- [j7]Denis S. Krotov, Vladimir N. Potapov:
On switching equivalence of n-ary quasigroups of order 4 and perfect binary codes. Probl. Inf. Transm. 46(3): 219-224 (2010)
2000 – 2009
- 2009
- [j6]Denis S. Krotov, Vladimir N. Potapov:
n-Ary Quasigroups of Order 4. SIAM J. Discret. Math. 23(2): 561-570 (2009) - 2004
- [j5]Vladimir N. Potapov:
Redundancy estimates for the Lempel-Ziv algorithm of data compression. Discret. Appl. Math. 135(1-3): 245-254 (2004) - [j4]Yuri L. Orlov, Vladimir N. Potapov:
Complexity: an internet resource for analysis of DNA sequence complexity. Nucleic Acids Res. 32(Web-Server-Issue): 628-633 (2004) - [j3]Denis S. Krotov, Vladimir N. Potapov:
On Multifold MDS and Perfect Codes That Are Not Splittable into Onefold Codes. Probl. Inf. Transm. 40(1): 5-12 (2004) - 2003
- [c2]Yuri L. Orlov, Vladimir D. Gusev, Lubov A. Nemytikova, Vladimir N. Potapov, Nadia A. Kolchanov:
Internet-Available Software Packages for Analysis of DNA Sequence Complexity. METMBS 2003: 35-38 - 2002
- [j2]Yuri L. Orlov, V. P. Filippov, Vladimir N. Potapov, Nikolay A. Kolchanov:
Construction of stochastic context trees for genetical texts. Silico Biol. 2(3): 233-247 (2002) - 2001
- [c1]Yuri L. Orlov, V. P. Filippov, Vladimir N. Potapov, Nikolay A. Kolchanov:
Construction of stochastic context trees for genetical texts. German Conference on Bioinformatics 2001: 212-215
1990 – 1999
- 1999
- [j1]Rafail E. Krichevskiy, Vladimir N. Potapov:
Rapid Encoding of Run Lengths and Pyramid Cubic Lattices. IEEE Trans. Inf. Theory 45(4): 1347-1350 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
