The families of linear recurrent sequences based on full sets of Galois’ isomorphic fields
DOI:
https://doi.org/10.3103/S0735272705110075Abstract
A new consistent rule is suggested for generation of prime polynomials, which are irreducible over extended Galois’ fields. The paper gives estimates of the number of different in structure recurrent sequences of maximal period — based on full sets of isomorphic fields of a prescribed order q = pn.References
BERLEKAMP, E.R. Algebraic Coding Theory. World Scientific Publishing Co, 1968.
SVERDLIK, M.B. Optimal Discrete Signals [in Russian]. Moscow: Sov. Radio, 1975.
BLAHUT, R.E. Theory and Practice of Error Control Codes. Addison-Wesley, 1984.
MAZURKOV, M.I. Konstruktivnyi sposob postroeniia pervoobraznykh neprivodimykh polinomov nad prostymi poliami Galua. Radioelectron. Commun. Syst., v.42, n.2, p.41-45, 1999.
MAZURKOV, M.I. Chastotno-vremennye kody kvadratichnykh vychetov v rasshirennykh poliakh Galua. Radioelectron. Commun. Syst., v.40, n.12, p.30-39, 1997.
MAZURKOV, M.I.; DMITRENKO, V.S. Class optimalnykh sistem DCh-signalov na osnove M-posledovatelnostei v rasshirennykh poliakh Galua. Radioelectron. Commun. Syst., v.47, n.12, p.17-20, 2004.
VINOGRADOV, I.M. Foundations of the Number Theory [in Russian]. Moscow: Nauka, 1981.
ZAMARIN, A.I.; ANDREYEV, A.V. Mnogourovnevye chislovye posledovatelnosti dlia formirovaniia signalov s psevdosluchainoi perestroikoi rabochei chastoty v sistemakh peredachi informatcii i radiolokatcii. Zarubezhnaya Radioelektronika, n.5, p.3-12, 1993.
