Compression Mappings on Primitive Sequences Over<tex>Z/(p^e)</tex>
DOI10.1109/TIT.2004.834791zbMATH Open1287.94043MaRDI QIDQ3547889FDOQ3547889
Authors: Xuan-Yong Zhu, Wenfeng Qi
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (19)
- Injectivity on distribution of elements in the compressed sequences derived from primitive sequences over \(\mathbb {Z}_{p^{e}}\)
- New explicit injective compressing mappings on primitive sequences over \(\mathbb{Z}_{p^e}\)
- A new result on the distinctness of primitive sequences over \(\mathbb Z/(pq)\) modulo 2
- Injectivity of compressing maps on the set of primitive sequences modulo square-free odd integers
- A note on the crosscorrelation of maximal length FCSR sequences
- Title not available (Why is that?)
- Reconstruction of linear recurrent sequence over prime residue ring from its image. II
- On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
- Reconstruction of a linear recurrence of maximal period over a Galois ring from its highest coordinate sequence
- Periods of termwise exclusive ors of maximal length FCSR sequences
- Injective maps on primitive sequences over \(\mathbb Z/(p^e)\)
- Reconstruction of linear recurrent sequence over prime residue ring from its image
- A class of injective compressing maps on linear recurring sequences over a Galois ring
- On the distinctness of modular reductions of primitive sequences over \(\mathbb Z/(2^{32}-1)\)
- On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2
- On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
- An algorithm to restore a linear recurring sequence over the ring \(R = \mathbb Z_{p^n}\) from a linear complication of its highest coordinate sequence
- The nonlinear complexity of level sequences over \(\mathbb Z/(4)\)
- A construction of new classes of filter generators without equivalent states
This page was built for publication: Compression Mappings on Primitive Sequences Over<tex>$Z/(p^e)$</tex>
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547889)