The vector key equation and multisequence shift register synthesis

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Wang, L. P. (2006). The vector key equation and multisequence shift register synthesis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3857 LNCS, pp. 68–75). Springer Verlag. https://doi.org/10.1007/11617983_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free