A generalized Euclidean algorithm for multisequence shift-register synthesis
From MaRDI portal
Publication:3832461
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
Cited in
(23)- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- Fast multi-sequence shift-register synthesis with the Euclidean algorithm
- 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
- scientific article; zbMATH DE number 2081141 (Why is no real title available?)
- A linear algebraic approach to multisequence shift-register synthesis
- scientific article; zbMATH DE number 4012492 (Why is no real title available?)
- Fast skew-feedback shift-register synthesis
- scientific article; zbMATH DE number 844162 (Why is no real title available?)
- The expectation and variance of the joint linear complexity of random periodic multisequences
- Multisequence Shift Register Synthesis Over Commutative Rings With Identity With Applications to Decoding Cyclic Codes Over Integer Residue Rings
- 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
- scientific article; zbMATH DE number 4045633 (Why is no real title available?)
- 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)