Performance information

• Equivalences among Some Information Measures for Individual Sequences and Their Applications for Fixed-Length Coding Problems　　　　　　　　　　　　　　　
  UYEMATSU Tomohiko; MATSUTA Tetsunao
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Volume：E107.A, Number：3, First page：393, Last page：403, Mar. 2024
  This paper proposes three new information measures for individual sequences and clarifies their properties. Our new information measures are called as the non-overlapping max-entropy, the overlapping smooth max-entropy, and the non-overlapping smooth max-entropy, respectively. These measures are related to the fixed-length coding of individual sequences. We investigate these measures, and show the following three properties: (1) The non-overlapping max-entropy coincides with the topological entropy. (2) The overlapping smooth max-entropy and the non-overlapping smooth max-entropy coincide with the Ziv-entropy. (3) When an individual sequence is drawn from an ergodic source, the overlapping smooth max-entropy and the non-overlapping smooth max-entropy coincide with the entropy rate of the source. Further, we apply these information measures to the fixed-length coding of individual sequences, and propose some new universal coding schemes which are asymptotically optimum.
  The Institute of Electronics, Information and Communication Engineers, English
  DOI：https://doi.org/10.1587/transfun.2023tap0005
  DOI ID：10.1587/transfun.2023tap0005, ISSN：0916-8508, eISSN：1745-1337
• An Equivalent Expression for the Wyner-Ziv Source Coding Problem　　　　　　　　　　　　　　　
  Tetsunao MATSUTA; Tomohiko UYEMATSU
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Volume：E105.A, Number：3, First page：353, Last page：362, Mar. 2022, [Reviewed]
  Institute of Electronics, Information and Communications Engineers (IEICE), Scientific journal
  DOI：https://doi.org/10.1587/transfun.2021tap0005
  DOI ID：10.1587/transfun.2021tap0005, ISSN：0916-8508, eISSN：1745-1337, DBLP ID：journals/ieiceta/MatsutaU22
• Coding Theorems for Asynchronous Slepian–Wolf Coding Systems
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEEE Transactions on Information Theory, Volume：66, Number：8, First page：4774, Last page：4795, Aug. 2020, [Reviewed]
  Institute of Electrical and Electronics Engineers (IEEE), Scientific journal
  DOI：https://doi.org/10.1109/tit.2020.2974736
  DOI ID：10.1109/tit.2020.2974736, ISSN：0018-9448, eISSN：1557-9654
• Achievable Rate Regions for Source Coding with Delayed Partial Side Information.
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEICE Trans. Fundam. Electron. Commun. Comput. Sci., Volume：102-A, Number：12, First page：1631, Last page：1641, 2019, [Reviewed]
  Scientific journal
  Dblp：https://dblp.uni-trier.de/db/journals/ieicet/ieicet102a.html#MatsutaU19
  DBLP ID：journals/ieicet/MatsutaU19
• Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem.　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEICE Trans. Fundam. Electron. Commun. Comput. Sci., Volume：101-A, Number：12, First page：2110, Last page：2124, 2018, [Reviewed]
  Scientific journal
  DOI：https://doi.org/10.1587/transfun.E101.A.2110
  Dblp：https://dblp.uni-trier.de/db/journals/ieicet/ieicet101a.html#MatsutaU18a
  DOI ID：10.1587/transfun.E101.A.2110, DBLP ID：journals/ieicet/MatsutaU18a
• An Information-Theoretical Analysis of the Minimum Cost to Erase Information.　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEICE Trans. Fundam. Electron. Commun. Comput. Sci., Volume：101-A, Number：12, First page：2099, Last page：2109, 2018, [Reviewed]
  Scientific journal
  DOI：https://doi.org/10.1587/transfun.E101.A.2099
  Dblp：https://dblp.uni-trier.de/db/journals/ieicet/ieicet101a.html#MatsutaU18
  DOI ID：10.1587/transfun.E101.A.2099, DBLP ID：journals/ieicet/MatsutaU18
• Joint Channel Coding and Intrinsic Randomness.　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  IEICE Trans. Fundam. Electron. Commun. Comput. Sci., Volume：101-A, Number：12, First page：2091, Last page：2098, 2018, [Reviewed]
  Scientific journal
  DOI：https://doi.org/10.1587/transfun.E101.A.2091
  Dblp：https://dblp.uni-trier.de/db/journals/ieicet/ieicet101a.html#UyematsuM18
  DOI ID：10.1587/transfun.E101.A.2091, DBLP ID：journals/ieicet/UyematsuM18
• Achievable Rate Regions of Cache-Aided Broadcast Networks for Delivering Content with a Multilayer Structure.　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEICE Trans. Fundam. Electron. Commun. Comput. Sci., Volume：100-A, Number：12, First page：2629, Last page：2640, 2017, [Reviewed]
  Scientific journal
  DOI：https://doi.org/10.1587/transfun.E100.A.2629
  Dblp：https://dblp.uni-trier.de/db/journals/ieicet/ieicet100a.html#MatsutaU17
  DOI ID：10.1587/transfun.E100.A.2629, DBLP ID：journals/ieicet/MatsutaU17
• Second-Order Intrinsic Randomness for Correlated Non-Mixed and Mixed Sources.　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  IEICE Trans. Fundam. Electron. Commun. Comput. Sci., Volume：100-A, Number：12, First page：2615, Last page：2628, 2017, [Reviewed]
  Scientific journal
  DOI：https://doi.org/10.1587/transfun.E100.A.2615
  Dblp：https://dblp.uni-trier.de/db/journals/ieicet/ieicet100a.html#UyematsuM17
  DOI ID：10.1587/transfun.E100.A.2615, DBLP ID：journals/ieicet/UyematsuM17
• New Non-Asymptotic Bounds on Numbers of Codewords for the Fixed-Length Lossy Compression.　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEICE Trans. Fundam. Electron. Commun. Comput. Sci., Volume：99-A, Number：12, First page：2116, Last page：2129, 2016, [Reviewed]
  Scientific journal
  DOI：https://doi.org/10.1587/transfun.E99.A.2116
  Dblp：https://dblp.uni-trier.de/db/journals/ieicet/ieicet99a.html#MatsutaU16
  DOI ID：10.1587/transfun.E99.A.2116, DBLP ID：journals/ieicet/MatsutaU16
• On the Wyner-Ziv Source Coding Problem with Unknown Delay.　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEICE Trans. Fundam. Electron. Commun. Comput. Sci., Volume：97-A, Number：12, First page：2288, Last page：2299, 2014, [Reviewed]
  Scientific journal
  DOI：https://doi.org/10.1587/transfun.E97.A.2288
  Dblp：https://dblp.uni-trier.de/db/journals/ieicet/ieicet97a.html#MatsutaU14
  DOI ID：10.1587/transfun.E97.A.2288, DBLP ID：journals/ieicet/MatsutaU14
