Representations over Zpn of linear recurring sequence of maximal period over GF(p)

V. L. KURAKIN

doi:10.1515/dma.1993.3.3.275

Startseite Representations over Zpn of linear recurring sequence of maximal period over GF(p)

Artikel

Lizenziert

Nicht lizenziert Erfordert eine Authentifizierung

Representations over Z_pn of linear recurring sequence of maximal period over GF(_p)

V. L. KURAKIN

Veröffentlicht/Copyright: 9. Oktober 2009

Veröffentlicht von

Veröffentlichen auch Sie bei De Gruyter Brill

Informationen für Autor*innen Erkunden Sie dieses Fachgebiet

Aus der Zeitschrift Band 3 Heft 3

MLA
APA
Harvard
Chicago
Vancouver

MLA
APA
Harvard
Chicago
Vancouver

KURAKIN, V. L.. "Representations over Z_pn of linear recurring sequence of maximal period over GF(_p)" Discrete Mathematics and Applications, vol. 3, no. 3, 1993, pp. 275-296. https://doi.org/10.1515/dma.1993.3.3.275

KURAKIN, V. (1993). Representations over Z_pn of linear recurring sequence of maximal period over GF(_p). Discrete Mathematics and Applications, 3(3), 275-296. https://doi.org/10.1515/dma.1993.3.3.275

KURAKIN, V. (1993) Representations over Z_pn of linear recurring sequence of maximal period over GF(_p). Discrete Mathematics and Applications, Vol. 3 (Issue 3), pp. 275-296. https://doi.org/10.1515/dma.1993.3.3.275

KURAKIN, V. L.. "Representations over Z_pn of linear recurring sequence of maximal period over GF(_p)" Discrete Mathematics and Applications 3, no. 3 (1993): 275-296. https://doi.org/10.1515/dma.1993.3.3.275

KURAKIN V. Representations over Z_pn of linear recurring sequence of maximal period over GF(_p). Discrete Mathematics and Applications. 1993;3(3): 275-296. https://doi.org/10.1515/dma.1993.3.3.275

Kopie

In die Zwischenablage kopiert

BibTeX EndNote RIS

Published Online: 2009-10-09

Published in Print: 1993

Walter de Gruyter

Sie haben derzeit keinen Zugang zu diesem Inhalt.

Artikel in diesem Heft

Modern enumeration theory of permutations with restricted positions
The asymptotic behaviour of the number of t-minimal coverings of a set
Representations over Z_pn of linear recurring sequence of maximal period over GF(_p)
On the complexity of computation in finite Abelian, nilpotent and soluble groups
Minimal verifying tests of functions from the Post classes
On the evidence of the memory of automaton in experiments

Zeitschrift durchsuchen In dieser Zeitschrift suchen

https://doi.org/10.1515/dma.1993.3.3.275

Artikel in diesem Heft

Modern enumeration theory of permutations with restricted positions
The asymptotic behaviour of the number of t-minimal coverings of a set
Representations over Z_pn of linear recurring sequence of maximal period over GF(_p)
On the complexity of computation in finite Abelian, nilpotent and soluble groups
Minimal verifying tests of functions from the Post classes
On the evidence of the memory of automaton in experiments