A class of binary matrices preserving rank under matrix addition and its application
From MaRDI portal
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.
Recommendations
- Publication:4505946
- Additive preservers of rank-additivity on matrix spaces
- scientific article; zbMATH DE number 2221132
- scientific article; zbMATH DE number 5878254
- The augmentation property of binary matrices for the binary and Boolean rank
- On the binary and Boolean rank of regular matrices
- Additive preservers of rank-additivity on the spaces of symmetric and alternate matrices.
- Additive rank-one preservers between spaces of rectangular matrices
- Additive map preserving rank 2 on alternate matrices
- Additive preservers of rank on alternate matrix spaces over fields and applications
Cites work
Cited in
(5)- Invertible binary matrices with maximum number of 2-by-2 invertible submatrices
- Reliable recognition of masked binary matrices. Connection to information security in map systems
- Linear maps preserving pairs of Hermitian matrices on which the rank is additive and applications
- A note on error-correcting codes for authentication and subliminal channels
- Linear maps preserving M-P inverses of matrices between matrix spaces over fields
This page was built for publication: A class of binary matrices preserving rank under matrix addition and its application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885071)