Rank formulas for certain products of matrices

DOI10.1007/BF01200149MaRDI QIDQ1311620zbMATH OpenFDO

Authors Ning Cai, Rudolf Ahlswede

Publication date 21 January 1994

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

Hamming distancecommunication complexitymatrix operationsexponential ranklog rankmissing dimensionquasi-direct sumquasi-outer productsum-type functions

Mathematics Subject Classification ID

Communication theory (94A05)

Recommendations

• Still another rank determination of set intersection matrices with an application in communication complexity
• A comparison of two lower-bound methods for communication complexity
• Two-way communication complexity of sum-type functions for one processor to be informed
• On the ``log rank-conjecture in communication complexity
• Harmonic analysis, real approximation, and the communication complexity of Boolean functions

Cites work

• A general 4-words inequality with consequences for 2-way communication complexity
• Communication complexity of sum-type functions invariant under translation
• Orphan structure of the first-order Reed--Muller codes

Cited in

(6)

• Rank formulae from the perspective of orthogonal projectors
• On Blocky Ranks Of Matrices
• Numerical Rank Deficiency in Matrix Products
• scientific article; zbMATH DE number 833769 (Why is no real title available?)
• scientific article; zbMATH DE number 2209674 (Why is no real title available?)
• Products of matrices with prescribed spectra and ranks

This page was built for publication: Rank formulas for certain products of matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311620)