摘要

A family of the orthogonal co-cyclic block-wise inverse Jacket transform (CBIJT) is proposed in finite field based on the fast construction of the co-cyclic block-wise inverse Jacket matrix (CBIJM). The proposed high-order CBIJM of large-size can be factorized into the low-order CBIJM with the sparse matrices in a successive block architecture. It has a recursive fashion that leads to the fast algorithm while reducing its computational load for composing or decomposing.

全文