default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarat V. Burnashev
Person information
- affiliation: Russian Academy of Sciences, Moscow, Kharkevich Institute for Information Transmission Problems
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i18]Marat V. Burnashev:
On Stein's lemma in hypotheses testing in general non-asymptotic case. CoRR abs/2302.12684 (2023)- [i17]Marat V. Burnashev:
On Minimax Detection of Gaussian Stochastic Sequences with Imprecisely Known Means and Covariance Matrices. CoRR abs/2302.13254 (2023) - 2022
- [j43]Marat V. Burnashev:
On the Reliability Function for a BSC with Noiseless Feedback at Zero Rate. Probl. Inf. Transm. 58(3): 203-216 (2022) - [j42]Marat V. Burnashev:
On Minimax Detection of Gaussian Stochastic Sequences with Imprecisely Known Means and Covariance Matrices. Probl. Inf. Transm. 58(3): 265-278 (2022) - [i16]Marat V. Burnashev:
On the Reliability Function for a BSC with Noiseless Feedback at Zero Rate. CoRR abs/2210.06751 (2022) - 2021
- [j41]Marat V. Burnashev
:
The "Nontriviality" of the Union Bound for Decoding of Convolutional Codes. IEEE Commun. Lett. 25(2): 446-449 (2021) - [j40]Marat V. Burnashev:
On Minimax Detection of Gaussian Stochastic Sequences and Gaussian Stationary Signals. Probl. Inf. Transm. 57(3): 248-264 (2021) - [i15]Marat V. Burnashev:
On Minimax Detection of Gaussian Stochastic Sequences and Gaussian Stationary Signals. CoRR abs/2104.06355 (2021) - 2020
- [j39]Marat V. Burnashev:
New Upper Bounds in the Hypothesis Testing Problem with Information Constraints. Probl. Inf. Transm. 56(2): 157-172 (2020) - [i14]Marat V. Burnashev:
New Upper Bounds in the Hypothesis Testing Problem with Information Constraints. CoRR abs/2009.03149 (2020)
2010 – 2019
- 2019
- [j38]Marat V. Burnashev:
On Lower Bounds on the Spectrum of a Binary Code. Probl. Inf. Transm. 55(4): 366-375 (2019) - 2018
- [i13]Marat V. Burnashev:
Two theorems on distribution of Gaussian quadratic forms. CoRR abs/1802.07936 (2018) - [i12]Marat V. Burnashev:
On detection of Gaussian stochastic sequences. CoRR abs/1802.07940 (2018) - 2017
- [j37]Marat V. Burnashev:
Two comparison theorems for distributions of Gaussian quadratic forms. Probl. Inf. Transm. 53(3): 203-214 (2017) - [j36]Marat V. Burnashev:
On Detection of Gaussian Stochastic Sequences. Probl. Inf. Transm. 53(4): 349-367 (2017) - [j35]Christian Schlegel, Marat V. Burnashev:
The Interplay Between Error Control Coding and Iterative Signal Cancelation. IEEE Trans. Signal Process. 65(11): 3020-3031 (2017) - [c12]Marat V. Burnashev, Hirosuke Yamamoto:
On optimal error exponents in noiseless channel identification. ISIT 2017: 2737-2740 - 2016
- [c11]Marat V. Burnashev, Hirosuke Yamamoto:
On optimal transmission strategies for channels with noiseless feedback. ISIT 2016: 1282-1286 - [i11]Marat V. Burnashev:
On Reliability Function Of BSC: Expanding The Region, Where It Is Known Exactly. CoRR abs/1603.04564 (2016) - 2015
- [j34]Marat V. Burnashev, G. K. Golubev:
On limit distributions of the time of first passage over a high level. Probl. Inf. Transm. 51(2): 148-164 (2015) - [j33]Marat V. Burnashev:
On the BSC reliability function: Expanding the region where it is known exactly. Probl. Inf. Transm. 51(4): 307-325 (2015) - [i10]Marat V. Burnashev, Hirosuke Yamamoto:
On Using Feedback in a Gaussian Channel. CoRR abs/1501.04887 (2015) - 2014
- [j32]Marat V. Burnashev, Hirosuke Yamamoto:
On using noisy feedback in a Gaussian channel. Probl. Inf. Transm. 50(3): 217-231 (2014) - [c10]Marat V. Burnashev, Hirosuke Yamamoto:
Noisy feedback improves the Gaussian channel reliability function. ISIT 2014: 2554-2558 - 2013
- [c9]Christian Schlegel, Marat V. Burnashev:
Thresholds of spatially coupled systems via Lyapunov's method. ITW 2013: 1-5 - [i9]Christian Schlegel, Marat V. Burnashev:
Thresholds of Spatially Coupled Systems via Lyapunov's Method. CoRR abs/1306.3610 (2013) - 2012
- [j31]Marat V. Burnashev, Yury A. Kutoyants:
On large deviations for Poisson stochastic integrals. Probl. Inf. Transm. 48(1): 56-69 (2012) - [j30]Marat V. Burnashev, Aslan Tchamkerten:
Sequential estimation of a threshold crossing time for a Gaussian random walk through correlated observations. Probl. Inf. Transm. 48(2): 142-153 (2012) - [j29]Marat V. Burnashev, Hirosuke Yamamoto:
On the reliability function for a noisy feedback Gaussian channel: Zero rate. Probl. Inf. Transm. 48(3): 199-216 (2012) - [j28]Marat V. Burnashev, Aslan Tchamkerten:
Estimating a Random Walk First-Passage Time From Noisy or Delayed Observations. IEEE Trans. Inf. Theory 58(7): 4230-4243 (2012) - [c8]Marat V. Burnashev, Hirosuke Yamamoto:
On decoding error exponent of Gaussian channel with noisy feedback: Nonexponential number of messages. ISIT 2012: 2954-2958 - [i8]Marat V. Burnashev, Aslan Tchamkerten:
Estimating a Random Walk First-Passage Time from Noisy or Delayed Observations. CoRR abs/1203.4810 (2012) - [i7]Marat V. Burnashev, Hirosuke Yamamoto:
On Reliability Function of Gaussian Channel with Noisy Feedback: Zero Transmission Rate. CoRR abs/1208.2786 (2012) - 2011
- [c7]Marat V. Burnashev, Aslan Tchamkerten:
Estimating a Gaussian random walk first-passage time from noisy or delayed observations. ISIT 2011: 1594-1597 - 2010
- [j27]Christian Schlegel, Marat V. Burnashev, Dmitri V. Truhachev:
Generalized Superposition Modulation and Iterative Demodulation: A Capacity Investigation. J. Electr. Comput. Eng. 2010: 153540:1-153540:9 (2010) - [j26]Marat V. Burnashev, Hirosuke Yamamoto:
On the reliability function for a BSC with noisy feedback. Probl. Inf. Transm. 46(2): 103-121 (2010) - [c6]Christian Schlegel, Marat V. Burnashev:
Optimal error control coding for iterative cancellation systems. ISIT 2010: 1993-1997 - [i6]Marat V. Burnashev, Aslan Tchamkerten:
Tracking a Threshold Crossing Time of a Gaussian Random Walk Through Correlated Observations. CoRR abs/1005.0616 (2010) - [i5]Marat V. Burnashev, Hirosuke Yamamoto:
On Reliability Function of BSC with Noisy Feedback. CoRR abs/1011.2180 (2010)
2000 – 2009
- 2009
- [j25]Marat V. Burnashev, Ilya Dumer:
Error exponents for two soft-decision decoding algorithms of Reed-Muller codes. IEEE Trans. Inf. Theory 55(9): 4108-4118 (2009) - [j24]Sumeeth Nagaraj, Sheehan Khan, Christian Schlegel, Marat V. Burnashev:
Differential preamble detection in packet-based wireless networks. IEEE Trans. Wirel. Commun. 8(2): 599-607 (2009) - [c5]Hirosuke Yamamoto, Marat V. Burnashev:
Noisy feedback improves the BSC reliability function. ISIT 2009: 1501-1505 - 2008
- [j23]Lukasz Krzymien, Dmitri V. Truhachev, Christian Schlegel, Marat V. Burnashev:
Two-stage detection of partitioned random CDMA. Eur. Trans. Telecommun. 19(5): 499-509 (2008) - [j22]Marat V. Burnashev, Hirosuke Yamamoto:
On the zero-rate error exponent for a BSC with noisy feedback. Probl. Inf. Transm. 44(3): 198-213 (2008) - [c4]Marat V. Burnashev, Ilya Dumer:
Error exponents for two soft decision decoding algorithms of Reed-Muller codes. ISIT 2008: 71-75 - [c3]Marat V. Burnashev, Hirosuke Yamamoto:
On BSC, noisy feedback and three messages. ISIT 2008: 886-889 - [i4]Marat V. Burnashev, Hirosuke Yamamoto:
On zero-rate error exponent for BSC with noisy feedback. CoRR abs/0808.2092 (2008) - 2007
- [j21]Marat V. Burnashev:
Addendum to "Code spectrum and the reliability function: Binary symmetric channel". Probl. Inf. Transm. 43(1): 23-25 (2007) - [j20]Marat V. Burnashev:
Code spectrum and the reliability function: Gaussian channel. Probl. Inf. Transm. 43(2): 69 (2007) - [c2]Marat V. Burnashev:
New Results on the Reliability Function of the Gaussian Channel. ISIT 2007: 471-474 - [i3]Marat V. Burnashev:
Code spectrum and reliability function: Gaussian channel. CoRR abs/0706.0682 (2007) - [i2]Marat V. Burnashev:
Supplement to: Code Spectrum and Reliability Function: Binary Symmetric Channel. CoRR abs/cs/0701182 (2007) - 2006
- [j19]Marat V. Burnashev:
Code spectrum and the reliability function: Binary symmetric channel. Probl. Inf. Transm. 42(4): 263-281 (2006) - [j18]Christian Schlegel, Zhenning Shi, Marat V. Burnashev:
Optimal Power/Rate Allocation and Code Selection for Iterative Joint Detection of Coded Random CDMA. IEEE Trans. Inf. Theory 52(9): 4286-4294 (2006) - [j17]Marat V. Burnashev, Ilya Dumer:
Error Exponents for Recursive Decoding of Reed-Muller Codes on a Binary-Symmetric Channel. IEEE Trans. Inf. Theory 52(11): 4880-4891 (2006) - [c1]Marat V. Burnashev, Ilya Dumer:
Error exponents for recursive decoding of Reed-Muller codes. ISIT 2006: 704-708 - [i1]Marat V. Burnashev:
Code Spectrum and Reliability Function: Binary Symmetric Channel. CoRR abs/cs/0612032 (2006) - 2005
- [j16]Marat V. Burnashev:
Sharpening of an Upper Bound for the Reliability Function of a Binary Symmetric Channel. Probl. Inf. Transm. 41(4): 301-318 (2005) - 2004
- [j15]Marat V. Burnashev:
On Optimal Detectors in Multiuser Detection Problems. Probl. Inf. Transm. 40(1): 44-52 (2004) - [j14]Marat V. Burnashev, Christian Schlegel, Witold A. Krzymien, Zhenning Shi:
Analysis of the dynamics of iterative interference cancellation in iterative decoding. Probl. Inf. Transm. 40(4): 297-317 (2004) - 2003
- [j13]Marat V. Burnashev:
On Optimal Linear Detectors, Asymptotic Efficiency, and Some CDMA Problems. Probl. Inf. Transm. 39(2): 191-206 (2003) - [j12]Shun-ichi Amari, Marat V. Burnashev:
On Some Singularities in Parameter Estimation Problems. Probl. Inf. Transm. 39(4): 352-372 (2003) - [j11]Marat V. Burnashev, H. Vincent Poor:
On the probability of error in linear multiuser detection. IEEE Trans. Inf. Theory 49(8): 1922-1941 (2003) - 2002
- [j10]Marat V. Burnashev, Shun-ichi Amari:
On Density Estimation under Relative Entropy Loss Criterion. Probl. Inf. Transm. 38(4): 323-346 (2002) - 2001
- [j9]Marat V. Burnashev:
On Upper Bounds for the Decoding Error Probability of Convolutional Codes. Probl. Inf. Transm. 37(4): 307-324 (2001) - [j8]Shraga I. Bross, Marat V. Burnashev, Shlomo Shamai:
Error exponents for the two-user Poisson multiple-access channel. IEEE Trans. Inf. Theory 47(5): 1999-2018 (2001) - [j7]Marat V. Burnashev, Yury A. Kutoyants:
On minimal a-mean error parameter transmission over a Poisson channels. IEEE Trans. Inf. Theory 47(6): 2505-2515 (2001) - 2000
- [j6]Marat V. Burnashev:
On identification capacity of infinite alphabets or continuous-time channels. IEEE Trans. Inf. Theory 46(7): 2407-2414 (2000)
1990 – 1999
- 1998
- [j5]Marat V. Burnashev:
On One Useful Inequality in Testing of Hypotheses. IEEE Trans. Inf. Theory 44(4): 1668-1670 (1998) - 1995
- [j4]Marc R. Best, Marat V. Burnashev, Yannick Lévy, Alexander Moshe Rabinovich, Peter C. Fishburn, A. Robert Calderbank, Daniel J. Costello Jr.:
On a technique to calculate the exact performance of a convolutional code. IEEE Trans. Inf. Theory 41(2): 441-447 (1995) - [j3]Marat V. Burnashev, H. Vincent Poor:
Asymptotic expansions and rate of convergence in signal detection. IEEE Trans. Inf. Theory 41(6): 1773-1787 (1995)
1980 – 1989
- 1989
- [j2]Marat V. Burnashev, Ezio Biglieri:
Bounds on the minimum distance of trellis codes. IEEE Trans. Inf. Theory 35(3): 659-662 (1989) - 1984
- [j1]Marat V. Burnashev:
A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel. IEEE Trans. Inf. Theory 30(1): 23-34 (1984)
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-04-25 05:34 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:
