Recursion polynomials of unfolded sequences
From MaRDI portal
Publication:2232217
DOI10.1007/978-3-030-68869-1_9zbMath1480.94024OpenAlexW3130802743MaRDI QIDQ2232217
Ana I. Gómez, Andrew Tirkel, Domingo Gómez-Pérez
Publication date: 4 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-68869-1_9
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial
- Optimal sets of binary sequences
- Irreducibles and the composed product for polynomials over a finite field
- Large families of sequences for CDMA, frequency hopping, and UWB
- Composed products and factors of cyclotomic polynomials over finite fields
- Arrays composed from the extended rational cycle
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Theory and applications of q-ary interleaved sequences
- Trace representation of Legendre sequences
This page was built for publication: Recursion polynomials of unfolded sequences