• Random-Coding Exponential Error Bounds for Channels with Action-Dependent States　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Volume：E96A, Number：12, First page：2324, Last page：2331, Dec. 2013, [Reviewed]
  Weissman introduced a coding problem for channels with action-dependent states. In this coding problem, there are two encoders and a decoder. An encoder outputs an action that affects the state of the channel. Then, the other encoder outputs a codeword of the message into the channel by using the channel state. The decoder receives a noisy observation of the codeword, and reconstructs the message. In this paper, we show an exponential error bound for channels with action-dependent states based on the random coding argument.
  IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, English, Scientific journal
  DOI：https://doi.org/10.1587/transfun.E96.A.2324
  DOI ID：10.1587/transfun.E96.A.2324, ISSN：1745-1337, Web of Science ID：WOS:000329006900002
• Parametric Forms of the Achievable Rate Region for Source Coding with a Helper　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto
  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Volume：E95A, Number：12, First page：2493, Last page：2497, Dec. 2012, [Reviewed]
  Source coding with a helper is one of the most fundamental fixed-length source coding problem for correlated sources. For this source coding, Wyner and Ahlswede-Korner showed the achievable rate region which is the set of rate pairs of encoders such that the probability of error can be made arbitrarily small for sufficiently large block length. However, their expression of the achievable rate region consists of the sum of indefinitely many sets. Thus, their expression is not useful for computing the achievable rate region. This paper deals with correlated sources whose conditional distribution is related by a binary-input output-symmetric channel, and gives a parametric form of the achievable rate region in order to compute the region easily.
  IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, English, Scientific journal
  DOI：https://doi.org/10.1587/transfun.E95.A.2493
  DOI ID：10.1587/transfun.E95.A.2493, ISSN：0916-8508, eISSN：1745-1337, Web of Science ID：WOS:000313146100048
• A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Volume：E94A, Number：11, First page：2105, Last page：2120, Nov. 2011, [Reviewed]
  The multiple-access channel (MAC) becomes very popular in various communication systems, because multi-terminal communication systems have been widely used in practical systems, e.g., mobile phones and P2P, etc. For some MACs, it is known that feedback can enlarge the capacity region, where the capacity region is the set of rate pairs such that the error probability can be made arbitrarily small for sufficiently large block length. The capacity region for general MACs, which are not required to satisfy ergodicity and stationarity with perfect feedback was first shown by Tatikonda and Mitter without the proof, where perfect feedback means that the channel output is perfectly fed back to senders. In this paper, we generalize Tatikonda and Mitter's result to the case of deterministic feedback, where the values of deterministic functions of past channel outputs is fed back to senders. We show that the capacity region for general MACs with deterministic feedback can be represented by the information-spectrum formula introduced by Han and Verdu, and directed information introduced by Massey. We also investigate the compound MAC problem, the epsilon-coding problem, the strong converse property and the cost constraint problem for general MACs with deterministic feedback.
  IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, English, Scientific journal
  DOI：https://doi.org/10.1587/transfun.E94.A.2105
  DOI ID：10.1587/transfun.E94.A.2105, ISSN：0916-8508, eISSN：1745-1337, Web of Science ID：WOS:000296673300006
• Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto
  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Volume：E93A, Number：11, First page：1878, Last page：1888, Nov. 2010, [Reviewed]
  Low density parity check (LDPC) codes become very popular in channel coding since they can achieve the performance close to maximum likelihood (ML) decoding with linear complexity of the block length Recently Muramatsu et al proposed a code using LDPC matrices for Slepian Wolf source coding and showed that their code can achieve any point in the achievable rate region of Slepian Wolf source coding How ever since they employed ML decoding their decoder needs to know the probability distribution of the source Hence It is an open problem whether there exists a universal code using LDPC matrices where universal code means that the error probability of the code vanishes as the block length tends to infinity for all sources whose achievable rate region contains the rate pair of encoders In this paper we show the existence of a universal Slepian Wolf source code using LDPC matrices for stationary memoryless sources
  IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, English, Scientific journal
  DOI：https://doi.org/10.1587/transfun.E93.A.1878
  DOI ID：10.1587/transfun.E93.A.1878, ISSN：0916-8508, eISSN：1745-1337, Web of Science ID：WOS:000284448800003

• Achievable Cost Region for Erasure of Distributed Information Using a Common Random Number.　　　　　　　　　　　　　　　
  Tetsunao Matsuta
  Proc. of the 2024 International Symposium on Information Theory and Its Applications (ISITA), First page：176, Last page：181, Nov. 2024, [Reviewed]
  DOI：https://doi.org/10.23919/ISITA60732.2024.10858282
  DOI ID：10.23919/ISITA60732.2024.10858282, DBLP ID：conf/isita/Matsuta24
• An Equivalent Expression for the Source Coding Problem with Side Information at Many Decoders　　　　　　　　　　　　　　　
  Tetsunao Matsuta
  First page：31, Last page：35, Oct. 2023
• An Achievable Cost Region for Information Erasure Using a Common Random Number for Distributed Information　　　　　　　　　　　　　　　
  松田哲直
  電子情報通信学会技術研究報告(Web), Volume：122, Number：427(IT2022 68-138), 2023
  ISSN：2432-6380, J-Global ID：202302291868713738
• An Equivalent Expression for the Source Coding Problem when Side Information May Be Absent　　　　　　　　　　　　　　　
  Tetsunao Matsuta
  Proc. of the 44th Symposium on Information Theory and its Applications, First page：349, Last page：353, Dec. 2021
  English
• Upper and Lower Bounds on the Capacity of Private Information Retrieval Allowing Information Leakage from Queries with Different Limits for Each Database　　　　　　　　　　　　　　　
  豊田修与; 松田哲直; 植松友彦
  電子情報通信学会技術研究報告(Web), Volume：120, Number：410(IT2020 112-157), 2021
  ISSN：2432-6380, J-Global ID：202102290154854218
• An Equivalent Expression for the Wyner-Ziv Source Coding Problem.
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 2020 International Symposium on Information Theory and Its Applications, First page：21, Last page：25, Oct. 2020, [Reviewed]
  IEEE
  DBLP ID：conf/isita/MatsutaU20
• キャッシュを有するリレーノードを介したコンテンツ配信システムにおける伝送レートの上下界　　　　　　　　　　　　　　　
  大崎佑太; 松田哲直; 植松友彦
  Number：A-2-9, Mar. 2020
