期刊文献+

非线性网络编码实例研究 被引量:1

Nonlinear Network Coding:A Case Study
下载PDF
导出
摘要 在网络编码研究中,线性编码技术已趋于成熟,但它有着需要大字符表且不适用于非多播网络的弱点,这推动了对非线性编码的研究。本文给出编码函数的新描述,在此基础上将非线性编码分成两类:证明了前者与线性编码等价,能从线性编码中构造出,且具有相同的编码能力;证明了后者的存在性。 In the area of network coding,linear code can achieve the maximum capacity of multicast networks by large alphabets. However, it is insufficient for non-multicast networks. Meanwhile nonlinear code is of interest for its possibility to achieve the network coding capacity by small alphabet,or its possibility to deal with other networks. There is no schema of nonlinear code in our literature. In this paper, a novel characterization of nonlinear code is proposed. We reveal that a kind of nonlinear code can be induced from linear code,and it has the same coding ability as linear code. We also show the existence of another kind of polynomial code.
出处 《计算机科学》 CSCD 北大核心 2008年第7期67-69,共3页 Computer Science
基金 国家自然科学基金项目(60273062 60573039) 广东省自然科学基金项目(04205407 5003350)资助
关键词 多播 网络编码 线性编码 非线性编码 Multicast, Network coding, Linear code, Nonlinear code
  • 相关文献

参考文献12

  • 1Ahlswede R,Cai N,Li S Y R,et al. Network information flow. IEEE Transactions on Information Theory, 2000,45(4) : 1204-1215.
  • 2Li S Y R,Cai N. Linear network coding. IEEE Transactions on Information Theory, 2003,49(2) : 371-381.
  • 3Ho T,Koetter R, Medard M, et al. The benefits of coding over routing in a randomized setting//IEEE International Symposium on Information Theory (ISIT). 2003.
  • 4Chou P, Wu Y,Jain K. Practical network coding//Allerton Conference on Communication, Control, and Computing. 2003.
  • 5Jaggi S,Sanders P,Chou P,et al. Polynomial time algorithms for multieast network code eonstruetion. IEEE Transaetions on Information Theory, 2005,51 (6) : 1973-1982.
  • 6Koetter R, Medard M. An algebraic approach to network coding. IEEE/ACM Transactions on Networking (TON), 2003,11 (5): 782-795.
  • 7Feder M,Ron D,Tavory A. Bounds on linear codes for network multieast//Electronie Colloquium on Computational Complexity (ECCC). 2003,10(033).
  • 8Lehman A, Lehman E. Complexity classification of network information flow problems//Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 2004:. 142-150.
  • 9Dougherty R, Freiling C, Zeger K. Linearity and solvability in multieast networks. IEEE Transactions on Information Theory, 2004,50(10) : 2243-2256.
  • 10Dougherty R, Freiling C, Zeger K. Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory, 2005,51 (8) : 2745-2759.

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部