A generalized Euclidean algorithm for multisequence shift-register synthesis
DOI10.1109/18.30981zbMATH Open0676.94011OpenAlexW2071184318MaRDI QIDQ3832461FDOQ3832461
Author name not available (Why is that?)
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.30981
Recommendations
- scientific article; zbMATH DE number 4045633
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- Fast multi-sequence shift-register synthesis with the Euclidean algorithm
- Shift-register synthesis and BCH decoding
- On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
cyclic codesBCH codesdecodingmultiple sequenceslinear feedback shift-registermultiple syndrome sequences
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cyclic codes (94B15) Decoding (94B35)
Cited In (21)
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear algebraic approach to multisequence shift-register synthesis
- Fast skew-feedback shift-register synthesis
- Title not available (Why is that?)
- The expectation and variance of the joint linear complexity of random periodic multisequences
- An algebraic construction for q-ary shift register sequences
- Studies on the distribution of the shortest linear recurring sequences
- Shift Register Synthesis (Modulo m)
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
- Title not available (Why is that?)
- On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
- On lattice-based algebraic feedback shift registers synthesis for multisequences
- Improved power decoding of interleaved one-point Hermitian codes
- Applying a generalized allocation scheme to analyzing a class of sequences generated by a shift register
This page was built for publication: A generalized Euclidean algorithm for multisequence shift-register synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3832461)
