北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (4): 98-101.doi: 10.13190/jbupt.200804.98.013

• 研究报告 • 上一篇    下一篇

基于网络编码的多播网络码字构造

王 静1, 刘景美1, 刘向阳2, 王新梅1   

  1. 1.西安电子科技大学 综合业务网国家重点实验室,西安 710071;
    2.西安通信学院 军事综合信息网教研室,西安 710106
  • 收稿日期:2007-12-16 修回日期:1900-01-01 出版日期:2008-08-30 发布日期:2008-08-30
  • 通讯作者: 王 静

Construction of Codes in Multicast Network Based on Network Coding

WANG Jing1, LIU Jing-mei1, LIU Xiang-yang2, WANG Xin-mei1   

  1. 1. State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China; 2. Military Comprehensive Information Network Teaching Office, Xi’an Communication College, Xi’an 710106, China
  • Received:2007-12-16 Revised:1900-01-01 Online:2008-08-30 Published:2008-08-30
  • Contact: WANG Jing

摘要:

针对网络编码技术,提出了一种存在链路故障多播网络的码字构造方法。该方法通过对接收节点搜索大于信源发送速率 的 条离散路径,确保接收节点任意 条输入链路的全局编码向量线性无关,接收节点收到 个正确符号,避免链路故障,恢复信源信息。利用最大距离可分码已有的成果,给出不同发送速率下信源所需的最小有限域,构造最大距离可分码 生成矩阵,将其列向量作为接收节点输入链路的全局编码向量,设计网络码字,实现网络编码。

关键词: 网络编码, 链路失败, 最大距离可分码, 有限域

Abstract:

Based on network coding, a method for constructing codes in multicast networks with link failure is proposed. More specifically, disjoint paths ( is larger than the multicast rate so that multicast transmissions can work well even at most link failures occur) are selected for each receiver, and the global coding vectors of any input links should be linearly independent. Then the receivers can obtain right symbols, and avoid link failure. By using some results available of MDS codes, the minimal finite field which is enough to implement network coding for different multicast rate is obtained. To design codes of multicast network and implement network coding, a generator matrix of a maximum distance separable(MDS) code is constructed based on the obtained minimal finite field, and its column vectors are allocated to input links of receivers as their coding vectors.

Key words: network coding, link failure, maximum distance separable codes, finite field

中图分类号: