Weighted degree trace codes for PAPR reduction

Authors:
Patrick Solé;Dmitrii Zinoviev
Affiliations:
CNRS-I3S, ESSI, Sophia Antipolis, France;Institute for Problems of Information Transmission, Russian Academy of Sciences, Moscow, Russia
Venue:
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Year:
2004

Citing 7
Cited 1

Binary sequences derived from ML-sequences over rings I: periods and minimal polynomials

Journal of Cryptology
Z8-Kerdock codes and pseudorandom binary sequences

Journal of Complexity - Special issue on coding and cryptography
Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences

IEEE Transactions on Information Theory
Improved binary codes and sequence families from Z4-linear codes

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
Random properties of the highest level sequences of primitive sequences over Z(2e)

IEEE Transactions on Information Theory
An upper bound for Weil exponential sums over Galois rings and applications

IEEE Transactions on Information Theory

Galois rings and pseudo-random sequences

Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding

Quantified Score

Hi-index	0.00

Visualization

Abstract

Trace codes over the rings ${\mathbb Z}_{{2}^{l}}$, are used to construct spherical codes with controlled peak to average power ratios (PAPR). The main proof technique is the local Weil bound on hybrid character sums over Galois rings.