RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2010 Volume 46, Issue 3, Pages 60–79 (Mi ppi2022)

This article is cited in 13 papers

Coding Theory

Eigenspaces of the discrete Walsh transform

M. S. Bespalov

Vladimir State University

Abstract: We refine the notion of a discrete Walsh function and generalize the notion of a discrete Walsh transform, for which we propose a method for generating a corresponding $W$-matrix. We propose spectral decompositions of the discrete Walsh transform operators in arbitrary enumerations, as well as methods for finding bases of eigenspaces, one of them using a new direct product of matrices. We propose a notation for the fast discrete Walsh transform algorithm in the Paley enumeration. We construct Parseval frames for eigenspaces of the discrete Walsh transform in the Paley enumeration and demonstrate methods for applying them in error detection and correction.

UDC: 621.391.1+517.984.5

Received: 04.02.2010
Revised: 04.05.2010


 English version:
Problems of Information Transmission, 2010, 46:3, 253–271

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024