Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/poit/poit53.bht:"
@article{DBLP:journals/poit/BaichevaT17, author = {Tsonka Stefanova Baicheva and Svetlana Topalova}, title = {Optimal conflict-avoiding codes for 3, 4 and 5 active users}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {1}, pages = {42--50}, year = {2017}, url = {https://doi.org/10.1134/S0032946017010033}, doi = {10.1134/S0032946017010033}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BaichevaT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BalitskiiSGK17, author = {A. M. Balitskii and A. V. Savchik and R. F. Gafarov and Ivan A. Konovalenko}, title = {On projectively invariant points of an oval with a distinguished exterior line}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {279--283}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030097}, doi = {10.1134/S0032946017030097}, timestamp = {Tue, 02 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/BalitskiiSGK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BassalygoZ17, author = {Leonid A. Bassalygo and Victor A. Zinoviev}, title = {Remark on balanced incomplete block designs, near-resolvable block designs, and \emph{q}-ary constant-weight codes}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {1}, pages = {51--54}, year = {2017}, url = {https://doi.org/10.1134/S0032946017010045}, doi = {10.1134/S0032946017010045}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BassalygoZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BassalygoZ17a, author = {Leonid A. Bassalygo and Victor A. Zinoviev}, title = {Erratum to: "Remark on balanced incomplete block designs, near-resolvable block designs, and \emph{q}-ary constant-weight codes"}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {305}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030127}, doi = {10.1134/S0032946017030127}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BassalygoZ17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BespalovK17, author = {Evgeny Bespalov and Denis S. Krotov}, title = {{MDS} codes in Doob graphs}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {2}, pages = {136--154}, year = {2017}, url = {https://doi.org/10.1134/S003294601702003X}, doi = {10.1134/S003294601702003X}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/BespalovK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BespalovK17a, author = {Evgeny Bespalov and Denis S. Krotov}, title = {Erratum to: "MDS codes in Doob graphs"}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {306}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030139}, doi = {10.1134/S0032946017030139}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/BespalovK17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BessalovT17, author = {A. V. Bessalov and O. V. Tsygankova}, title = {Number of curves in the generalized Edwards form with minimal even cofactor of the curve order}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {1}, pages = {92--101}, year = {2017}, url = {https://doi.org/10.1134/S0032946017010082}, doi = {10.1134/S0032946017010082}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BessalovT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BobuKR17, author = {A. V. Bobu and A. E. Kupriyanov and Andrei M. Raigorodskii}, title = {On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {4}, pages = {319--342}, year = {2017}, url = {https://doi.org/10.1134/S0032946017040020}, doi = {10.1134/S0032946017040020}, timestamp = {Wed, 14 Mar 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/BobuKR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BocheM17, author = {Holger Boche and Ullrich J. M{\"{o}}nich}, title = {Spaceability for sets of bandlimited input functions and stable linear time-invariant systems with finite time blowup behavior}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {2}, pages = {164--182}, year = {2017}, url = {https://doi.org/10.1134/S0032946017020053}, doi = {10.1134/S0032946017020053}, timestamp = {Mon, 24 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BocheM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BogatyrevGL17, author = {Andrei B. Bogatyrev and Sergei A. Goreinov and Sergei Yu. Lyamaev}, title = {Analytical approach to multiband filter synthesis and comparison to other approaches}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {260--273}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030073}, doi = {10.1134/S0032946017030073}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BogatyrevGL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BurnaevG17, author = {Evgeny V. Burnaev and G. K. Golubev}, title = {On One Problem in Multichannel Signal Detection}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {4}, pages = {368--380}, year = {2017}, url = {https://doi.org/10.1134/S0032946017040056}, doi = {10.1134/S0032946017040056}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/BurnaevG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Burnashev17, author = {Marat V. Burnashev}, title = {Two comparison theorems for distributions of Gaussian quadratic forms}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {203--214}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030012}, doi = {10.1134/S0032946017030012}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Burnashev17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Burnashev17a, author = {Marat V. Burnashev}, title = {On Detection of Gaussian Stochastic Sequences}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {4}, pages = {349--367}, year = {2017}, url = {https://doi.org/10.1134/S0032946017040044}, doi = {10.1134/S0032946017040044}, timestamp = {Wed, 14 Mar 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Burnashev17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Dalai17, author = {Marco Dalai}, title = {A note on random coding bounds for classical-quantum channels}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {222--228}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030036}, doi = {10.1134/S0032946017030036}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Dalai17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/DerevyankoK17, author = {Nikita Mikhailovich Derevyanko and S. G. Kiselev}, title = {Independence Numbers of Random Subgraphs of Some Distance Graph}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {4}, pages = {307--318}, year = {2017}, url = {https://doi.org/10.1134/S0032946017040019}, doi = {10.1134/S0032946017040019}, timestamp = {Tue, 25 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/DerevyankoK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/GorbunovL17, author = {Konstantin Yu. Gorbunov and Vassily A. Lyubetsky}, title = {Linear algorithm for minimal rearrangement of structures}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {1}, pages = {55--72}, year = {2017}, url = {https://doi.org/10.1134/S0032946017010057}, doi = {10.1134/S0032946017010057}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/GorbunovL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Gurevich17, author = {B. M. Gurevich}, title = {Entropy of a stationary process and entropy of a shift transformation in its sample space}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {2}, pages = {103--113}, year = {2017}, url = {https://doi.org/10.1134/S0032946017020016}, doi = {10.1134/S0032946017020016}, timestamp = {Mon, 24 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Gurevich17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Ivanov17, author = {Fedor I. Ivanov}, title = {A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {229--241}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030048}, doi = {10.1134/S0032946017030048}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Ivanov17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Kamlovskii17, author = {O. V. Kamlovskii}, title = {Occurrence numbers for vectors in cycles of output sequences of binary combining generators}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {1}, pages = {84--91}, year = {2017}, url = {https://doi.org/10.1134/S0032946017010070}, doi = {10.1134/S0032946017010070}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Kamlovskii17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/KhoroshenkikhD17, author = {S. N. Khoroshenkikh and A. B. Dainiak}, title = {Model of a random geometric graph with attachment to the coverage area}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {1}, pages = {73--83}, year = {2017}, url = {https://doi.org/10.1134/S0032946017010069}, doi = {10.1134/S0032946017010069}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/KhoroshenkikhD17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Lebedev17, author = {Vladimir S. Lebedev}, title = {Adaptive search for one defective in the additive group testing model}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {274--278}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030085}, doi = {10.1134/S0032946017030085}, timestamp = {Tue, 27 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Lebedev17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Lebedev17a, author = {Alexey V. Lebedev}, title = {Stochastic Operation Induced by Group Allocation of Particles and Generalized Branching Processes}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {4}, pages = {381--390}, year = {2017}, url = {https://doi.org/10.1134/S0032946017040068}, doi = {10.1134/S0032946017040068}, timestamp = {Mon, 15 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Lebedev17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Leontev17, author = {Vladimir K. Leont'ev}, title = {On Spectra of Linear Codes}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {4}, pages = {343--348}, year = {2017}, url = {https://doi.org/10.1134/S0032946017040032}, doi = {10.1134/S0032946017040032}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Leontev17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/LukomskiiV17, author = {Sergei Feodorovich Lukomskii and A. M. Vodolazov}, title = {Fast discrete Fourier transform on local fields of positive characteristic}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {2}, pages = {155--163}, year = {2017}, url = {https://doi.org/10.1134/S0032946017020041}, doi = {10.1134/S0032946017020041}, timestamp = {Mon, 24 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/LukomskiiV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/MogilnykhS17, author = {Ivan Yu. Mogilnykh and Faina I. Solov'eva}, title = {Propelinear codes related to some classes of optimal codes}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {251--259}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030061}, doi = {10.1134/S0032946017030061}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/MogilnykhS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Prelov17, author = {Vyacheslav V. Prelov}, title = {On coupling of probability distributions and estimating the divergence through variation}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {215--221}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030024}, doi = {10.1134/S0032946017030024}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Prelov17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/RyabkoGS17, author = {B. Ya. Ryabko and Andrey Guskov and Irina Selivanova}, title = {Information-Theoretic method for classification of texts}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {294--304}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030115}, doi = {10.1134/S0032946017030115}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/RyabkoGS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Sergeev17, author = {I. S. Sergeev}, title = {On the real complexity of a complex {DFT}}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {284--293}, year = {2017}, url = {https://doi.org/10.1134/S0032946017030103}, doi = {10.1134/S0032946017030103}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Sergeev17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Stepanov17, author = {S. A. Stepanov}, title = {Nonlinear \emph{q}-ary codes with large code distance}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {3}, pages = {242--250}, year = {2017}, url = {https://doi.org/10.1134/S003294601703005X}, doi = {10.1134/S003294601703005X}, timestamp = {Thu, 26 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Stepanov17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/VatedkaK17, author = {Shashank Vatedka and Navin Kashyap}, title = {Some "goodness" properties of {LDA} lattices}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {1}, pages = {1--29}, year = {2017}, url = {https://doi.org/10.1134/S003294601701001X}, doi = {10.1134/S003294601701001X}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/VatedkaK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Vorobev17, author = {Ilya V. Vorobyev}, title = {Bounds on the rate of separating codes}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {1}, pages = {30--41}, year = {2017}, url = {https://doi.org/10.1134/S0032946017010021}, doi = {10.1134/S0032946017010021}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Vorobev17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/VyalyiK17, author = {Mikhail N. Vyalyi and I. M. Khuziev}, title = {Fast protocols for leader election and spanning tree construction in a distributed network}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {2}, pages = {183--201}, year = {2017}, url = {https://doi.org/10.1134/S0032946017020065}, doi = {10.1134/S0032946017020065}, timestamp = {Mon, 24 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/VyalyiK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/ZhilinZ17, author = {Igor V. Zhilin and Victor V. Zyablov}, title = {Generalized error-locating codes with component codes over the same alphabet}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {2}, pages = {114--135}, year = {2017}, url = {https://doi.org/10.1134/S0032946017020028}, doi = {10.1134/S0032946017020028}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/ZhilinZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Zhukovskii17, author = {Maksim E. Zhukovskii}, title = {Quantifier Alternation in First-Order Formulas with Infinite Spectra}, journal = {Probl. Inf. Transm.}, volume = {53}, number = {4}, pages = {391--403}, year = {2017}, url = {https://doi.org/10.1134/S003294601704007X}, doi = {10.1134/S003294601704007X}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Zhukovskii17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.