Восстановление линейной рекурренты над примарным кольцом вычетов по ее усложнению. II
From MaRDI portal
Publication:4959017
DOI10.4213/mvk32zbMath1477.11027OpenAlexW2790559326MaRDI QIDQ4959017
Aleksey Kuzmin, G. B. Marshalko
Publication date: 15 September 2021
Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/mvk32
Cites Work
- Binary sequences derived from ML-sequences over rings. I: Periods and minimal polynomials
- Compressing mappings on primitive sequences over \(\mathbb Z/(2^e)\) and its Galois extension
- Linear recurring sequences over rings and modules
- Uniqueness of the distribution of zeroes of primitive level sequences over \(\mathbb Z/(p^e)\)
- Construction of noise-resistant codes by means of linear recurrences over Galois rings
- Kerdock code in a cyclic form
- Compression Mappings on Primitive Sequences Over<tex>$Z/(p^e)$</tex>
- Injectivity of Compressing Maps on Primitive Sequences Over ${\BBZ}/(p^{e})$
- Further Result of Compressing Maps on Primitive Sequences Modulo Odd Prime Powers
- Linear recurrence sequences over commutative rings
- Complex analysis and convolution operators
- A solution of the Harer-Zagier equation
- Twistor spaces and harmonic maps
- Восстановление линейной рекурренты над примарным кольцом вычетов по ее усложнению
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Восстановление линейной рекурренты над примарным кольцом вычетов по ее усложнению. II