Abstract:

An orthogonal cocyclic framework of the block-wise inverse Jacket transform (BIJT) is proposed over the finite field. Instead of the conventional block-wise inverse Jacket matrix (BIJM), we investigate the cocyclic block-wise inverse Jacket matrix (CBIJM), where the high-order CBIJM can be factorized into the low-order sparse CBIJMs with a successive block architecture. It has a recursive fashion that leads to a fast algorithm concerned for reducing computational load. The fast transforms are also developed for the two-dimensional cocyclic block-wise inverse Jacket transform (CBIJT). The present CBIJM may be used for many matrix-based applications, such as the DFT signal processing, combinatorics, and the Reed-Muller code design.