Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2016, Volume 7, Issue 1, Pages 71–82
DOI: https://doi.org/10.4213/mvk175
(Mi mvk175)
 

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
Full-text PDF (159 kB) Citations (3)
References:
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.
Funding agency Grant number
Академия криптографии РФ
Received 20.IV.2015
Bibliographic databases:
Document Type: Article
UDC: 512.547+512.552
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Kam16}
\by O.~V.~Kamlovskiy
\paper On the Hamming distance between binary representations of linear recurrent sequences over field $GF(2^k)$ and ring $\mathbb{Z}_{2^n}$
\jour Mat. Vopr. Kriptogr.
\yr 2016
\vol 7
\issue 1
\pages 71--82
\mathnet{http://mi.mathnet.ru/mvk175}
\crossref{https://doi.org/10.4213/mvk175}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3562046}
\elib{https://elibrary.ru/item.asp?id=26475100}
Linking options:
  • https://www.mathnet.ru/eng/mvk175
  • https://doi.org/10.4213/mvk175
  • https://www.mathnet.ru/eng/mvk/v7/i1/p71
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:434
    Full-text PDF :221
    References:61
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024