Closure Solvability for Network Coding and Secret Sharing

DOI10.1109/TIT.2013.2282293zbMath1364.94286arXiv1209.6558OpenAlexW2036272771MaRDI QIDQ5346194

Maximilien Gadouleau

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.6558

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62) Source coding (94A29)

Related Items (3)

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Density of free modules over finite chain rings ⋮ Finite Dynamical Systems, Hat Games, and Coding Theory

This page was built for publication: Closure Solvability for Network Coding and Secret Sharing