An algorithm to restore a linear recurring sequence over the ring R = Z pn from a linear complication of its highest coordinate sequence
From MaRDI portal
Publication:2997861
DOI10.1515/DMA.2010.036zbMath1225.94012OpenAlexW2004109762MaRDI QIDQ2997861
D. N. Bylkov, Alexander A. Nechaev
Publication date: 10 May 2011
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.2010.036
Related Items (3)
On the distinctness of modular reductions of primitive sequences over \(\mathbb Z/(2^{32}-1)\) ⋮ Построение новых классов фильтрующих генераторов, не имеющих эквивалентных состояний ⋮ Параметры булевых функций, построенных с использованием старших координатных последовательностей линейных рекуррент
Cites Work
- Linear recurring sequences over Galois rings
- Linear recurring sequences over rings and modules
- Uniqueness of the distribution of zeroes of primitive level sequences over \(\mathbb Z/(p^e)\)
- 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})$
- On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
- Linear recursive sequences over Galois rings
This page was built for publication: An algorithm to restore a linear recurring sequence over the ring R = Z pn from a linear complication of its highest coordinate sequence