• Joint Multiple-Access and Channel Intrinsic Randomness　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  Proc. of the 11th Shannon Theory Workshop, First page：2, Last page：9, Oct. 2019
• 二段階の情報消去にかかるコストの領域に対する内界と外界　　　　　　　　　　　　　　　
  松田哲直; 柴田衛; 植松友彦
  First page：59, Last page：66, Oct. 2019
• 2元入力出力対称通信路におけるキャパシティーエナジー関数の導出　　　　　　　　　　　　　　　
  李白; 植松友彦; 松田哲直
  Number：A-2-3, First page：23, Mar. 2019
• 送信機がエナジーハーベストを行う場合の多重アクセス通信路の通信路容量域　　　　　　　　　　　　　　　
  田中佑佳; 松田哲直; 植松友彦
  Number：A-2-2, First page：22, Mar. 2019
• On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), First page：2334, Last page：2338, 2019, [Reviewed]
  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 not have any cycle and in which all nodes have the same number of edges connected to a node. For this network, we clarify that, with quite high probability, the origin node is within the distance "3" from the node selected by the optimal estimator, where the distance is the number of edges of the unique path connecting two nodes. This is clarified by the probability distribution of the distance between the origin and the selected node.
  IEEE, English
  Web of Science ID：WOS:000489100302086
• Equivalence among Some Information Measures for Individual Sequences　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  Proc. of the 41th Symposium on Information Theory and its Applications, First page：226, Last page：231, Dec. 2018
• Equivalent Representations for Two Source Coding Problems　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 41th Symposium on Information Theory and its Applications, First page：143, Last page：148, Dec. 2018
• The Access Structure of a Secret Sharing Scheme Using Locally Repairable Codes　　　　　　　　　　　　　　　
  中田 昌伸; 植松 友彦; 松田 哲直
  Volume：117, Number：487, First page：25, Last page：30, 08 Mar. 2018
  Japanese
  ISSN：0913-5685, CiNii Articles ID：40021521246, CiNii Books ID：AN10013083
• Outage Capacity of a Two-User MIMO Interference Channel for Simultaneous Information and Energy Transfer　　　　　　　　　　　　　　　
  池端 健吾; 植松 友彦; 松本 隆太郎; 松田 哲直
  Volume：117, Number：487, First page：43, Last page：48, 08 Mar. 2018
  Japanese
  ISSN：0913-5685, CiNii Articles ID：40021521263, CiNii Books ID：AN10013083
• Achievable Rate Regions for Source Coding with Delayed Partial Side Information　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), First page：369, Last page：373, 2018, [Reviewed]
  In this paper, we consider a source coding with side information partially used at the decoder through a codeword. We assume that there exists a relative delay (or gap) of the correlation between the source sequence and side information. We also assume that the delay is unknown but the maximum of possible delays is known to two encoders and the decoder, where we allow the maximum of delays to be subject to change by the block length. In this source coding, we give an inner bound and an outer bound on the achievable rate region, where the achievable rate region is the set of rate pairs of encoders such that the decoding error probability vanishes as the block length tends to in fi nity. Furthermore, we clarify that the inner bound coincides with the outer bound when the maximum of delays for the block length converges to a constant.
  IEEE, English
  Web of Science ID：WOS:000468678100076
• Error Exponents of Joint Channel Coding and Intrinsic Randomness for Memoryless Channels　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), First page：276, Last page：280, 2018, [Reviewed]
  This paper considers a joint channel coding and random number generation from channel outputs. Specifically, we want to transmit a message to a receiver reliably and at the same time the receiver extracts pure random bits independent of the channel input. We call this problem as the joint channel coding and intrinsic randomness problem. For stationary memoryless channels, we show exponential upper bounds on both the decoding error probability and the variational distance between the distribution of the obtained random number and the uniform distribution. We also clarify that the obtained both bounds vanish as the block length tends to infinity, whenever a pair of coding rate and random bit rate is within the achievable rate region. Further, the above performance can be obtained by a universal scheme which does not depend on the channel.
  IEEE, English
  Web of Science ID：WOS:000468678100057
• 単語の先験的な出現頻度に基づくPPMによる英文テキスト圧縮法　　　　　　　　　　　　　　　
  竹田光佑; 植松友彦; 松田哲直
  First page：137, Last page：141, Nov. 2017
• Joint Channel Coding and Channel Intrinsic Randomness　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  Proc. of the 40th Symposium on Information Theory and its Applications, First page：329, Last page：334, Nov. 2017
• Achievable Rate Regions for Asynchronous Slepian-Wolf Coding Systems Under Source Uncertainty　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 10th Shannon Theory Workshop, First page：32, Last page：39, Oct. 2017
• On the Minimum Cost to Modify Source Sequences　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the IEICE Society Conference, Number：A-2-2, First page：18, Aug. 2017
• Invited Talk : On the Wyner-Ziv Coding Problem with Delayed Side Information　　　　　　　　　　　　　　　
  松田 哲直; 植松 友彦
  Volume：116, Number：504, First page：115, Last page：120, 09 Mar. 2017, [Invited]
  Japanese
  ISSN：0913-5685, CiNii Articles ID：40021158593, CiNii Books ID：AN10013083
• Spectrum Sensing in Cooperative with Some Secondary Users　　　　　　　　　　　　　　　
  村中 勇樹; 松本 隆太郎; 松田 哲直; 植松 友彦
  Volume：116, Number：504, First page：209, Last page：214, 09 Mar. 2017
  Japanese
  ISSN：0913-5685, CiNii Articles ID：40021158739, CiNii Books ID：AN10013083
• Coded Caching: 受信者のキャッシュメモリを利用したブロードキャストにおける効率的なキャッシング方式　　　　　　　　　　　　　　　
  松田哲直
  Number：AT-1-1, First page：SS-22, Last page：SS-25, Mar. 2017, [Invited]
• On the Wyner-Ziv Coding Problem with Delayed Side Information
  Tetsunao MATSUTA; Tomohiko UYEMATSU
  IEICE ESS Fundamentals Review, Volume：11, Number：1, First page：6, Last page：16, 2017
  Institute of Electronics, Information and Communications Engineers (IEICE), Introduction other
  DOI：https://doi.org/10.1587/essfr.11.1_6
  DOI ID：10.1587/essfr.11.1_6, eISSN：1882-0875
• On the Minimum Worst-Case Cost and the Minimum Average Cost to Erase Information　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  2017 IEEE INFORMATION THEORY WORKSHOP (ITW), First page：254, Last page：258, 2017, [Reviewed]
  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 that is independent of the information. The overwriting is needed only at places where overwritten symbols are different from original symbols. Then, the cost of overwrites such as the number of overwritten symbols to erase information is important. In this paper, we deal with the worst-case cost which is the cost to erase the most laborious sequence and the average cost which is the expectation of the cost with respect to sequences. We clarify the minimum worst-case cost such that the mutual information between the original sequence and the overwritten sequence normalized by the blocklength of the sequences goes to zero as the blocklength tends to infinity. We also clarify the minimum average cost for stationary memoryless sources in the finite blocklength regime.
  IEEE, English
  ISSN：2475-420X, Web of Science ID：WOS:000426901500052
• On the Minimum Cost to Erase Information: An Information Theoretic Approach　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 39th Symposium on Information Theory and its Applications, First page：176, Last page：181, Dec. 2016
• A Simple Proof of Coding Theorem for Multiple-Access Channels　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  Proc. of the 39th Symposium on Information Theory and its Applications, First page：527, Last page：532, Dec. 2016
• 送信ユーザーを限定した場合の公開通信路を用いた多者間秘密鍵容量について　　　　　　　　　　　　　　　
  中村祥有; 松田哲直; 松本隆太郎; 植松友彦
  First page：396, Last page：399, Dec. 2016
• A General Formula of the Achievable Rate Region for the Successive Refinement Problem　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the IEICE Society Conference, Number：A-2-1, First page：37, Sep. 2016
• Bayesian Estimation of the Virus Source of an Infection in a Network Using Any Prior Distribution　　　　　　　　　　　　　　　
  木戸 涼介; 松田 哲直; 松本 隆太郎; 植松 友彦
  Volume：115, Number：500, First page：19, Last page：24, 10 Mar. 2016
  Japanese
  ISSN：0913-5685, CiNii Articles ID：40020789986, CiNii Books ID：AN10013083
• The Minimum Codelength of Multiple-Uniprior Index Coding　　　　　　　　　　　　　　　
  高橋 優; 松田 哲直; 松本 隆太郎; 植松 友彦
  Volume：115, Number：500, First page：55, Last page：60, 10 Mar. 2016
  English
  ISSN：0913-5685, CiNii Articles ID：40020790049, CiNii Books ID：AN10013083
• Intrinsic Randomness Problem for Correlated General Sources (情報理論)　　　　　　　　　　　　　　　
  植松 友彦; 松田 哲直
  Volume：115, Number：500, First page：61, Last page：66, 10 Mar. 2016
  English
  ISSN：0913-5685, CiNii Articles ID：40020790054, CiNii Books ID：AN10013083
• Secrecy Rates for the Gaussian Wiretap Channel with an Energy Transfer Cooperative Jammer　　　　　　　　　　　　　　　
  小宮山 智也; 松本 隆太郎; 松田 哲直; 植松 友彦
  Volume：115, Number：500, First page：131, Last page：136, 10 Mar. 2016
  Japanese
  ISSN：0913-5685, CiNii Articles ID：40020790181, CiNii Books ID：AN10013083
• Caching-Aided Multicast for Partial Information　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, First page：600, Last page：604, 2016, [Reviewed]
  This paper deals with a multicast network with a server and many users. The server has content files with the same size, and each user requests one of the files. On the other hand, each user has a local memory, and a part of information of the files is cached (i.e., stored) in these memories in advance of users' requests. By using these cached information as side information, the server encodes files based on users' requests. Then, it sends a codeword through an error-free shared link for which all users can receive a common codeword from the server without error. We assume that the server transmits either of whole or partial information of requested files at each different transmission rate (i.e., the codeword length per file size). In this paper, we focus on the region of pairs of these two rates such that (whole or partial) information of requested files are recovered at each user with an arbitrary small error probability. We give inner and outer bounds on this region.
  IEEE, English
  Web of Science ID：WOS:000390098700121
• Non-Asymptotic Bounds on Numbers of Codewords for the Successive Refinement Problem　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 38th Symposium on Information Theory and its Applications, First page：43, Last page：48, Nov. 2015
• Cache-Aided Multicast for Partially-Available Information　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 9th Shannon Theory Workshop, First page：36, Last page：43, Sep. 2015
• Outage Capacity of a Two-User Interference Channel for Simultaneous Information and Energy Transfer　　　　　　　　　　　　　　　
  OSAWA Yutaka; MATSUMOTO Ryutaroh; MATSUTA Tetsunao; UYEMATSU Tomohiko
  IEICE technical report. Information theory, Volume：114, Number：470, First page：117, Last page：122, 02 Mar. 2015
  Wireless energy transfer is attracting more attention. A two-user interference channel for simultaneous information and energy transfer includes an ID (Information Decoding)-mode receiver for receiving information, an EH (Energy Harvest)-mode receiver for harvesting the radio frequency energy and two transmitters corresponded to the receiving modes. Previous researches revealed the rate-power trade-off when the ID-mode receiver regards radio wave from the EH-mode transmitter as noise. In this study, we clarify that the ID-mode receiver is able to remove the radio wave from the EH-mode transmitter by assuming that the ID-mode receiver knows transmitting signal from the EH-mode transmitter, and that there is no trade-off between rate and power. Then, we calculate outage capacity guaranteeing received power of the EH-mode receiver by regarding communication between the ID-mode transmitter and the ID-mode receiver as one-to-one communication.
  The Institute of Electronics, Information and Communication Engineers, Japanese
  ISSN：0913-5685, CiNii Articles ID：110010017675, CiNii Books ID：AN10013083
• Non-Asymptotic Bounds for Fixed-Length Lossy Compression　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), First page：1811, Last page：1815, 2015, [Reviewed]
  In this paper, we deal with the fixed-length lossy compression with the epsilon-fidelity criterion which is a kind of the distortion criterion such that the probability of exceeding a given distortion level is less than a given probability level. We give an achievability bound and a converse bound of the minimum number of codewords with this criterion. We show that our converse bound is tighter than that of Kostina and Verdu. We also show a numerical example which demonstrates that there exists some cases where our achievability bound is tighter than that of Kostina and Verdu.
  IEEE, English
  Web of Science ID：WOS:000380904701173
• Achievable Rate Regions for Asynchronous Slepian-Wolf Coding Systems　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  2015 IEEE INFORMATION THEORY WORKSHOP - FALL (ITW), First page：312, Last page：316, 2015, [Reviewed]
  The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode input sequences emitted from two correlated sources into fixed-length codewords, and the decoder reconstructs all input sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder runs with each delay from the base time. We assume that these delays are unknown to encoders and a decoder, but the maximum of delays is known to encoders and the decoder. For this asynchronous SW coding system, we clarify the achievable rate region, where the achievable rate region is the set of rate pairs of encoders such that the decoding error probability vanishes as the block length tends to infinity. Furthermore, we show an exponential bound of the error probability for this coding system by using Gallager's random coding techniques.
  IEEE, English
  Web of Science ID：WOS:000380406900065
