About Primitiveness of Cyclic Matrices
Any nonnegative square matrice A is called primitive if for some t 1 the matrice At has no entries equal to 0. A right (left) circulant of order n is a matrice of order n such that each row of the matrice is obtained by the cyclic shift of the previous row one step to the right (to the left). In th...
Main Author: | Yana Eduardovna Avezova |
---|---|
Format: | Article |
Language: | English |
Published: |
Moscow Engineering Physics Institute
2015-03-01
|
Series: | Bezopasnostʹ Informacionnyh Tehnologij |
Subjects: | |
Online Access: | https://bit.mephi.ru/index.php/bit/article/view/131 |
Similar Items
-
SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
by: A.J. Beletsky, et al.
Published: (2012-10-01) -
Exponent-critical primitive graphs and the Kronecker product
by: Olga O'Mahony, et al.
Published: (2019-10-01) -
The minimum exponent of the primitive digraphs on the given number of arcs
by: Jolanta Rosiak
Published: (2004-01-01) -
PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
by: A. Beletsky, et al.
Published: (2014-04-01) -
Some problems on products of random matrices
by: Cureg, Edgardo S
Published: (2006)