Pages that link to "Item:Q5554046"
From MaRDI portal
The following pages link to Shift-register synthesis and BCH decoding (Q5554046):
Displaying 50 items.
- Matrix-product structure of repeated-root cyclic codes over finite fields (Q268495) (← links)
- Linear complexity profiles and jump complexity (Q290210) (← links)
- Determining the \(k\)-error joint linear complexity spectrum for a binary multisequence with period \(p^n\) (Q301631) (← links)
- On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences (Q325285) (← links)
- An extension of binary threshold sequences from Fermat quotients (Q340165) (← links)
- Modelling the shrinking generator in terms of linear CA (Q340171) (← links)
- Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
- Algebraic attacks on a class of stream ciphers with unknown output function (Q369422) (← links)
- On the linear complexity of binary lattices (Q386502) (← links)
- Distribution of one-error linear complexity of binary sequences for arbitrary prime period (Q394411) (← links)
- Generation of full cycles by a composition of NLFSRs (Q398953) (← links)
- On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field (Q412213) (← links)
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus (Q436622) (← links)
- New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity (Q456074) (← links)
- Enhanced Boolean functions suitable for the filter model of pseudo-random generator (Q494592) (← links)
- On sequences, rational functions and decomposition (Q499747) (← links)
- AFSRs synthesis with the extended Euclidean rational approximation algorithm (Q514533) (← links)
- On finite pseudorandom binary lattices (Q516785) (← links)
- Expansion complexity and linear complexity of sequences over finite fields (Q517722) (← links)
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (Q522204) (← links)
- On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\) (Q539903) (← links)
- Analysis of the generalized self-shrinking generator (Q552233) (← links)
- On the joint linear complexity profile of explicit inversive multisequences (Q558009) (← links)
- Extension of the Berlekamp-Massey algorithm to N dimensions (Q583882) (← links)
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices (Q599137) (← links)
- On Dillon's class \(H\) of bent functions, Niho bent functions and o-polynomials (Q640848) (← links)
- A lattice-based minimal partial realization algorithm for matrix sequences of varying length (Q662164) (← links)
- On the structure of order domains (Q700167) (← links)
- A wide family of nonlinear filter functions with a large linear span (Q707348) (← links)
- Automatic complexity of shift register sequences (Q724846) (← links)
- Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
- Linear complexity and correlation of a class of binary cyclotomic sequences (Q744013) (← links)
- A linear algebraic approach to multisequence shift-register synthesis (Q764390) (← links)
- Displacement structure for Hankel, Vandermonde, and related (derived) matrices (Q803726) (← links)
- Recursive partial realization for 2-D data arrays (Q811470) (← links)
- On linear complexity of sequences over \(\text{GF}(2^n)\) (Q818141) (← links)
- The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization (Q820716) (← links)
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\) (Q825936) (← links)
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences (Q851764) (← links)
- Trace representation of pseudorandom binary sequences derived from Euler quotients (Q893348) (← links)
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964) (← links)
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field (Q1026985) (← links)
- Factorization of determinants over finite fields and application in stream ciphers (Q1032496) (← links)
- Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity (Q1035809) (← links)
- On the partial realization problem (Q1055376) (← links)
- Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices (Q1068791) (← links)
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array (Q1104749) (← links)
- The complexity of a periodic sequence over GF(p) (Q1113874) (← links)
- A study of MBH-type realization algorithms (Q1164582) (← links)