• Source Coding with Side Information at the Decoder Revisited　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), First page：1570, Last page：1574, 2015, [Reviewed]
  A source coding system with side information at the decoder is a typical multiterminal source coding system where output sequences of two sources are independently encoded, but a decoder recovers only one output sequence from two codewords. Since Wyner, Ahlswede and Korner independently investigated this system, we call it as the WAK coding system. This paper investigates the epsilon-achievable rate region of the WAK coding system which allows the probability of error within a fixed tolerance epsilon (is an element of (0, 1)), and clarifies the epsilon-achievable rate region for correlated general sources in terms of the smooth max-entropy and the smooth max Renyi divergence. To this end, we show a new one-shot converse theorem for the WAK coding system, and a one-shot covering lemma which is a refined version of Warsi's result. Then, combining these results, we clarify the epsilon-achievable rate region of the WAK coding system.
  IEEE, English
  Web of Science ID：WOS:000380904701125
• New Non-Asymptotic Achievability and Converse Bounds for Fixed-Length Lossy Compression　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 37th Symposium on Information Theory and its Applications, First page：189, Last page：194, Dec. 2014
• Probability Distributions of the Distance Between the Rumor Source and Its Estimation on Regular Trees　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 37th Symposium on Information Theory and its Applications, First page：605, Last page：610, Dec. 2014
• Revisiting the Rate-Distortion Theory Using Smooth Max Renyi Divergence　　　　　　　　　　　　　　　
  UYEMATSU Tomohiko; MATSUTA Tetsunao
  IEICE technical report. Information theory, Volume：114, Number：224, First page：31, Last page：36, 19 Sep. 2014
  This paper clarifies the rate-distortion function for general sources in terms of the smooth max Renyi divergence. To this end, we investigate the fixed-length coding problem with two kinds of distortion criteria. One criterion is the maximum distortion criterion, and the other is the average distortion criterion. We show a new achievability result for the latter criterion and new meta-converse theorems for both criteria, and clarify the rate-distortion functions in terms of the smooth Renyi divergence instead of the spectral mutual information. Further, we also investigate the source coding problem with ε-fidelity criterion, and clarify the rate-distortion function with ε-fidelity criterion in terms of the smooth Renyi divergence.
  The Institute of Electronics, Information and Communication Engineers, English
  ISSN：0913-5685, CiNii Articles ID：110009950859, CiNii Books ID：AN10013083
• On the Outage Energy Efficiency of Wireless Duocast Relay Multiple Access Channels in the Low Power Regime　　　　　　　　　　　　　　　
  RO Bai; UYEMATSU Tomohiko; MATSUMOTO Ryutaroh; MATSUTA Tetsunao
  IEICE technical report. Information theory, Volume：113, Number：483, First page：169, Last page：174, 10 Mar. 2014
  This paper deals with the energy effiency of energy-constrained terminals in the wireless duocast relay multiple access (DRMA) channel on which relays have large transmission power. First, we derive the cut-set outer bound of achievable rate region of the AWGN (Additive White Gaussian Noise) DRMA channel which can be obtained from the wireless DRMA channel by fixing all the fading gains. Then, we clarify inner bounds of the achievable rate region when the relays employ two different relay rules. We also show that the inner bounds asymptotically coincide with the cut-set outer bound under different situations. Finally, assuming that the wireless DRMA channel is dominated by the Rayleigh fading, we find the upper and lower bounds of the symmetric outage achievable rate, and show the trade-off between the minumum transmission energy per bit and the outage probability.
  The Institute of Electronics, Information and Communication Engineers, Japanese
  ISSN：0913-5685, CiNii Articles ID：110009861935, CiNii Books ID：AN10013083
• Identification Capacity of a Biometrical Identification System Using List Decoder　　　　　　　　　　　　　　　
  MORI Marika; MATSUTA Tetsunao; MATSUMOTO Ryutaroh; UEMATSU Tomohiko
  IEICE technical report. Information theory, Volume：113, Number：483, First page：249, Last page：254, 10 Mar. 2014
  The biometrical identification system using list decorder is a system which outputs candidates from the observed biometrical data and the registered biometrical data of the candidates. The identification capacity of this system is defined as the supremum of the ratio of the logarithm of the number of individuals registered in the database to the length of data sequence. Willems et al. clarified the identification capacity for the system which outputs only one candidate. In this paper, we show the identification capacity for the system which outputs more than one candidate, and show a sufficient condition such that this capacity is larger than obtained by Willems et al.
  The Institute of Electronics, Information and Communication Engineers, Japanese
  ISSN：0913-5685, CiNii Articles ID：110009861947, CiNii Books ID：AN10013083
• Rate-Distortion Functions for Source Coding When Side Information with Unknown Delay May Be Present　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), First page：936, Last page：940, 2014, [Reviewed]
  In this paper, we consider a lossy source coding problem with an encoder and two decoders, in which side information is available at one of the decoders with an unknown delay. We assume that the maximum of delay is known to among the encoder and two decoders. In this coding problem, we show upper and lower bounds on the rate-distortion (RD) function, where the RD function is the infimum of rates of codes of which the distortion between the source sequence and the reproduction sequence satisfies a certain distortion level. We also show that the upper bound coincides with the lower bound when the maximum of delay per block length converges to a constant. Furthermore, we show a condition such that the RD function is strictly larger than that for the case of no delay.
  IEEE, English
  Web of Science ID：WOS:000346496101014
• Revisiting the Slepian-Wolf Coding Problem for General Sources: A Direct Approach　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), First page：1336, Last page：1340, 2014, [Reviewed]
  This paper clarifies the epsilon-achievable rate region of the Slepian-Wolf (SW) coding problem for general sources. We propose new upper and lower bounds on the error probability of the SW coding system for finite block lengths. The proposed bounds are mathematically simple and characterized by an optimization problem on the subset of pairs of output sequences which is closely related to the smooth max-entropy, and are tighter than those obtained by Han. By using these bounds, we clarify the epsilon-achievable rate region. Further, we also show outer and inner bounds on the epsilon-achievable rate region in terms of the smooth max-entropy. These two bounds coincide when the error probability vanishes.
  IEEE, English
  Web of Science ID：WOS:000346496101094
