Block diagonalization for algebra's associated with block codes
read the original abstract
For a matrix *-algebra B, consider the matrix *-algebra A consisting of the symmetric tensors in the n-fold tensor product of B. Examples of such algebras in coding theory include the Bose-Mesner algebra and Terwilliger algebra of the (non)binary Hamming cube, and algebras arising in SDP-hierarchies for coding bounds using moment matrices. We give a computationally efficient block diagonalization of A in terms of a given block diagonalization of B, and work out some examples, including the Terwilliger algebra of the binary- and nonbinary Hamming cube. As a tool we use some basic facts about representations of the symmetric group.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
Symmetry reduction makes the Berta et al. SDP hierarchy for quantum channel fidelity computable in time polynomial in hierarchy level and input dimension when output dimension is fixed.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.