Coding and decoding methods and apparatus
AssigneeKabushiki Kaisha Toshiba
InventorsFilippo TOSATO, Magnus Stig Torsten SANDELL
Life of this patent
Estimating the term…
Abstract
According to an embodiment a decoder for decoding a received set of blocks each comprising a plurality of data symbols and a plurality of parity symbols, wherein the received set of blocks is a subset of a complete set of blocks, the complete set of blocks comprising at least one erased block not included in the received set of blocks comprises storage for a coding matrix which is the kronecker product of a totally non-singular matrix with an anti-diagonal matrix; and a processor operable to determine data symbols of the at least one erased block using the encoding matrix.
Claims20
A decoder for decoding a received set of blocks each comprising a plurality of data symbols and a plurality of parity symbols, wherein the received set of blocks is a subset of a complete set of blocks, the complete set of blocks comprising at least one erased block not included in the received set of blocks, the decoder comprising:
- storage for a coding matrix which is the kronecker product of a totally non-singular matrix with an antidiagonal matrix;
- and
- a processor operable to determine data symbols of the at least one erased block using the coding matrix.
An encoder for encoding a block of a plurality of blocks of an erasure code, each block comprising a plurality of data symbols and a plurality of parity symbols, the encoder configured to set the parity symbols of the block using combinations of data symbols of other blocks of the plurality of blocks selected according to a column of an coding matrix which is the kronecker product of a totally non-singular matrix with an antidiagonal matrix.
A method of decoding a received set of blocks each comprising a plurality of data symbols and a plurality of parity symbols, wherein the received set of blocks is a subset of a complete set of blocks, the complete set of blocks comprising at least one erased block not included in the received set of blocks, the method comprising
- determining the data symbols of the at least one erased block using an encoding matrix which is the kronecker product of a totally non-singular matrix with an antidiagonal matrix.
A method of encoding a block of a plurality of blocks of an erasure code, each block comprising a plurality of data symbols and a plurality of parity symbols, the method comprising
- setting the parity symbols of the block using combinations of data symbols of other blocks of the plurality of blocks selected according to a column of an encoding matrix which is the kronecker product of a totally non-singular matrix with an antidiagonal matrix.
A method of generating a block erasure code, wherein blocks encoded by the erasure code each comprise m data symbols and p parity symbols such that all of the data symbols of a set of blocks encoded by the erasure code can be retrieved from the k surviving blocks in the event that r blocks are erased, the method comprising
- calculating a coding matrix indicating the calculation of the parity symbols for each block from the data symbols of other blocks as the kronecker product of a totally non-singular (k×r) matrix and an (m+p)×(m+p) antidiagonal matrix.
Dependencies are inferred from the claim text.