Finding linearly generated subsequences
DOI10.1007/978-3-030-68869-1_10zbMath1490.15011arXiv2003.02388OpenAlexW3135836474MaRDI QIDQ2232219
Claude Gravel, Bastien Rigault, Daniel Panario
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/2003.02388
Hankel matricesBerlekamp-Massey algorithmgenerating polynomiallinear algebra over finite fieldslinear shift feedback registerspattern substringsquotient-difference tables
Determinants, permanents, traces, other special matrix functions (15A15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Toeplitz, Cauchy, and related matrices (15B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finite sequences satisfying linear recursions
- Relatively prime polynomials and nonsingular Hankel matrices over finite fields
- Chiò's and Dodgson's determinantal identities
- Handbook of Finite Fields
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
- Shift Register Sequences
- Degree distribution of the greatest common divisor of polynomials over 𝔽q
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- Algebraic Codes for Data Transmission
This page was built for publication: Finding linearly generated subsequences