RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2016 Volume 7, Issue 1, Pages 71–82 (Mi mvk175)

This article is cited 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.

UDC: 512.547+512.552

Received 20.IV.2015

DOI: 10.4213/mvk175



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024