Zobrazeno 1 - 10
of 146
pro vyhledávání: '"S. Sandeep Pradhan"'
Publikováno v:
Journal of High Energy Physics, Vol 2020, Iss 1, Pp 1-42 (2020)
Abstract We demonstrate within the quantum field theoretical framework that an asymptotic particle falling into the black hole implants soft graviton hair on the horizon, conforming with the classical proposal of Hawking, Perry and Strominger. A key
Externí odkaz:
https://doaj.org/article/632801c2a07d4c3c812556ec21b2cd6f
Publikováno v:
IEEE Transactions on Information Theory. 68:7913-7934
Autor:
Farhad Shirani, S. Sandeep Pradhan
Publikováno v:
IEEE Transactions on Information Theory. 67:4485-4503
In this work, lossy distributed compression of a pair of correlated sources is considered. Conventionally, Shannon’s random coding arguments — using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically large
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Autor:
Farhad Shirani, S. Sandeep Pradhan
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Autor:
Touheed Anwar Atif, S. Sandeep Pradhan
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Let $A(n, d)$ denote the maximum size of a binary code of length $n$ and minimum Hamming distance $d$. Studying $A(n, d)$, including efforts to determine it as well to derive bounds on $A(n, d)$ for large $n$'s, is one of the most fundamental subject
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00c447e1af0a75d27d51fcc110162370
http://arxiv.org/abs/2202.03472
http://arxiv.org/abs/2202.03472
Autor:
S. Sandeep Pradhan, Mohsen Heidari
Publikováno v:
IEEE Transactions on Information Theory. 66:4203-4225
In this work, we study two problems: three-user Multiple-Access Channel (MAC) with correlated sources, and MAC with Feedback (MAC-FB) with independent messages. For the first problem, we identify a structure in the joint probability distribution of d