|
This article is cited in 3 scientific papers (total in 3 papers)
On the Hamming distance between binary representations of linear recurrent sequences over field $GF(2^k)$ and ring $\mathbb{Z}_{2^n}$
O. V. Kamlovskiy Sertification Research Center, LLC, Moscow
Abstract:
Linear recurrent sequences over the field $GF(2^k)$ and over the ring $\mathbb{Z}_{2^n}$ with dependent recurrent relations are considered. We establish the bounds for the Hamming distance between two binary sequences obtained from the initial sequences by replacing each element by its image under the action of arbitrary maps into the field of two elements.
Key words:
linear recurrent sequences, binary representations of sequences, finite fields, cross-correlation function.
Received 20.IV.2015
Citation:
O. V. Kamlovskiy, “On the Hamming distance between binary representations of linear recurrent sequences over field $GF(2^k)$ and ring $\mathbb{Z}_{2^n}$”, Mat. Vopr. Kriptogr., 7:1 (2016), 71–82
Linking options:
https://www.mathnet.ru/eng/mvk175https://doi.org/10.4213/mvk175 https://www.mathnet.ru/eng/mvk/v7/i1/p71
|
Statistics & downloads: |
Abstract page: | 434 | Full-text PDF : | 221 | References: | 61 | First page: | 1 |
|