Pages that link to "Item:Q5554046"
From MaRDI portal
The following pages link to Shift-register synthesis and BCH decoding (Q5554046):
Displaying 50 items.
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks (Q1960219) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- Threshold data structures and coding theory (Q1978695) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? (Q2000529) (← links)
- A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\) (Q2002148) (← links)
- Linear feedback shift registers and the minimal realization problem (Q2002558) (← links)
- Optimal parameters for the WG stream cipher family (Q2016392) (← links)
- Weights for short quartic Boolean functions (Q2056268) (← links)
- Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2 (Q2056728) (← links)
- On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions (Q2065760) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- On the stability of periodic binary sequences with zone restriction (Q2081551) (← links)
- Algebraic attacks on grain-like keystream generators (Q2104441) (← links)
- Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\) (Q2130054) (← links)
- Jump and hop randomness tests for binary sequences (Q2130056) (← links)
- On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators (Q2158238) (← links)
- Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation (Q2161414) (← links)
- Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\) (Q2173751) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- A family of weightwise (almost) perfectly balanced Boolean functions with optimal algebraic immunity (Q2179488) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- Shrinking generators based on \(\sigma \)-LFSRs (Q2197462) (← links)
- On the annihilator ideal of an inverse form: addendum (Q2280313) (← links)
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria (Q2282303) (← links)
- Linear complexity of generalized sequences by comparison of PN-sequences (Q2293241) (← links)
- A new algorithm on the minimal rational fraction representation of feedback with carry shift registers (Q2302154) (← links)
- Multidimensional linear complexity analysis of periodic arrays (Q2304655) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- Binomial representation of cryptographic binary sequences and its relation to cellular automata (Q2325113) (← links)
- Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight (Q2325304) (← links)
- Families of \(p\)-ary sequences with low correlation and large linear complexity (Q2341595) (← links)
- The RCH method for computing minimal polynomials of polynomial matrices (Q2341615) (← links)
- Studies on the distribution of the shortest linear recurring sequences (Q2390358) (← links)
- A lookup table decoding of systematic \((47, 24, 11)\) quadratic residue code (Q2390373) (← links)
- Construction and decoding of BCH codes over chain of commutative rings (Q2391751) (← links)
- On the annihilator ideal of an inverse form (Q2397158) (← links)
- Arrays composed from the extended rational cycle (Q2397495) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- Discrete linear models for the generalized self-shrunken sequences (Q2401965) (← links)
- Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences (Q2411159) (← links)
- A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity (Q2416414) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- Evaluation codes defined by finite families of plane valuations at infinity (Q2436567) (← links)
- Fast skew-feedback shift-register synthesis (Q2436582) (← links)
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability (Q2448071) (← links)
- On the linear span of the \(p\)-ary cascaded GMW sequences (Q2461471) (← links)
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\) (Q2469712) (← links)
- Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials (Q2473633) (← links)
