Art

J-GLOBAL ID：200902221255309364   Reference number：09A0792358

Decodability of Network Coding with Time-Varying Delay and No Buffering

時変遅れを伴いバッファがないネットワーク符号化の復号化可能性

Author (3)： TATENO Terumasa (Tokyo Inst. of Technol., Tokyo, JPN) ,  MATSUMOTO Ryutaroh (Tokyo Inst. of Technol., Tokyo, JPN) ,  UYEMATSU Tomohiko (Tokyo Inst. of Technol., Tokyo, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E92-A  Issue： 8  Page： 2141-2145  Publication year： Aug. 01, 2009 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 短報  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： coding (program) ,  multicast ,  *source coding ,  linear code ,  information source ,  signal transmission ,  decoding ,  feasibility ,  delay ,  sufficient condition ,  buffer memory ,  Information Theory ,  time-varying delay
Semi thesaurus term： *network coding

JST classification (1)： Communication theory in general  (ND02010V)

Reference (9)：

• AHLSWEDE, R. Network information flow. IEEE Trans. Inf. Theory. 2000, 46, 4, 1204-1216
• LI, S. Y. R. Linear network coding. IEEE Trans. Inf. Theory. 2003, 49, 2, 371-381
• JAGGI, S. Polynomial time algorithms for multicast network code construction. IEEE Trans. Inf. Theory. 2005, 51, 6, 1973-1982
• KOETTER, R. An algebraic approach to network coding. IEEE/ACM Trans. Netw. 2003, 11, 5, 782-795
• CHOU, P. A. Practical network coding. Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL. Oct. 2003. 2003, 41, 1, 40-49

Terms in the title (5)： 時変遅れ ,  バッファ ,  ネットワーク符号化 ,  復号化 ,  可能性