• Revisiting the Rate-Distortion Theory Using Smooth Max Renyi Divergence　　　　　　　　　　　　　　　
  Tomohiko Uyematsu; Tetsunao Matsuta
  2014 IEEE INFORMATION THEORY WORKSHOP (ITW), First page：202, Last page：206, 2014, [Reviewed]
  This paper clarifies the rate-distortion function for general sources in terms of the smooth max Renyi divergence. To this end, we investigate the fixed-length coding problem with two kinds of distortion criteria. One criterion is the maximum distortion criterion, and the other is the average distortion criterion. We show a new achievability result for the latter criterion and new meta-converse theorems for both criteria, and clarify the rate-distortion functions in terms of the smooth Renyi divergence instead of the spectral mutual information.
  IEEE, English
  ISSN：2475-420X, Web of Science ID：WOS:000411449000041
• 未知の遅延を有する副情報を伴う有歪み符号化におけるレート・歪み関数　　　　　　　　　　　　　　　
  松田哲直; 植松友彦
  First page：491, Last page：496, Nov. 2013
• International Conference Report: 2013 IEEE International Symposium on Information Theory
  Tetsunao MATSUTA
  IEICE ESS Fundamentals Review, Volume：7, Number：2, First page：146, Last page：147, Oct. 2013
  Institute of Electronics, Information and Communications Engineers (IEICE), Japanese
  DOI：https://doi.org/10.1587/essfr.7.146
  DOI ID：10.1587/essfr.7.146, eISSN：1882-0875
• Smooth Renyi ダイバージェンスによる干渉通信路符号化問題　　　　　　　　　　　　　　　
  松田哲直; 植松友彦
  First page：65, Last page：72, Oct. 2013
• An Information-Spectrum Approach for Open Problems in Information Theory　　　　　　　　　　　　　　　
  MATSUTA Tetsunao
  Technical report of IEICE. SAT, Volume：113, Number：32, First page：19, Last page：24, 16 May 2013
  In information theory, a coding problem is a computable characterization of the theoretical limit of coding rates for a communication system. An open problem in information theory is a coding problem for which a computable characterization is not given. In this paper, we consider three open problems, and state about characterizations of the theoretical limit based on an information-spectrum approach introduced by Han and Verdu. Then, we show some results obtained by these characterizations.
  The Institute of Electronics, Information and Communication Engineers, Japanese
  ISSN：0913-5685, CiNii Articles ID：110009768420, CiNii Books ID：AN10012987
• An Information-Spectrum Approach for Open Problems in Information Theory　　　　　　　　　　　　　　　
  MATSUTA Tetsunao
  IEICE technical report. WBS, Wideband System, Volume：113, Number：31, First page：25, Last page：30, 16 May 2013, [Invited]
  In information theory, a coding problem is a computable characterization of the theoretical limit of coding rates for a communication system. An open problem in information theory is a coding problem for which a computable characterization is not given. In this paper, we consider three open problems, and state about characterizations of the theoretical limit based on an information-spectrum approach introduced by Han and Verdu. Then, we show some results obtained by these characterizations.
  The Institute of Electronics, Information and Communication Engineers, Japanese
  ISSN：0913-5685, CiNii Articles ID：110009768305, CiNii Books ID：AA11840009
• Universal Coding for Asynchronous Slepian-Wolf Coding Systems　　　　　　　　　　　　　　　
  MATSUTA Tetsunao; UYEMATSU Tomohiko
  IEICE technical report. Information theory, Volume：112, Number：460, First page：1, Last page：6, 07 Mar. 2013
  Slepian-Wolf (SW)coding system is the most fundamental source coding system in multi-terminal information theory. In this paper, we consider the situation in which the coding system is asynchronous, and does not know the probability distribution of the source. We assume that delays of encoding are unknown to encoders and the decoder, but maximum values of delays are known to encoders and the decoder. In this situation, we show the achievable rate region for asynchronous sw coding systems. Then, we show the existence of a universal code, where the universal code is a code of which the error probability vanishes as the block length tends to infinity for all sources whose achievable rate region contains the rate pair of encoders.
  The Institute of Electronics, Information and Communication Engineers, English
  ISSN：0913-5685, CiNii Articles ID：110009712309, CiNii Books ID：AN10013083
• A General Formula for Capacity of Channels with Action-Dependent States　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), First page：2473, Last page：2477, 2013, [Reviewed]
  Weissman introduced a channel coding problem for channels with action-dependent states. In this coding problem, there are two encoders and a decoder. One encoder outputs an action that affects states of the channel. Then, the other encoder encodes a message by using the channel state, and its codeword is fed into the channel. The decoder receives a noisy observation of the codeword, and reconstructs the message. For this coding problem, Weissman showed the capacity when states and the channel are stationary memoryless. In this paper, we show a general formula of the capacity when states and the channel may not be stationary memoryless, which is expressed by mutual information spectrum-sup/inf proposed by Verdu and Han. Our general formula coincides with the capacity derived by Tan when actions cannot affect states of channels. We also show that the capacity for nonstationary memoryless channels can be expressed by using ordinary mutual information.
  IEEE, English
  Web of Science ID：WOS:000348913402121
• Random-Coding Exponential Error Bounds for Channels with Action-Dependent States　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 35th Symposium on Information Theory and its Applications, First page：16, Last page：21, Dec. 2012
• A General Formula of Rate-Distortion Functions for Source Coding with Side Information at Many Decoders　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), First page：174, Last page：178, 2012, [Reviewed]
  Heegard and Berger introduced the model of lossy source coding in which side information is available at many decoders. For this model, their showed an upper bound of the rate-distortion function in the case where the source is stationary memoryless. In this paper, we extend their model to the case where the source may be nonstationary and/or nonergodic, and clarify the rate-distortion function for this model. This result is based on the information-spectrum method introduced by Han and Verdu. We also show some special cases of the rate-distortion function, and a single-letterized upper bound of the rate-distortion function in the case where the source is stationary memoryless.
  IEEE, English
  Web of Science ID：WOS:000312544300036
• A General Formula of Rate-Distortion Functions for Source Coding with Side Information at Many Decoders　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 34th Symposium on Information Theory and its Applications, First page：292, Last page：297, Nov. 2011
• A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu
  Proc. of the 7th Asia-Europe Workshop on Concepts in Information Theory, First page：35, Last page：40, Jul. 2011
  Summary international conference
