default search action
Search dblp for Publications
export results for "toc:db/journals/poit/poit52.bht:"
@article{DBLP:journals/poit/BaccelliRS16, author = {Fran{\c{c}}ois Baccelli and Alexandre N. Rybko and Senya B. Shlosman}, title = {Queueing networks with mobile servers: The mean-field approach}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {2}, pages = {178--199}, year = {2016}, url = {https://doi.org/10.1134/S0032946016020071}, doi = {10.1134/S0032946016020071}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BaccelliRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BakinE16, author = {Evgeny Bakin and Grigory Evseev}, title = {Remark on "on the capacity of a multiple-access vector adder channel" by {A.A.} Frolov and {V.V.} Zyablov}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {1}, pages = {1--5}, year = {2016}, url = {https://doi.org/10.1134/S0032946016010014}, doi = {10.1134/S0032946016010014}, timestamp = {Sat, 16 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BakinE16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BespalovGP16, author = {M. S. Bespalov and A. S. Golubev and A. S. Pochenchuk}, title = {Derivation of fast algorithms via binary filtering of signals}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {4}, pages = {359--372}, year = {2016}, url = {https://doi.org/10.1134/S0032946016040049}, doi = {10.1134/S0032946016040049}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BespalovGP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Blank16, author = {Michael L. Blank}, title = {The problem of fair division for a hybrid resource}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {299--307}, year = {2016}, url = {https://doi.org/10.1134/S003294601603008X}, doi = {10.1134/S003294601603008X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Blank16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/BobuK16, author = {A. V. Bobu and A. E. Kupriyanov}, title = {On chromatic numbers of close-to-Kneser distance graphs}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {4}, pages = {373--390}, year = {2016}, url = {https://doi.org/10.1134/S0032946016040050}, doi = {10.1134/S0032946016040050}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/BobuK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Borissov16, author = {Yuri L. Borissov}, title = {Some new results on Hadamard modulo prime matrices}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {2}, pages = {134--141}, year = {2016}, url = {https://doi.org/10.1134/S0032946016020034}, doi = {10.1134/S0032946016020034}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Borissov16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Buscemi16, author = {Francesco Buscemi}, title = {Degradable channels, less noisy channels, and quantum statistical morphisms: An equivalence relation}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {201--213}, year = {2016}, url = {https://doi.org/10.1134/S0032946016030017}, doi = {10.1134/S0032946016030017}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Buscemi16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Chizhov16, author = {A. S. Chizhov}, title = {On interval modal logic with "after" relation}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {2}, pages = {166--177}, year = {2016}, url = {https://doi.org/10.1134/S003294601602006X}, doi = {10.1134/S003294601602006X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Chizhov16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/DyachkovVPS16, author = {Arkadii G. D'yachkov and Ilya V. Vorobyev and N. A. Polyansky and Vladislav Yu. Shchukin}, title = {Erratum to: "Bounds on the rate of disjunctive codes"}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {2}, pages = {200}, year = {2016}, url = {https://doi.org/10.1134/S0032946016020083}, doi = {10.1134/S0032946016020083}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/DyachkovVPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/FossHT16, author = {S. G. Foss and Bruce E. Hajek and Andrey M. Turlikov}, title = {Doubly randomized protocols for a random multiple access channel with "success-nonsuccess" feedback}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {2}, pages = {156--165}, year = {2016}, url = {https://doi.org/10.1134/S0032946016020058}, doi = {10.1134/S0032946016020058}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/FossHT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Frolov16, author = {Alexey A. Frolov}, title = {Upper bound on the minimum distance of {LDPC} codes over \emph{GF}(\emph{q}) based on counting the number of syndromes}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {1}, pages = {6--13}, year = {2016}, url = {https://doi.org/10.1134/S0032946016010026}, doi = {10.1134/S0032946016010026}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Frolov16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/GabidulinP16, author = {Ernst M. Gabidulin and Nina I. Pilipchuk}, title = {Multicomponent codes with maximum code distance}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {276--283}, year = {2016}, url = {https://doi.org/10.1134/S0032946016030054}, doi = {10.1134/S0032946016030054}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/GabidulinP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Golubev16, author = {G. K. Golubev}, title = {On risk concentration for convex combinations of linear estimators}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {4}, pages = {344--358}, year = {2016}, url = {https://doi.org/10.1134/S0032946016040037}, doi = {10.1134/S0032946016040037}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Golubev16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/GulcuB16, author = {Talha Cihad G{\"{u}}lc{\"{u}} and Alexander M. Barg}, title = {Interactive function computation via polar coding}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {1}, pages = {66--91}, year = {2016}, url = {https://doi.org/10.1134/S0032946016010063}, doi = {10.1134/S0032946016010063}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/GulcuB16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Karatsuba16, author = {Ekatherina A. Karatsuba}, title = {Erratum to: "On one method for constructing a family of approximations of zeta constants by rational fractions"}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {1}, pages = {100--101}, year = {2016}, url = {https://doi.org/10.1134/S0032946016010087}, doi = {10.1134/S0032946016010087}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Karatsuba16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/KarumanchiM0Y16, author = {Siddharth Karumanchi and Stefano Mancini and Andreas J. Winter and Dong Yang}, title = {Classical capacities of quantum channels with environment assistance}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {214--238}, year = {2016}, url = {https://doi.org/10.1134/S0032946016030029}, doi = {10.1134/S0032946016030029}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/KarumanchiM0Y16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/KrotovV16, author = {Denis S. Krotov and Anastasia Yu. Vasil'eva}, title = {On perfect codes that do not contain Preparata-like codes}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {284--288}, year = {2016}, url = {https://doi.org/10.1134/S0032946016030066}, doi = {10.1134/S0032946016030066}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/KrotovV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Lebedev16, author = {Vladimir S. Lebedev}, title = {Coding with noiseless feedback}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {2}, pages = {103--113}, year = {2016}, url = {https://doi.org/10.1134/S0032946016020010}, doi = {10.1134/S0032946016020010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Lebedev16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/LysyakR16, author = {A. S. Lysyak and B. Ya. Ryabko}, title = {Time series prediction based on data compression methods}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {1}, pages = {92--99}, year = {2016}, url = {https://doi.org/10.1134/S0032946016010075}, doi = {10.1134/S0032946016010075}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/LysyakR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Malyshev16, author = {Vadim A. Malyshev}, title = {The Newton and Coulomb laws as information transfer by virtual particles}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {308--318}, year = {2016}, url = {https://doi.org/10.1134/S0032946016030091}, doi = {10.1134/S0032946016030091}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Malyshev16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Mogilnykh16, author = {Ivan Yu. Mogilnykh}, title = {On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {289--298}, year = {2016}, url = {https://doi.org/10.1134/S0032946016030078}, doi = {10.1134/S0032946016030078}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Mogilnykh16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/MogilnykhS16, author = {Ivan Yu. Mogilnykh and Faina I. Solov'eva}, title = {On the symmetry group of the Mollard code}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {265--275}, year = {2016}, url = {https://doi.org/10.1134/S0032946016030042}, doi = {10.1134/S0032946016030042}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/MogilnykhS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Polyansky16, author = {N. A. Polyansky}, title = {Almost cover-free codes}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {2}, pages = {142--155}, year = {2016}, url = {https://doi.org/10.1134/S0032946016020046}, doi = {10.1134/S0032946016020046}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Polyansky16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Prelov16, author = {Vyacheslav V. Prelov}, title = {On some extremal problems for mutual information and entropy}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {4}, pages = {319--328}, year = {2016}, url = {https://doi.org/10.1134/S0032946016040013}, doi = {10.1134/S0032946016040013}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Prelov16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Shchukin16, author = {Vladislav Yu. Shchukin}, title = {List decoding for a multiple access hyperchannel}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {4}, pages = {329--343}, year = {2016}, url = {https://doi.org/10.1134/S0032946016040025}, doi = {10.1134/S0032946016040025}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/poit/Shchukin16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Shirokov16, author = {Maksim E. Shirokov}, title = {Estimates for discontinuity jumps of information characteristics of quantum systems and channels}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {3}, pages = {239--264}, year = {2016}, url = {https://doi.org/10.1134/S0032946016030030}, doi = {10.1134/S0032946016030030}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Shirokov16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Shmatkov16, author = {V. D. Shmatkov}, title = {Lattice flows in networks}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {1}, pages = {24--38}, year = {2016}, url = {https://doi.org/10.1134/S003294601601004X}, doi = {10.1134/S003294601601004X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Shmatkov16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Tarasov16, author = {Veniamin N. Tarasov}, title = {Analysis of queues with hyperexponential arrival distributions}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {1}, pages = {14--23}, year = {2016}, url = {https://doi.org/10.1134/S0032946016010038}, doi = {10.1134/S0032946016010038}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Tarasov16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Warsi16, author = {Naqueeb Ahmad Warsi}, title = {Simple one-shot bounds for various source coding problems using smooth R{\'{e}}nyi quantities}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {1}, pages = {39--65}, year = {2016}, url = {https://doi.org/10.1134/S0032946016010051}, doi = {10.1134/S0032946016010051}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Warsi16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/Zaitsev16, author = {S. N. Zaitsev}, title = {A triangular class of skew maximum-period polynomials}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {4}, pages = {391--399}, year = {2016}, url = {https://doi.org/10.1134/S0032946016040062}, doi = {10.1134/S0032946016040062}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/Zaitsev16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/poit/ZinovievZ16, author = {Victor A. Zinoviev and Dmitrii V. Zinoviev}, title = {Generalized Preparata codes and 2-resolvable Steiner quadruple systems}, journal = {Probl. Inf. Transm.}, volume = {52}, number = {2}, pages = {114--133}, year = {2016}, url = {https://doi.org/10.1134/S0032946016020022}, doi = {10.1134/S0032946016020022}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/poit/ZinovievZ16.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.