Sciweavers

3 search results - page 1 / 1
» Spectrally Bounded Sequences, Codes, and States: Graph Const...
Sort
View
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
13 years 9 months ago
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. W...
Matthew G. Parker
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
13 years 10 months ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 5 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...