In this note, the explicit representations of Moore-Penrose inverses of lower triangular operator matrices are established. As an application, the explicit representations of Bott-Duffin inverses of bounded linear ope...In this note, the explicit representations of Moore-Penrose inverses of lower triangular operator matrices are established. As an application, the explicit representations of Bott-Duffin inverses of bounded linear operators on a Hilbert space with respect to a closed subspace are obtained.展开更多
Under the assumption that the wiretapper can get at most r(r < n) independent messages, Cai et al. showed that any rate n multicast code can be modified to another secure network code with transmitting rate n- r by...Under the assumption that the wiretapper can get at most r(r < n) independent messages, Cai et al. showed that any rate n multicast code can be modified to another secure network code with transmitting rate n- r by a properly chosen matrix Q^(-1). They also gave the construction for searching such an n × n nonsingular matrix Q. In this paper, we find that their method implies an efficient construction of Q. That is to say, Q can be taken as a special block lower triangular matrix with diagonal subblocks being the(n- r) ×(n- r)and r × r identity matrices, respectively. Moreover, complexity analysis is made to show the efficiency of the specific construction.展开更多
基金Supported bv National Natural Scieince Foundation of China (Grant No.10871224)
文摘In this note, the explicit representations of Moore-Penrose inverses of lower triangular operator matrices are established. As an application, the explicit representations of Bott-Duffin inverses of bounded linear operators on a Hilbert space with respect to a closed subspace are obtained.
基金Supported by the National Natural Science Foundation of China(61201253)
文摘Under the assumption that the wiretapper can get at most r(r < n) independent messages, Cai et al. showed that any rate n multicast code can be modified to another secure network code with transmitting rate n- r by a properly chosen matrix Q^(-1). They also gave the construction for searching such an n × n nonsingular matrix Q. In this paper, we find that their method implies an efficient construction of Q. That is to say, Q can be taken as a special block lower triangular matrix with diagonal subblocks being the(n- r) ×(n- r)and r × r identity matrices, respectively. Moreover, complexity analysis is made to show the efficiency of the specific construction.
