Data sending method, data receiving method, and communication apparatus

A method, comprising:

• receiving (T+B) second data blocks, wherein first T second data blocks in the (T+B) second data blocks are T first data blocks, last B second data blocks in the (T+B) second data blocks are B encoded data blocks, and a quantity of encoded data packets in an ith encoded data block in the B encoded data blocks is related to a quantity of original data packets in an ith first data block in first B first data blocks and a bit rate of the ith first data block;
• and
• decoding correctly received data packets in the (T+B) second data blocks, to obtain all data packets comprised in the T first data blocks,
• wherein
• a quantity Wj of incorrect data packets in a jth second data block in first B second data blocks in the received second data blocks is not greater than a quantity Mj+T of correctly received data packets in a (j+T)th second data block in the received second data blocks, and a total quantity
• ∑
• 1
• T
• ⁢
• W
• j
• of incorrect data packets in the first T second data blocks in the received second data blocks is not greater than a total quantity
• ∑
• j
• =
• T
• +
• 1
• T
• +
• B
• ⁢
• M
• j
• of correct data packets in the last B second data blocks in the received second data blocks, wherein Mj represents a quantity of correctly received data packets in a jth second data block in the (T+B) second data blocks;
• an ith first data block in the T first data blocks comprises ki original data packets, 1≤i≤T, and T, B, ki, and i are all positive integers;
• the data packet in the T first data blocks and the data packet in the (T+B) second data blocks satisfy the following relationship of a coding coefficient matrix:
• a size of the coding coefficient matrix is T rows by (T+B) columns, and an element in row i and column j in the coding coefficient matrix is represented as ai,j, wherein 1≤i≤T, 1≤j≤(T+B), j is an integer, the coding coefficient matrix is constituted by a first matrix having T rows by T columns and a check matrix having T rows by B columns, and the first matrix is located on a left side of the check matrix;
• the first matrix comprises T×T elements, each element is a matrix, T elements on a diagonal of the first matrix are all identity matrices, remaining elements are zero matrices, and the first matrix comprises the element ai,j in the coding coefficient matrix, wherein i=1, 2, . . . , B, (B+1), . . . , T, j=1, 2, . . . , T, and an element ai,j in the T elements comprises ki×kj coding coefficients;
• the check matrix comprises a first submatrix having a size that is B×B and a second submatrix having a size that is (T−B)×B, and the check matrix comprises the element ai,j in the coding coefficient matrix, wherein i=1, 2, . . . , T, j=(T+1), (T+2), . . . , (T+B), and an element ai,j in the check matrix is a ki×nj matrix;
• and the first submatrix is located on an upper side of the second submatrix, the first submatrix comprises elements in first B rows and last B columns in the coding coefficient matrix, and the second submatrix comprises elements in last (T−B) rows and the last B columns in the coding coefficient matrix;
• the first submatrix comprises B×B elements, each element is a matrix, B elements on a diagonal of the first submatrix are non-zero matrices, remaining elements are zero matrices, and the first submatrix comprises the element ai,j in the coding coefficient matrix, wherein i=1, 2, . . . , B, j=(T+1), (T+2), . . . , (T+B), and an element ai,j in the B elements comprises ki rows and nj columns and comprises ki×nj coding coefficients;
• and
• elements in the second submatrix and elements in last (T−B) rows and last (T−B) columns in the first matrix constitute a second matrix having a size that is (T−B)×B, the second matrix is a generator matrix of a system maximum distance separable code, the second submatrix is a check part of the generator matrix, the second submatrix comprises (T−B) rows and B columns, the second submatrix comprises (T−B)×B elements, and the second submatrix comprises the element ai,j in the coding coefficient matrix, wherein i=(B+1), (B+2), . . . , T, j=(T+1), (T+2), . . . , (T+B), and an element ai,j comprised in the second submatrix is an element in row i and column j and comprises ki×nj coding coefficients.

A method, comprising:

