Skip to main content

The Vector Key Equation and Multisequence Shift Register Synthesis

  • Conference paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2006)

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

Abstract

We introduce the vector key equation for cyclic codes with more than one set of consecutive roots. Using the lattice basis reduction multisequence shift register synthesis algorithm [7, 8], we find the minimal solution to the vector equation key and also give an important parameter of the multiple sequences, that is, characteristic sequence. Using it, we give a simpler sufficient and necessary condition for the uniqueness of the minimal polynomial of multiple sequences than that in [7]. The new approach enables us not only to decode cyclic codes up to HT and Roos bounds and but also to find out certain error patterns which can be decoded beyond the two bounds.

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

Access this chapter

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. Berlekamp, E.R.: Algebraic Coding Theory. McGrawHill, New York (1969)

    Google Scholar 

  2. Feng, G.L., Tzeng, K.K.: A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes. IEEE Trans. Inform. Theory 37, 1274–1287 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Hartmann, C.R.P., Tzeng, K.K.: Generalizations of the BCH bound. Inform. Contr. 20(5), 489–498 (1972)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Norton, G.H.: Some decoding applications of minimal realization. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol. 1025, pp. 53–62. Springer, Heidelberg (1995)

    Google Scholar 

  6. Schmidt, W.M.: Construction and estimation of bases in function fields. J. Number Theory 39(2), 181–224 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Wang, L.-P., Zhu, Y.-F.: F[x]-lattice basis reduction algorithm and multisequence synthesis. Science in China (series F) 44, 321–328 (2001)

    MATH  MathSciNet  Google Scholar 

  8. Wang, L.-P., Zhu, Y.-F., Pei, D.-Y.: On the lattice basis reduction multisequence synthesis algorithm. IEEE Trans. Inform. Theory 50(11), 2905–2910 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, LP. (2006). The Vector Key Equation and Multisequence Shift Register Synthesis. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2006. Lecture Notes in Computer Science, vol 3857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617983_6

Download citation

  • DOI: https://doi.org/10.1007/11617983_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31423-3

  • Online ISBN: 978-3-540-31424-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics