A class of binary matrices preserving rank under matrix addition and its application (Q1885071): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:06, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of binary matrices preserving rank under matrix addition and its application |
scientific article |
Statements
A class of binary matrices preserving rank under matrix addition and its application (English)
0 references
28 October 2004
0 references
An open problem proposed by \textit{R. S. Safavi-Naini} and \textit{J. R. Seberry} [IEEE Trans. Inf. Theory 37, No. 1, 13--17 (1991; Zbl 0712.94011)] can be reduced to a combinatorial problem on partitioning a subset of binary matrices. We solve the generalized Safavi-Naini--Seberry open problem by considering a certain class of binary matrices. Thus a subliminal channel of \(r>1\) bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples.
0 references
