Skip to main content
SpringerLink
Log in
Book cover

Sequences and their Applications pp 131–145Cite as

Complementary Interpolants and a Welch-Berlekamp-style Algorithm

  • Conference paper

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

Abstract

A new justification of a Welch-Berlekamp-style algorithm is given using the notion of complementary interpolants of [1]. We also show its relation to another algorithm which uses a more succinct formula for computing complementary interpolants. Both these algorithms can be used to solve the Welch-Berlekamp key equation and with simple modifications using the approach of [2, 3], may also be used to compute the linear complexity profile of a sequence.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berlekamp, E. (1996). Bounded distance +1 soft-decision Reed-Solomon decoding. IEEE Trans. Inform. Theory,42–3, 704–720.

    Article  Google Scholar 

  2. Blackburn, S.R. (1997). A generalized rational interpolation problem and the solution of the Welch-Berlekamp key equation. Designs, Codes and Cryptography, 11–3, 223–234.

    Article  MathSciNet  Google Scholar 

  3. Blackburn, S.R. (1997). Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences. IEEE Trans. Inform. Theory, 43–2, 537–548.

    Article  MathSciNet  Google Scholar 

  4. Chambers, W.G., Peile, R.E., Tsie, K.Y., Zein, N. (1993). Algorithm for solving the Welch-Berlekamp key-equation, with a simplified proof. Electronic Letters, 29–18, 1620–1621.

    Article  Google Scholar 

  5. Jennings, S.M. (1995). Gröbner basis view of Welch-Berlekamp algorithm for Reed-Solomon codes. IEEE Proc. Comm., 142–6, 349–351.

    Article  Google Scholar 

  6. Liu, T.H. (1984). A new decoding algorithm for Reed-Solomon codes. PhD. Thesis,University of Southern California, Los Angeles, CA.

    Google Scholar 

  7. Massey, J.L. (1969). Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory, 15, 122–127.

    Article  MathSciNet  MATH  Google Scholar 

  8. Norton, G.H. (1995). On the minimal realizations of a finite sequence. J. Symbolic Computation 20, 93–115.

    Article  MathSciNet  MATH  Google Scholar 

  9. Welch, L., Berlekamp, E.R. (1983). Error correction for algebraic block codes. US Patent,4 633 470.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Algebraic Coding Research Group, Centre for Communications Research, University of Bristol, UK

    Marc André Armand

Authors
  1. Marc André Armand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, School of Computing, National University of Singapore, Lower Kent Ridge Road, Singapore, 119260

    C. Ding

  2. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    T. Helleseth

  3. Institute of Information Processing, Austrian Academy of Sciences, Sonnenfelsgasse 19, A01010, Vienna, Austria

    H. Niederreiter

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London

About this paper

Cite this paper

Armand, M.A. (1999). Complementary Interpolants and a Welch-Berlekamp-style Algorithm. In: Ding, C., Helleseth, T., Niederreiter, H. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0551-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0551-0_8

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-196-2

  • Online ISBN: 978-1-4471-0551-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation