Information and average information rates of a graphical access structure on six vertices
Küçük Resim Yok
Tarih
2000
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In this paper we study the optimal information and average information rates of secret sharing schemes which are all connected graphs on six vertices. There are 102 connected graphs on six vertices that are not complete multipartite graphs. of these 102 graphs, we determined the optimal information rate of 71 graphs, and the optimal average information rate of 88 graphs.
Açıklama
Anahtar Kelimeler
Mühendislik, Elektrik ve Elektronik
Kaynak
Turkish Journal of Electrical Engineering and Computer Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
8
Sayı
1
