When studying signal reconstruction, the frames are often selected in advance as encoding tools. However, in practical applications, this encoding frame may be subject to attacks by intermediaries and generate errors. To solve this problem, in this paper, the erasure recovery matrices for data erasures and rearrangements are analyzed. Unlike the previous research, first of all, we introduce a kind of frame and its erasure recovery matrix M so that MI,Λ=Im×m, where Im×m is a unit matrix. In this case, we do not need to invert the matrix of the frame operator and the erasure recovery matrix, and this greatly simplifies reconstruction problems and calculations. Then three different construction algorithms of the above erasure recovery matrix M and the frame are proposed, and each of them has advantages. Furthermore, some restrictions on M so that the constructed frame and erasure recovery matrix M can recover coefficients from rearrangements are imposed. We prove that in some cases, the above M and frame can recover coefficients stably from m rearrangements.
Read full abstract