Skip to main content
Download PDF
- Main
Characteristic Dependent Linear Rank Inequalities and Applications to Network Coding /
Abstract
Let P be a finite or co-finite set of primes. We prove there exists a linear rank inequality valid for all fields with characteristic in P. These linear rank inequalities are then used to prove that there exists a network that is linearly solvable over a field, F, if and only if the characteristic of F is in P
Main Content
For improved accessibility of PDF content, download the file to your device.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%