• A Practical Algorithm of Universal Source Coding by the Most Frequent Substring　　　　　　　　　　　　　　　
  SAITO Tsuki; MATSUTA Tetsunao; MATSUMOTO Ryutaroh; UYEMATSU Tomohiko
  IEICE technical report, Volume：110, Number：442, First page：243, Last page：248, 24 Feb. 2011
  In the grammar based code proposed by Kieffer and Yang, a context-free grammar which only produces the input sequence is constructed, and the obtained grammar is encoded into a binary sequence. Lin et al. proposed a grammar based code by using the most frequent substring. Their proposed code is based on the reduction of the string which appears most frequently in the sequence. Lin et al. also proved that their code is a universal code whose average length converges to the entropy rate of the source as the length of the input sequence tends to infinity. However, it is not clear whether the grammar transformation proposed by Lin et al. can be executed in practical computational complexity. In this paper, we propose a new grammar based code by using the most frequent substring. We prove that the proposed code is a universal code, and that the proposed grammar transformation can be executed in O(n^2) for the length of the input sequence n.
  The Institute of Electronics, Information and Communication Engineers, Japanese
  ISSN：0913-5685, CiNii Articles ID：110008689046, CiNii Books ID：AN10013083
• A general formula for the capacity region of multiple-access channels with feedback　　　　　　　　　　　　　　　
  MATSUTA Tetsunao; UYEMATSU Tomohiko
  IEICE technical report, Volume：110, Number：363, First page：43, Last page：48, 11 Jan. 2011
  Recently, the multi-terminal information theory becomes more important, because multi-terminal communication systems have been widely used in practical systems, e.g., mobile phones, P2P, etc. The multiple-access channel (MAC) is one of the basic model in the multi-terminal information theory. For some MACs, it is known that feedback can enlarge the capacity region, where the capacity region is the set of rate pairs such that the error probability can be made arbitrarily small for sufficiently large block length. The capacity regions for some MACs were shown by many researchers. However, the capacity region for the general MAC, which is not required to satisfy ergodicity and stationarity, with feedback has not yet been clarified. In this paper, we show that the capacity region for general MACs with feedback can be represented by the information-spectrum formula introduced by Han and Verdu, and directed information introduced by Marko and Massey.
  The Institute of Electronics, Information and Communication Engineers, English
  ISSN：0913-5685, CiNii Articles ID：110008676117, CiNii Books ID：AN10013083
• A Design Method of Universal Channel Codes Based on Mixed Channels　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto
  Proc. of the 33th Symposium on Information Theory and its Applications, First page：25, Last page：30, Nov. 2010
• Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices　　　　　　　　　　　　　　　
  MATSUTA Tetsunao; UYEMATSU Tomohiko; MATSUMOTO Ryutaroh
  IEICE technical report, Volume：109, Number：444, First page：181, Last page：186, 25 Feb. 2010
  Low-density parity-check (LDPC) codes become very popular in channel coding, since they can achieve the performance close maximum-likelihood (ML) decoding with linear complexity of the block length. Muramatsu et al. proposed a code using LDPC matrices for Slepian-Wolf source coding. However, since they employed ML decoding, their code is not universal, that is their decoder needs to know the probability distribution of the source. On the other hand, if there exists a universal code using LDPC matrices, we can arbitrary decrease the error probability for all sources whose achievable rate region contains the rate pair of encoders even if the probability distribution of sources is unknown. To this end, we show the existence of a universal Slepian-Wolf source code using LDPC matrices in the case where the source is stationary memoryless.
  The Institute of Electronics, Information and Communication Engineers, English
  ISSN：0913-5685, CiNii Articles ID：110008000449, CiNii Books ID：AN10013083
• Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto
  2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, First page：186, Last page：190, 2010, [Reviewed]
  Low-density parity-check (LDPC) codes become very popular in channel coding, since they can achieve the performance close maximum-likelihood (ML) decoding with linear complexity of the block length. Muramatsu et al. proposed a code using LDPC matrices for Slepian-Wolf source coding. However, since they employed ML decoding, their code is not universal, that is their decoder needs to know the probability distribution of the source. On the other hand, if there exists a universal code using LDPC matrices, we can arbitrary decrease the error probability for all sources whose achievable rate region contains the rate pair of encoders even if the probability distribution of sources is unknown. To this end, we show the existence of a universal Slepian-Wolf source code using LDPC matrices in the case where the source is stationary memoryless.
  IEEE, English
  DOI：https://doi.org/10.1109/ISIT.2010.5513253
  DOI ID：10.1109/ISIT.2010.5513253, Web of Science ID：WOS:000287512700038
• Universal Slepian-Wolf Source Encoders Constructed by LDPC Matrix with Maximum-Likelihood Decoding　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto
  Proc. of the 32th Symposium on Information Theory and its Applications, First page：625, Last page：630, Nov. 2009
• Error Exponents for Wyner's Source Coding System　　　　　　　　　　　　　　　
  MATSUTA Tetsunao; WATANABE Shun; UYEMATSU Tomohiko; MATSUMOTO Ryutaroh
  IEICE technical report, Volume：108, Number：472, First page：379, Last page：385, 02 Mar. 2009
  Wyner's source coding system is one of the most fundamental fixed-length source coding systems with side information. This paper derives upper and lower bounds on the error exponent for Wyner's source coding system, and shows that the error exponent is negative whenever the rate pair is a proper inner point of the achievable rate region for Wyner's source coding system. Moreover, we show that the obtained bounds are tight in some special cases.
  The Institute of Electronics, Information and Communication Engineers, English
  ISSN：0913-5685, CiNii Articles ID：110007324368, CiNii Books ID：AN10013083
• Closed Forms of the Achievable Rate Region for Wyner's Source Coding Systems　　　　　　　　　　　　　　　
  MATSUTA Tetsunao; UYEMATSU Tomohiko; MATSUMOTO Ryutaroh
  IEICE technical report, Volume：108, Number：472, First page：371, Last page：378, 02 Mar. 2009
  Wyner's source coding system is one of the most fundamental fixed-length source coding systems with side information available only at the decoder. In this coding system, Wyner showed the achievable rate region which is the set of rate pairs of the encoders such that the probability of error can be made arbitrarily small for sufficiently large block length. However, Wyner's expression of this region consists of the sum of indefinitely many sets, and the closed form of this region is not clarified. Thus, when a rate pair is given, it is difficult to determine whether the rate pair is in the achievable rate region or not. This paper deals with two correlated sources whose conditional distribution is represented by binary input output symmetric channels, and clarifies closed forms of the achievable rate region for Wyner's source coding system.
  The Institute of Electronics, Information and Communication Engineers, English
  ISSN：0913-5685, CiNii Articles ID：110007324370, CiNii Books ID：AN10013083
