About the minimal primitive matrices | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).

A quadratic Boolean matrix A is called a primitive matrix if some its degree does not contain 0's. A primitive matrix is called a minimal primitive matrix if it becomes non-primitive matrix after replacing any one 1 in it by 0. The height of a primitive matrix is defined as the least Hamming's distance between it and a minimal primitive matrix. In the paper, properties of minimal primitive matrices are studied. The amount of minimal primitive matrices of order n is estimated. An algorithm for estimating the height of a primitive matrix is proposed.
Download file
Counter downloads: 190
  • Title About the minimal primitive matrices
  • Headline About the minimal primitive matrices
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 7 (Приложение)
  • Date:
  • DOI
Keywords
computational complexity of the algorithm, antichain, lattice, primitive matrix, вычислительная сложность алгоритма, антицепь, решётка, примитивная матрица
Authors
References
Сачков B. Н., Тараканов B. Е. Комбинаторика неотрицательных матриц. М.: ТВП, 2000.
Когос К. Г., Фомичев В. М. Положительные свойства неотрицательных матриц // Прикладная дискретная математика. 2012. №4(18). С. 5-13.
Фомичев B. M. Методы дискретной математики в криптологии. М.: Диалог-МИФИ, 2010.
 About the minimal primitive matrices | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).
About the minimal primitive matrices | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).
Download full-text version
Counter downloads: 1916