[BL90] Benaloh, J. and Leichter, J., Generalized Secret Sharing and Monotone Functions, in Proceedings on Advances in Cryptology, Springer-Verlag New York, Inc., CRYPTO '88, New York, NY, USA (1990), 27--35.
[BBFKKW06] Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A. and Wassermann, A., Error-Correcting Linear Codes: Classification by Isometry and Applications, Springer Berlin Heidelberg, Algorithms and Computation in Mathematics (2006).
[CG12] Costantini, M. and de Graaf, W.,
singular, The GAP interface to Singular, Version
12.04.28
(2012)
(GAP package).
[DGPS15] Decker, W., Greuel, G.-M., Pfister, G. and Schoenemann, H., Singular 4-0-2 --- A computer algebra system for polynomial computations (2015).
[DFZ07] Dougherty, R., Freiling, C. and Zeger, K., Networks, Matroids, and Non-Shannon Information Inequalities, IEEE Transactions on Information Theory, 53 (6) (2007), 1949-1969.
[DFZ09] Dougherty, R., Freiling, C. and Zeger, K., Linear Rank Inequalities on Five or More Variables, arXiv cs.IT/0910.0284v3 (2009).
[KM03] Koetter, R. and Medard, M., An algebraic approach to network coding, IEEE/ACM Transactions on Networking, 11 (5) (2003), 782-795.
[LWW15] Li, C., Weber, S. and Walsh, J. M., On Multi-source Networks: Enumeration, Rate Region Computation, and Hierarchy, CoRR, abs/1507.05728 (2015).
[Sha79] Shamir, A., How to Share a Secret, Commun. ACM, ACM, 22 (11), New York, NY, USA (1979), 612--613.
[ST10] Subramanian, A. T. and Thangaraj, A., Path gain algebraic formulation for the scalar linear network coding problem, IEEE Transactions on Information Theory, 56 (9) (2010), 4520--4531.
[Yeu08] Yeung, R. W., Information Theory and Network Coding, Springer (2008).
generated by GAPDoc2HTML