Decodability of Network Coding with Time-Varying Delay and No Buffering
スポンサーリンク
概要
- 論文の詳細を見る
We show the sufficient conditions for coding by nodes such that every sink can decode all information multicasted by the single source when there exists time-varying delay of information transmission at links in the network coding.
- （社）電子情報通信学会の論文
- 2009-08-01
著者
-
MATSUMOTO Ryutaroh
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
UYEMATSU Tomohiko
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Uyematsu Tomohiko
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
TATENO Terumasa
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Matsumoto Ryutaroh
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Tateno Terumasa
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
関連論文
- Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model
- An Improved Bound for the Dimension of Subfield Subcodes
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet(Source Coding,Information Theory and Its Applications)
- FOREWORD
- Decodability of Network Coding with Time-Varying Delay and No Buffering
- Universal Coding for Correlated Sources with Complementary Delivery(Information Theory and Its Applications)
- Universal source coding for complementary delivery
- Information-theoretical analysis of index searching : Revised
- Multiterminal source coding with complementary delivering(HISC2006)
- Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
- Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth(Internet)
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder(Communication Theory)(Information Theory and Its Applications)
- On the Feng-Rao Bound for the L-construction of Algebraic Geometry Codes
- Using C_ Curves in the Function Field Sieve
- Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound(Information Theory and Its Applications)
- Linear Codes on Nonsingular Curves are Better than Those on Singular Curves
- Randomness of Individual Sequences
- Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
- A Novel Realization of Threshold Schemes over Binary Field Extensions
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight