A class of binary matrices preserving rank under matrix addition and its application |
| |
| Authors: | Kil-Chan Ha |
| |
| Institution: | 1. Department of Applied Mathematics, Sejong University, 143-747, Seoul, Korea
|
| |
| Abstract: | An open problem proposed by Safavi-Naini and Seberry in IEEE transactions on information theory (1991) can be reduced to a combinatorial problem on partitioning a subset of binary matrices. We solve the generalized Naini-Seberry's open problem by considering a certain class of binary matrices. Thus a subliminal channel ofr>1 bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
