{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T11:07:55Z","timestamp":1744888075299},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf01200149","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T13:11:08Z","timestamp":1109250668000},"page":"253-261","source":"Crossref","is-referenced-by-count":2,"title":["Rank formulas for certain products of matrices"],"prefix":"10.1007","volume":"4","author":[{"given":"Rudolf","family":"Ahlswede","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Yao, A.: Some Complexity Questions related to Distributive Computing. Proceedings 11th Ann. ACM Sympos. Theory of Computing, 209?213 (1979)","DOI":"10.1145\/800135.804414"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Schmidt, E. M.: Las Vegas is Better than Determinism in VLSI and Distributed Computing. Proceedings 14th ACM STOC, 330?337 (1982)","DOI":"10.1145\/800070.802208"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C. H., Sipser, M.: Communication Complexity. Proceedings 14th Ann. ACM Sympos. on Theory of Computing, 201?214 (1982)","DOI":"10.1145\/800070.802192"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0196-8858(89)90004-3","volume":"10","author":"R. Ahlswede","year":"1989","unstructured":"Ahlswede, R., Cai, N., Zhang, Z.: A General 4-Words Inequality with Consequences for 2-way Communication Complexity. Adv Appl Math10, 75?94 (1989)","journal-title":"Adv Appl Math"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0012-365X(92)90118-Y","volume":"102","author":"R. Brualdi","year":"1992","unstructured":"Brualdi, R., Cai, N., Pless, V.: Orphan Structure of the First Order Reed-Muller Codes. Discrete Math102, 239?247 (1992)","journal-title":"Discrete Math"},{"key":"CR6","unstructured":"Tamm, U.: Communication Complexity of Sum-Type Functions Invariant under Translation. Preprint 91-016 SFB 343 ?Diskrete Strukturen in der Mathematik?. To appear in Inform Comput"},{"key":"CR7","unstructured":"Ahlswede, R., Cai, N.: On Communication Complexity of Vector-Valued Functions. Preprint 91-041 SFB 343 ?Diskrete Strukturen in der Mathematik?, submitted to IEEE Trans. Information Theory"},{"key":"CR8","unstructured":"Ahlswede, R.: On Code Pairs with Specified Hamming Distances. Colloquia Mathematica Societatis J\u00e1nos Bolyai 52. Combinatorics, Eger, 9?47 (1987)"},{"key":"CR9","unstructured":"Ahlswede, R., Cai, N.: Two-Way Communication Complexity of Sum-Type Functions for One Processor to be Informed. Preprint 91-053 SFB 343 ?Diskrete Strukturen in der Mathematik?, submitted to IEEE Trans. Information Theory"},{"key":"CR10","first-page":"235","volume-title":"Paths, Flows, and VLSI-Layout","author":"L. Lov\u00e1sz","year":"1990","unstructured":"Lov\u00e1sz, L.: Communication Complexity. A Survey In: Paths, Flows, and VLSI-Layout. Korte, B., Lov\u00e1sz, L., Pr\u00f6mel, H. J., Schrijver, A. (eds) 235?266. Berlin, Heidelberg, New York: Springer 1990"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200149.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200149\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T22:35:59Z","timestamp":1586126159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF01200149"],"URL":"https:\/\/doi.org\/10.1007\/bf01200149","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}