Combination network coding: Alphabet size and zigzag decoding
Combination network coding: Alphabet size and zigzag decoding
复制标题
组合网络编码：字母大小和 zigzag 解码
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Xueqing Gong
中科院分区：
文献类型：
--
作者：
C. Sung;Xueqing Gong
组合网络编码可以看作是最大距离可分（MDS）码的推广。MDS码所需的字母表大小的现有的界限是广义的组合网络编码。此外，还研究了一类称为Zigzag-Decodable（ZD）码的组合网络码。它只涉及异或和移位操作，可以通过一种称为锯齿形解码的快速算法解码。证明了ZD码在码率损失较小的情况下，具有较低的编译码复杂度。
Combination network coding can be regarded as a generalization of Maximum Distance Separable (MDS) code. An existing bound on the required alphabet size for MDS code is generalized for combination network coding. Besides, a class of combination network code called Zigzag-Decodable (ZD) code is considered. It involves only exclusive-OR and bit-shifting operations and can be decoded by a fast algorithm called zigzag decoding. It was proved that the ZD code has lower encoding and decoding complexities than other existing codes, at the expense of slight rate loss.