HomeIssuesImprovement of exponent estimates for mixing graphs of bijective shift registers over a set of binary vectors

Improvement of exponent estimates for mixing graphs of bijective shift registers over a set of binary vectors | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 1(23).

This article presents new estimates for lengths of simple paths and cycles in the mixing graph G of a bijective shift register over a binary vectors set. Also, some sufficient conditions for primitiveness of G are obtained. An upper bound given earlier for the exponent of G is reduced.
Download file
Counter downloads: 91
  • Title Improvement of exponent estimates for mixing graphs of bijective shift registers over a set of binary vectors
  • Headline Improvement of exponent estimates for mixing graphs of bijective shift registers over a set of binary vectors
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 1(23)
  • Date:
  • DOI
Keywords
graph exponent, graph diameter, mixing graph of transformation, экспонент графа, диаметр графа, перемешивающий граф преобразования
Authors
References
Фомичев В. М. Оценки экспонентов примитивных графов // Прикладная дискретная математика. 2011. №2 (12). С. 101-112.
Сачков В. Н., Тараканов В. Е. Комбинаторика неотрицательных матриц. М.: ТВП, 2000.
Коренева А. М., Фомичев В. М. Об одном обобщении блочных шифров Фейстеля // Прикладная дискретная математика. 2012. №3 (17). С. 34-40.
Improvement of exponent estimates for mixing graphs of bijective shift registers over a set of binary vectors | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 1(23).
Improvement of exponent estimates for mixing graphs of bijective shift registers over a set of binary vectors | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 1(23).
Download full-text version
Counter downloads: 237
Download file