Incremental shift matrix construction method, network coding method and system

Abstract

The invention provides an incremental shift matrix construction method, a network coding method and a system, and belongs to the technical field of computers. The incremental shift matrix construction method comprises the steps of firstly, constructing a base vector; secondly, shifting each row below the base vector as a first row rightwards by a single bit relative to the previous row to obtain a parallelogram array; thirdly, conducting the axial symmetry of an upper triangle at the leftmost end of the parallelogram relative to the hypotenuse thereof to obtain a trapezoidal array; fourthly, copying a maximum triangle at the rightmost end of the trapezoidal array to be above the trapezoidal array to obtain a triangular array; finally, according to the values of n and k in a CP-ZD (n, k) code, adopting (n-k) rows from the right-angle vertex of the triangular array and k columns rightwards as an incremental shift matrix. According to the technical scheme of the invention, the storage space is saved. Meanwhile, more data storage requirements can be met for the coding.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a method for constructing an incremental shift matrix, a network coding method and a system. Background technique [0002] With the rapid development of cloud computing, the application of network coding in distributed storage systems has attracted extensive attention. Network coding can save storage space and reduce network congestion for data restoration. In recent years, the CP property has been widely used in network coding and can provide stable and reliable data storage and resistance to hard disk damage. [0003] In order to tolerate the maximum number of failed storage nodes, codes with CP properties are widely used. The nature of CP (CombinationProperty) is to map the original data of k groups to n (n≥k) grouped data, wherein any k of the n data can completely reconstruct the original n grouped data. That is, the original information flow is split into k data packet...

AI Technical Summary

Problems solved by technology

[0006] Zigzagdecode (ZD) code (Inc-Diff), which is a cyclic permutation matrix code (Cyc-Shift), adopts zigzag decoding in the binary domain, but according to its codec method, there are the following defects: (1) more storage is required Space, the longer the data, the more storage space the encoding block needs. If it is an (n,k) code, the additional storage space required by Inc-Diff is (n-k)(k-1). If the stored data is large enough, it needs to consume The additional storage space of is large, and the additional storage space required by Cyc-Shift is Although it is improved compared with Cyc-Shift, the additional storage space consumed is still relatively large; (2) the existing encoding method is relatively fixed, and it is difficult to meet the different needs of customers with a small storage overhead

Images