Zobrazeno 1 - 10
of 332
pro vyhledávání: '"UYEMATSU, TOMOHIKO"'
Autor:
Matsuta, Tetsunao, Uyematsu, Tomohiko
The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode source sequences from two correlated sources into codewords, and the decoder reconstructs both source sequences f
Externí odkaz:
http://arxiv.org/abs/1906.02929
Autor:
Matsuta, Tetsunao, Uyematsu, Tomohiko
This paper addresses the rumor source identification problem, where the goal is to find the origin node of a rumor in a network among a given set of nodes with the rumor. In this paper, we focus on a network represented by a regular tree which does n
Externí odkaz:
http://arxiv.org/abs/1901.03039
Autor:
Matsuta, Tetsunao, Uyematsu, Tomohiko
In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by one of two
Externí odkaz:
http://arxiv.org/abs/1802.07458
Autor:
Matsuta, Tetsunao, Uyematsu, Tomohiko
We normally hold a lot of confidential information in hard disk drives and solid-state drives. When we want to erase such information to prevent the leakage, we have to overwrite the sequence of information with a sequence of symbols independent of t
Externí odkaz:
http://arxiv.org/abs/1802.07462
The key rate of the B92 quantum key distribution protocol had not been reported before this research when the number of qubits is finite. We compute it by using the security analysis framework proposed by Scarani and Renner in 2008.
Comment: 4 p
Comment: 4 p
Externí odkaz:
http://arxiv.org/abs/1504.05628
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.
By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C_1 of length n over a field extension and its subcode C_2. One is called the relative dimension/intersection profile (RDIP), an
Externí odkaz:
http://arxiv.org/abs/1301.5482
Publikováno v:
Proceedings of 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.533 -- 540, 1--5 Oct. 2012
The universal secure network coding presented by Silva et al. realizes secure and reliable transmission of a secret message over any underlying network code, by using maximum rank distance codes. Inspired by their result, this paper considers the sec
Externí odkaz:
http://arxiv.org/abs/1207.1936
A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be att
Externí odkaz:
http://arxiv.org/abs/1004.3085
Publikováno v:
J. Phys. A 43, 495302 (2010)
We improve the non-asymptotic key rate shown by Scarani and Renner by proposing several methods to construct tighter conservative confidence intervals of the phase error rate than one shown by them. In addition, we show that the accurate channel esti
Externí odkaz:
http://arxiv.org/abs/1003.5766