Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement

A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. We identify a subset of these sequences that map to binary indicators for linear and nonlinear Factor Graphs, after application of subspace Walsh-Hadamard Transforms. Finally we investigate the quantum PARl measure of ’Linear Entanglement’ (LE) under any Local Unitary Transform, where optimum LE implies optimum weight hierarchy of an associated linear code.

• Type: Conference
• Year: 2001
• Where: IMA
• Authors: Matthew G. Parker
• Keywords: Cryptology, IMA 2001, Local Unitary, Local Unitary Transform, Unitary Unimodular Transform