Generalizations and applications of the nowhere zero linear mappings in network coding

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In [2], Alon and Tarsi proposed a conjecture about the nowhere-zero point in linear mappings. In this paper, we first study some generalizations of this problem, and obtain necessary and sufficient conditions for the existence of nowhere point in these generalized problems under the assumption |F|≥n+2, where n is the number of rows of the matrix A. Then we apply the results in these generalizations to give a polynomial time algebraic construction of the acyclic network codings. © 2010 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Fang, M., Feng, G. L., & Shao, J. Y. (2011). Generalizations and applications of the nowhere zero linear mappings in network coding. Linear Algebra and Its Applications, 434(3), 841–848. https://doi.org/10.1016/j.laa.2010.09.048

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free