Introduction to finite fields and their applications
Introduction to finite fields and their applications
The Number of Classes of Invertible Boolean Functions
Journal of the ACM (JACM)
Propagation characteristics and correlation-immunity of highly nonlinear boolean functions
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Cryptographic distinguishability measures for quantum-mechanical states
IEEE Transactions on Information Theory
Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes
IEEE Transactions on Information Theory
Generalized Reed-Muller codes and power control in OFDM modulation
IEEE Transactions on Information Theory
On the existence and construction of good codes with low peak-to-average power ratios
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Codes on graphs: normal realizations
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.