• obtaining T first data blocks, T second data blocks, and coding coefficients corresponding to original data packets in the T first data blocks and original data packets in the T second data blocks, wherein
• an ith first data block in the T first data blocks and an ith second data block in the T second data blocks each comprise ki original data packets, versions of the original data packets comprised in the T first data blocks are first redundancy versions, versions of original data packets comprised in first B second data blocks in the T second data blocks are second redundancy versions, and versions of original data packets in last (T−B) second data blocks in the T second data blocks are the first redundancy versions;
• the coding coefficients satisfy the following coding coefficient matrix:
• a size of the coding coefficient matrix is T rows by (T+B) columns, the coding coefficient matrix comprises a first matrix having T rows by T columns and a check matrix having T rows by B columns, and the first matrix is located on a left side of the check matrix;
• the first matrix comprises T×T elements, each element is a matrix, T elements on a diagonal of the first matrix are all identity matrices, remaining elements are zero matrices, an ith element in the T elements comprises ki×ki coding coefficients, and 1≤i≤T;
• the check matrix comprises a first submatrix having a size that is B×B and a second submatrix having a size that is (T−B)×B;
• and
• the first submatrix comprises B×B elements, B elements on a diagonal of the first submatrix are all identity matrices, and remaining elements are zero matrices;
• and elements in the second submatrix and elements in last (T−B) rows and last (T−B) columns in the first matrix constitute a second matrix having a size that is (T−B)×B, the second matrix is a generator matrix of a system maximum distance separable MDS code, and the second submatrix is a check part of the generator matrix;
• encoding the original data packets in the T first data blocks by using coding coefficients in the first matrix, to obtain T third data blocks;
• encoding the original data packets in the T second data blocks by using coding coefficients in the check matrix, to obtain B fourth data blocks, wherein
• the T third data blocks are the T first data blocks, the B fourth data blocks are B encoded data blocks, each encoded data block comprises one or more encoded data packets, and a quantity of data packets in an ith encoded data block in the B encoded data blocks is equal to a quantity of data packets in an ith first data block in first B first data blocks in the T first data blocks;
• and
• sending the T third data blocks and the B fourth data blocks.

A method, comprising:

• receiving (T+B) data blocks, wherein first T data blocks in the (T+B) data blocks are T third data blocks, last B data blocks in the (T+B) data blocks are B fourth data blocks, the T third data blocks correspond to T first data blocks, the B fourth data blocks are B encoded data blocks, each encoded data block in the B encoded data blocks comprises one or more encoded data packets, and a quantity of data packets in an ith encoded data block in the B encoded data blocks is equal to a quantity of data packets in an ith first data block in first B first data blocks in the T first data blocks;
• and
• decoding all or a part of data blocks in the (T+B) data blocks, to obtain all data packets comprised in the T first data blocks,
• wherein
• a relationship between the T third data blocks and the T first data blocks satisfies a first matrix in the following coding coefficient matrix, a relationship between the B fourth data blocks and T second data blocks satisfies a check matrix in the coding coefficient matrix, versions of all the data packets comprised in the T first data blocks are first redundancy versions of original data packets, versions of all data packets comprised in first B second data blocks in the T second data blocks are second redundancy versions of the original data packets, and all data packets in last (T−B) second data blocks in the T second data blocks are the first redundancy versions of the original data packets;
• an ith first data block in the T first data blocks and an ith second data block in the T second data blocks each comprise ki original data packets, 1≤i≤T, and T, B, ki, and i are all positive integers;
• a size of the coding coefficient matrix is T rows by (T+B) columns, the coding coefficient matrix comprises the first matrix having T rows by T columns and the check matrix having T rows by B columns, and the first matrix is located on a left side of the check matrix;
• the first matrix comprises T×T elements, each element is a matrix, T elements on a diagonal of the first matrix are all identity matrices, remaining elements are zero matrices, an ith element in the T elements comprises ki×ki coding coefficients, and 1≤i≤T;
• the check matrix comprises a first submatrix having a size that is B×B and a second submatrix having a size that is (T−B)×B;
• and
• the first submatrix comprises B×B elements, B elements on a diagonal of the first submatrix are all identity matrices, and remaining elements are zero matrices;
• and elements in the second submatrix and elements in last (T−B) rows and last (T−B) columns in the first matrix constitute a second matrix having a size that is (T−B)×B, the second matrix is a generator matrix of a system maximum distance separable code, and the second submatrix is a check part of the generator matrix.