2021/10/29 by Victor Peña-Macias, Peña-Macias, Victor
Computer Science · #Cryptography and Data Security #Complexity and Algorithms in Graphs #Cooperative Communication and Network Coding
paper · pdf · doi:10.48550/arxiv.2111.00120
Determining information ratios of access structures is an important problem\nin secret sharing. Information inequalities and linear rank inequalities play\nan important role for proving bounds. Characteristic-dependent linear rank\ninequalities are rank inequalities which are true over vector spaces with\nspecific field characteristic. In this paper, using ideas of secret sharing, we\nshow a theorem that produces characteristic-dependent linear rank inequalities.\nThese inequalities can be used for getting lower bounds on information ratios\nin linear secret sharing.\n