2017
DOI: 10.1007/s12095-017-0239-4
|View full text |Cite
|
Sign up to set email alerts
|

On generating invertible circulant binary matrices with a prescribed number of ones

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…By setting s = , the following corollary can be obtained immediately. [7]). Let q be a prime power and let n be a positive integer such that gcd(n, q) = .…”
Section: Circulant Matrices Over Cfcrsmentioning
confidence: 99%
See 1 more Smart Citation
“…By setting s = , the following corollary can be obtained immediately. [7]). Let q be a prime power and let n be a positive integer such that gcd(n, q) = .…”
Section: Circulant Matrices Over Cfcrsmentioning
confidence: 99%
“…Then cn(R, a) = cn(R, ) for all a ∈ U(R).. Determinants of Nonsingular Circulant Matrices over CFCRsNonsingular n × n circulant matrices over a CFCR are studied and the number cn(R, a) is determined for all a ∈ U(R) and for all positive integers n such that gcd(n, q) = . By Corollary 4.3, it is enough to derive only the number cn(R, ).Let NSCn(R) = {A ∈ Cn(R) | det(A) ∈ U(R)} denote the set of nonsingular n × n circulant matrices over a CFCR R. The number |NSCn(Fq)| which is key to determine cn(R, ) is given in[16, Proposition 1] and[7] via the ring isomorphism T : Cn(R) → R[X]/ X n − de ned by cir(a , a , . .…”
mentioning
confidence: 99%
“…Lemma 4.4 ([16, Proposition 1] and [6]). Let q be a prime power and let n be a positive integer such that gcd(n, q) = 1.…”
Section: Determinants Of Nonsingular Circulant Matrices Over Cfcrsmentioning
confidence: 99%