Skip to main content
SpringerLink
Log in

Weighted Degree Trace Codes for PAPR Reduction

  • Conference paper
Book cover Sequences and Their Applications - SETA 2004 (SETA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3486))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dai, Z.-D.: Binary sequences derived from ML-sequences over rings I: period and minimal polynomial. J. Cryptology 5, 193–507 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Fan, S., Han, W.: Random properties of the highest level sequences of primitive Sequences over \({\mathbb Z}_{2^e}\). IEEE Trans. Inform. Theory IT-49, 1553–1557 (2003)

    MathSciNet  Google Scholar 

  3. Helleseth, T., Kumar, P.V.: Sequences with low Correlation. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding theory, vol. II, pp. 1765–1853. North Holland, Amsterdam (1998)

    Google Scholar 

  4. Kumar, P.V., Helleseth, T.: An expansion of the coordinates of the trace function over Galois rings. AAECC 8, 353–361 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kumar, P.V., Helleseth, T., Calderbank, A.R.: An upper bound for Weil exponential sums over Galois rings and applications. IEEE Trans. Inform. Theory IT-41, 456–468 (1995)

    Article  MathSciNet  Google Scholar 

  6. Lahtonen, J., Ling, S., Solé, P., Zinoviev, D.: \({\mathbb Z}_8\)-Kerdock codes and pseudo-random binary sequences. J. of Complexity (in press)

    Google Scholar 

  7. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  8. Paterson, K.G., Tarokh, V.: On the existence and construction of good codes with low peak to average power ratios. IEEE Trans. Inform. Theory IT-46, 1974–1987 (2000)

    Article  MathSciNet  Google Scholar 

  9. Shanbhag, A., Kumar, P.V., Helleseth, T.: Improved Binary Codes and Sequence Families from \({\mathbb Z}_4\)-Linear Codes. IEEE Trans. on Inform. Theory IT-42, 1582–1586 (1996)

    Article  MathSciNet  Google Scholar 

  10. Shanbhag, A., Kumar, P.V., Helleseth, T.: Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences. IEEE Trans. Inform. Theory IT-42, 250–254 (1996)

    Article  MathSciNet  Google Scholar 

  11. Solé, P., Zinoviev, D.: Low Correlation, high non linearity sequences for multi code CDMA (submitted)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS-I3S, ESSI, Route des Colles, 06 903, Sophia Antipolis, France

    Patrick Solé

  2. Institute for Problems of Information Transmission, Russian Academy of Sciences, Bol’shoi Karetnyi, 19, GSP-4, Moscow, 101447, Russia

    Dmitrii Zinoviev

Authors
  1. Patrick Solé
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dmitrii Zinoviev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

  2. University of Ilinois at Urbana-Champaign, 1406 West Green Street, IL 61801, Urbana, USA

    Dilip Sarwate

  3. Department of Electrical and Electronic Engineering, Yonsei University, 121-749, Seoul, Korea

    Hong-Yeop Song

  4. Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    Kyeongcheol Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Solé, P., Zinoviev, D. (2005). Weighted Degree Trace Codes for PAPR Reduction. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_31

Download citation

  • DOI: https://doi.org/10.1007/11423461_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26084-4

  • Online ISBN: 978-3-540-32048-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation