A CLASS OF BINARY MATRICES PRESERVING RANK UNDER MATRIX ADDITION AND ITS APPLICATION

  • Ha, Kil-Chan (Department of Applied Mathematics, Sejong University)
  • Published : 2004.09.01

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 of r 〉 1 bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples.

Keywords