Pages that link to "Item:Q5554046"
From MaRDI portal
The following pages link to Shift-register synthesis and BCH decoding (Q5554046):
Displaying 50 items.
- Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring (Q1180162) (← links)
- The Lanczos algorithm and Hankel matrix factorization (Q1194514) (← links)
- Perfect staircase profile of linear complexity for finite sequences (Q1201870) (← links)
- Inversion components of block Hankel-like matrices (Q1208260) (← links)
- Cryptology: The mathematics of secure communication (Q1259538) (← links)
- Synthesis of cyclic coding and decoding devices in the logic of arbitrary flip-flops (Q1281084) (← links)
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. I (Q1286655) (← links)
- Gröbner bases of characteristic ideals of LRS over UFD (Q1286694) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Cross-correlations of geometric sequences in characteristic two (Q1309829) (← links)
- The vulnerability of geometric sequences based on fields of odd characteristic (Q1324757) (← links)
- A look-ahead algorithm for the solution of general Hankel systems (Q1326405) (← links)
- On evaluating the linear complexity of a sequence of least period \(2^ n\) (Q1329115) (← links)
- Perfect factors in the de Bruijn graph (Q1345135) (← links)
- Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. (Q1380344) (← links)
- Orthogonal sequences of polynomials over arbitrary fields (Q1385267) (← links)
- An algorithm for constructing a minimal partial realization in the multivariable case (Q1391043) (← links)
- The set of reversible \(90/150\) cellular automata is regular (Q1392576) (← links)
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. (Q1401213) (← links)
- New upper bounds on the linear complexity (Q1570119) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Estimation of arithmetic means and their applications in guessing theory (Q1596770) (← links)
- Counting functions and expected values for the \(k\)-error linear complexity (Q1609392) (← links)
- Trace representation and linear complexity of binary sequences derived from Fermat quotients (Q1616173) (← links)
- Polynomial-exponential decomposition from moments (Q1620891) (← links)
- The linear complexity of a class of binary sequences with optimal autocorrelation (Q1671646) (← links)
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes (Q1675777) (← links)
- On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
- The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation (Q1699262) (← links)
- Characteristic digit-sum sequences (Q1704209) (← links)
- The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices (Q1716488) (← links)
- A lower bound on the 2-adic complexity of the modified Jacobi sequence (Q1733986) (← links)
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction (Q1744015) (← links)
- On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation (Q1784993) (← links)
- Recursive partial realization from the combined sequence of Markov parameters and moments (Q1823203) (← links)
- A canonical matrix continued fraction solution of the minimal (partial) realization problem (Q1824986) (← links)
- A simple Hankel interpretation of the Berlekamp-Massey algorithm (Q1825176) (← links)
- A rank theorem for Vandermonde matrices (Q1826719) (← links)
- On the linear complexity profile of some new explicit inversive pseudorandom numbers (Q1827574) (← links)
- On the complexities of de-Bruijn sequences (Q1836666) (← links)
- On the linear complexity profile of explicit nonlinear pseudorandom numbers. (Q1853169) (← links)
- Finding recursions for multidimensional arrays (Q1854502) (← links)
- Early termination in sparse interpolation algorithms (Q1878478) (← links)
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain (Q1894579) (← links)
- On multisequence shift register synthesis and generalized-minimum- distance decoding of Reed-Solomon codes (Q1904531) (← links)
- Linear recurring sequences over modules (Q1906803) (← links)
- Linear recurring sequences over rings and modules (Q1915326) (← links)
- Quadratic functions with prescribed spectra (Q1934217) (← links)
- Construction of balanced Boolean functions with high nonlinearity and good autocorrelation properties (Q1936502) (← links)
- On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\) (Q1949238) (← links)
