Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Yuval Kochman"'
Autor:
Itamar Katz, Yuval Kochman
Publikováno v:
2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b8769387fadb216611ce43a01b15eb3
https://doi.org/10.1109/allerton49937.2022.9929379
https://doi.org/10.1109/allerton49937.2022.9929379
Autor:
Yuval Kochman, Itamar Katz
Publikováno v:
ITW
Dolinar’s receiver is an architecture for distinguishing between two possible coherent states, using a photon detector and a local signal which may depend on past detector measurements. The optimal local signal satisfies very favorable properties:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fecb1239eadc65e644220a3d4e278254
https://doi.org/10.1109/itw46852.2021.9457582
https://doi.org/10.1109/itw46852.2021.9457582
Autor:
Yuval Kochman, Ligong Wang
Publikováno v:
ITW
This work addresses distributed binary hypothesis testing, where observations at two terminals are jointly Gaussian, each one standard, with two possible correlation coefficients. We assume that one of the terminals is colocated with the decision cen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d31a3ec350f1ba536269760178ad3937
https://doi.org/10.1109/itw46852.2021.9457632
https://doi.org/10.1109/itw46852.2021.9457632
Publikováno v:
arXiv
ISIT
Prof. Polyanskiy via Phoebe Ayers
ISIT
Prof. Polyanskiy via Phoebe Ayers
We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the long-standing open problem of finding the rate of convergence of the smallest attainable expec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae0dfea1f861bfe02739d12ef1e6c5e2
https://hdl.handle.net/1721.1/135399
https://hdl.handle.net/1721.1/135399
Autor:
Yuval Kochman, Michael Bell
The classical binary hypothesis testing problem is revisited. We notice that when one of the hypotheses is composite, there is an inherent difficulty in defining an optimality criterion that is both informative and well-justified. For testing in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5260e37fc701ca2f09f61ace8f156358
Publikováno v:
IEEE Transactions on Information Theory. 64:4294-4308
Upper bounds on the error probability of channel coding are derived for codebooks drawn from random codebook ensembles with various independence and symmetry assumptions. For regular decoding (without an erasure option), the random coding union bound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4beaeda5a447579e103a386f43bfc901
https://doi.org/10.1109/tit.2018.2825357
https://doi.org/10.1109/tit.2018.2825357
Publikováno v:
IEEE Transactions on Information Theory. 64:1046-1063
The problem of sending a secret message over the Gaussian multiple-input multiple-output (MIMO) wiretap channel is studied. While the capacity of this channel is known, it is not clear how to construct optimal coding schemes that achieve this capacit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3426d1bf878ec79da42c81e8f00d3a7c
https://doi.org/10.1109/tit.2017.2710058
https://doi.org/10.1109/tit.2017.2710058
Publikováno v:
ISIT
2019 IEEE International Symposium on Information Theory (ISIT 2019)
2019 IEEE International Symposium on Information Theory (ISIT 2019), Jul 2019, Paris, France. pp.1852-1856, ⟨10.1109/isit.2019.8849485⟩
2019 IEEE International Symposium on Information Theory (ISIT)
2019 IEEE International Symposium on Information Theory (ISIT 2019)
2019 IEEE International Symposium on Information Theory (ISIT 2019), Jul 2019, Paris, France. pp.1852-1856, ⟨10.1109/isit.2019.8849485⟩
2019 IEEE International Symposium on Information Theory (ISIT)
International audience; The distributed hypothesis testing (DHT) problem is considered, in which the joint distribution of a pair of sequences present at separated terminals, is governed by one of two possible hypotheses. The decision needs to be mad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::836e9d25b694ec285f050bffbe34e81b
https://doi.org/10.1109/isit.2019.8849485
https://doi.org/10.1109/isit.2019.8849485
Publikováno v:
Østergaard, J, Kochman, Y & Zamir, R 2016, ' Colored Gaussian Multiple Descriptions : Spectral and Time-Domain Forms ', I E E E Transactions on Information Theory, vol. 62, no. 10, pp. 5465-5483 . https://doi.org/10.1109/TIT.2015.2513773
It is well known that Shannon's rate-distortion function (RDF) in the colored quadratic Gaussian (QG) case can be parametrized via a single Lagrangian variable (the "water level" in the reverse water filling solution). In this work, we show that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::901b224a1b98c08cf8c66166814956b2
https://doi.org/10.1109/tit.2015.2513773
https://doi.org/10.1109/tit.2015.2513773
Publikováno v:
MIT web domain
ISIT
ISIT
Two problems, namely multiple-description source coding and joint source-channel broadcasting of a common source, are addressed. For the multiple-description problem, we revisit Ozarow's technique for establishing impossibility results, and extend it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::451cbf36a0e9c32a34b4eb55ff722f67
https://hdl.handle.net/1721.1/124442
https://hdl.handle.net/1721.1/124442