科研之友
微信
新浪微博
Facebook
分享链接
摘要
For network error-correcting codes based on network coding an explicit lower bound on the size of source alphabet is presented. This bound is deduced by a Gilbert-Varshamov greedy algorithm. The difficulty of constructing good error-correcting codes for networks is considered and ways of constructing good codes for small-scale networks are dealt with in detail.
- 出版日期2005-8
- 单位西安电子科技大学
