A theorem about linear rank inequalities that depend on the characteristic of the finite field
DOI:
https://doi.org/10.17268/sel.mat.2022.01.12Keywords:
Mutually complementary vector spaces, Binary matrix, Finite field, Entropy, Linear rank inequalityAbstract
A linear rank inequality is a linear inequality that holds by dimensions of vector spaces over any finite field. A characteristic-dependent linear rank inequality is also a linear inequality that involves dimensions of vector spaces but this holds over finite fields of determined characteristics, and does not in general hold over other characteristics. In this paper, using as guide binary matrices whose ranks depend on the finite field where they are defined, we show a theorem which explicitly produces characteristic-dependent linear rank inequalities; this theorem generalizes results previously obtained in the literature.
References
Blasiak A, Kleinberg R, Lubetzky E. Lexicographic Products and the Power of non-Linear Network Coding, IEEE Symposium on Foundations of Computer Science. 2011; 609-618.
Dougherty R, Freiling C, Zeger K. Insufficiency of Linear Coding in Network Information Flow, IEEE Transactions on Information Theory, 2005; 51(8):2745-2759.
Dougherty R, Freiling C, Zeger K. Linear Rank Inequalities on Five or More Variables, ArXiv 0910.0284; 2010.
Dougherty R, Freiling C, Zeger K. Achievable Rate Regions for Network Coding, IEEE Transactions on Information Theory. 2015; 61(5):2488-2509.
Ingleton AW. Representation of Matroids. Combinatorial Mathematics and its Applications, Oxford. 1969; 149-167.
Kinser R. New Inequalities for Subspace Arrangements, Journal Combinatorial Theory Serie A. 2011; 118(1):152-161.
Peña-Macias V, Sarria H. Characteristic-Dependent Linear Rank Inequalities via Complementary Vector Spaces, J. of Information and Optimization Sciences. 2021; 42(2):345-369. DOI: 10.1080/02522667.2019.1668157
Peña-Macias V, Sarria H. Characteristic-Dependent Linear Rank Inequalities in 21 variables, Revista Academia Colombiana de Ciencias Exactas, Físicas y Naturales. 2019; 43(169):765-770. https://doi.org/10.18257/raccefyn.928
Peña-Macias V, Sarria H. Linear Programming Problems in Network Coding and Closure Operators via Partitions, Revista Selecciones Matemáticas. 2019; 6(2):269-274. http://dx.doi.org/10.17268/sel.mat.2019.02.12
Shen A, Hammer D, Romashchenko AE, Vereshchagin NK. Inequalities for Shannon Entropy and Kolmogorov Complexity, Journal of Computer and Systems Sciences. 2000; 60:442-464.
Yeung R. A First Course in Information Theory, Springer, Berlin; 2002.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Selecciones Matemáticas
This work is licensed under a Creative Commons Attribution 4.0 International License.
The authors who publish in this journal accept the following conditions:
1. The authors retain the copyright and assign to the journal the right of the first publication, with the work registered with the Creative Commons Attribution License,Atribución 4.0 Internacional (CC BY 4.0) which allows third parties to use what is published whenever they mention the authorship of the work And to the first publication in this magazine.
2. Authors may make other independent and additional contractual arrangements for non-exclusive distribution of the version of the article published in this journal (eg, include it in an institutional repository or publish it in a book) provided they clearly state that The paper was first published in this journal.
3. Authors are encouraged to publish their work on the Internet (for example, on institutional or personal pages) before and during the review and publication process, as it can lead to productive exchanges and to a greater and more rapid dissemination Of the published work.
