1 citations · 1 across the 3 of their papers we have counts for
5 papers · 1 filter
Construction of MRD Codes Based on Circular-Shift Operations
Zhe Zhai, Sheng Jin, Qifu Tyler Sun +1
Most well-known constructions of maximum rank distance (MRD) codes rely on the arithmetic of , whose increasing complexity with larger $…
Generic Construction of Optimal-Access Binary MDS Array Codes with Smaller Sub-packetization
Lan Ma, Qifu Tyler Sun, Shaoteng Liu +1
A binary array code of length , dimension , and sub-packetization is composed of matrices over , with every column of the matri…
Circular-shift-based Vector Linear Network Coding and Its Application to Array Codes
Sheng Jin, Zhe Zhai, Qifu Tyler Sun +1
Circular-shift linear network coding (LNC) is a class of vector LNC with local encoding kernels selected from cyclic permutation matrices, so that it has low coding complexities. H…
Delay-Complexity Trade-off of Random Linear Network Coding in Wireless Broadcast
Rina Su, Qifu Tyler Sun, Zhongshan Zhang
In wireless broadcast, random linear network coding (RLNC) over GF(2^L) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decodin…
Circular-shift Linear Network Codes with Arbitrary Odd Block Lengths
Qifu Tyler Sun, Hanqi Tang, Zongpeng Li +2
Circular-shift linear network coding (LNC) is a class of vector LNC with low encoding and decoding complexities, and with local encoding kernels chosen from cyclic permutation matr…