• Closed Forms of the Achievable Rate Region for Wyner's Source Coding Systems　　　　　　　　　　　　　　　
  Tetsunao Matsuta; Tomohiko Uyematsu; Ryutaroh Matsumoto
  2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, First page：1214, Last page：1218, 2009, [Reviewed]
  Wyner's source coding system is one of the most fundamental fixed-length source coding systems with side information available only at the decoder. In this coding system, Wyner showed the achievable rate region which is the set of rate pairs of encoders such that the probability of error can be made arbitrarily small for sufficiently large block length. However, the closed form of this region is not clarified because the region is expressed by the union of indefinitely many sets. This paper deals with two correlated sources whose conditional distribution is represented by binary input output symmetric channels, and clarifies closed forms of the achievable rate region for Wyner's source coding system.
  IEEE, English
  DOI：https://doi.org/10.1109/ISIT.2009.5205980
  DOI ID：10.1109/ISIT.2009.5205980, Web of Science ID：WOS:000280141400247
• A Study on Detection method of Interference using Kullback-Leibler Information for UWB MB-OFDM systems　　　　　　　　　　　　　　　
  MATSUTA Tetsunao; FUJII Masahiro; WATANABE Yu
  IEICE technical report, Volume：106, Number：594, First page：1, Last page：6, 08 Mar. 2007
  In this paper, we propose a new method for Ultra-WideBand (UWB) communication systems in order to detect an interference from the other radio communication systems. The UWB systems make use of huge bandwidth in comparison with the conventional mobile communication systems. The frequency band is shared out between the UWB and the other communication systems. Although the power density spectrum of the UWB systems is sufficient low for the other systems, it has been recognized that the UWB signal on radio results in the interference from the other systems. It is very important to solve the problem in order to put the UWB systems to practical use. Therefore, the concern with Detect-And-Avoid (DAA) technologies for the UWB systems has been growing for the last several years. We can detect the interference by comparing the average received signal power among the different frequency bandwidths if we know pre-information about the frequency band of the other systems, which suffers from the interference. In this paper, we propose a new scheme to detect the interference without any information about the UWB signal and the interfering signal using Kullback-Leibler (K-L) divergence for the UWB MB-OFDM systems. As our analysis, the proposed scheme using K-L divergence is difficult to solve the problem. Thus, Akaike Information Criterion (AIC) applies to the proposed scheme in addition to the K-L divergence. By computer simulations, we show performances of the proposed scheme.
  The Institute of Electronics, Information and Communication Engineers, Japanese
  ISSN：0913-5685, CiNii Articles ID：110006248082, CiNii Books ID：AN10013083

• 有歪み符号化における符号語数に対する有限長解析　　　　　　　　　　　　　　　
  松田哲直
  Dec. 2016
• ネットワークにおける噂の発信源推定法　　　　　　　　　　　　　　　
  松田哲直
  Dec. 2015, [Invited]

• Apr. 2023 - Present
  Coding Theory, Saitama University
• Apr. 2022 - Present
  Programming Exercise III, Saitama University
• Apr. 2021 - Present
  Information Security Engineering, Saitama University
• Apr. 2021 - Present
  Introduction to Information and Computer Sciences, Saitama University
• Apr. 2021 - Present
  Exercise on Practical System Development, Saitama University
• Apr. 2021 - Present
  Practical System Development II, Saitama University
• Apr. 2021 - Present
  Practical System Development I, Saitama University
• Apr. 2021 - Present
  Advanced Lectures on Information Theory, Saitama University
• Apr. 2021 - Present
  Engineering for Society (Information and Computer Science), Saitama University
• Apr. 2021 - Mar. 2023
  Object Oriented Languages, Saitama University
• Apr. 2021 - Mar. 2022
  Introductory Seminar on Engineering, Saitama University

• IEEE
• IEICE

• 情報消去にかかるコストの理論限界とそれを達成する消去方法の解明　　　　　　　　　　　　　　　
  01 Apr. 2022 - 31 Mar. 2025
  Grant amount(Total)：4290000, Direct funding：3300000, Indirect funding：990000
  Grant number：22K11899
• 非同期通信の理論限界の解明に向けた基礎理論の構築　　　　　　　　　　　　　　　
  01 Apr. 2019 - 31 Mar. 2022
  Grant amount(Total)：3770000, Direct funding：2900000, Indirect funding：870000
  Grant number：19K04368
• 通信路を用いた乱数の生成と共有に関する研究　　　　　　　　　　　　　　　
  01 Apr. 2017 - 31 Mar. 2020
  Grant amount(Total)：2990000, Direct funding：2300000, Indirect funding：690000
  Grant number：17K06417
• 有限長のデータに対するデータ圧縮における圧縮率の理論限界の解析　　　　　　　　　　　　　　　
  01 Apr. 2015 - 31 Mar. 2020
  Grant amount(Total)：3900000, Direct funding：3000000, Indirect funding：900000
  Grant number：15K15935
• Reformulation of Information Theory by Using Smooth Renyi Entropy and Divergence　　　　　　　　　　　　　　　
  Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C), Grant-in-Aid for Scientific Research (C), 01 Apr. 2014 - 31 Mar. 2017
  UYEMATSU Tomohiko, Tokyo Institute of Technology
  Grant amount(Total)：3380000, Direct funding：2600000, Indirect funding：780000
  We reformulate various problems in information theory by using the smooth Renyi entropy and divergence, and provide a unified method to prove coding theorems. Actually, we reformulated following information theoretic problems: (1) The bound on the generation rates of uniform random numbers from output sequences of one or many sources. (2) The tradeoff relation between the distortion level and the rate of the encoder for source coding problems allowing the distortion. (3) The region of coding rates for source coding problems of correlated multiple sources. (4) The region of transmission rates for reliable communication through multiple inputs and single output channels.
  Grant number：26420343
• A Performance Analysis of Data Compression Methods for the Asynchronous Distributed Data Compression　　　　　　　　　　　　　　　
  Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research Grant-in-Aid for Young Scientists (B), Grant-in-Aid for Young Scientists (B), 01 Apr. 2013 - 31 Mar. 2015
  MATSUTA Tetsunao, Tokyo Institute of Technology
  Grant amount(Total)：1300000, Direct funding：1000000, Indirect funding：300000
  This study deals with the asynchronous distributed data compression in which encoders independently and asynchronously encode input sequences emitted from correlated sources into fixed-length codewords, and the decoder reconstructs all input sequences from the codewords. For this data compression, we obtained the following results:
  (1) We deal with the case where the maximum of encoding delays to be changed with the data length, and clarified the theoretical limit of coding rates. (2) We showed the existence of a data compression method coping with the situation that statistical properties of the information sources are unknown. (3) We showed the existence of a data compression method such that the error probability vanishes exponentially, and gave a closed-form expression of the exponent of this probability.
  Grant number：25820154

• HiGEPS基礎セミナー　　　　　　　　　　　　　　　
  lecturer
  17 Sep. 2022