Title
Systematic Memory MDS Sliding Window Codes Over Erasure Channels
Abstract
Memory maximum-distance-separable (mMDS) sliding window codes are a type of erasure codes with high erasure-correction capability and low decoding delay. In this paper, we study two types of systematic mMDS sliding window codes over erasure channels, i.e., scalar codes defined over a finite field GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</sup> ), and vector codes defined over a vector space GF(2) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</sup> . We first devise an efficient heuristic algorithm to produce an mMDS sliding window scalar code over relatively small GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</sup> ). Then, we investigate a special class of mMDS sliding window vector codes whose encoding/decoding are achieved by basic circular-shift and bit-wise XOR operations, and propose a general method to generate such mMDS vector codes. Our complexity analysis shows that the proposed vector codes yield much lower encoding/decoding complexity than the scalar codes. The theoretical and numerical results also demonstrate that mMDS sliding window codes dominate MDS block codes in terms of decoding delay and erasure-correction capability.
Year
DOI
Venue
2021
10.1109/TCOMM.2020.3041254
IEEE Transactions on Communications
Keywords
DocType
Volume
Maximum-distance-separable,sliding window code,scalar code,vector code,convolutional code,Toeplitz matrix
Journal
69
Issue
ISSN
Citations 
3
0090-6778
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Xiangyu Chen1267.46
Zongpeng Li22054153.21
Qifu Tyler Sun300.34