Information and Average Information Rates of a Graphical Access Structure on Six Vertices
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.
Anahtar Kelimeler:
Turk. J. Elec. Eng. & Comp. Sci., 8, (2000), 55-66. Full text: pdf Other articles published in the same issue: Turk. J. Elec. Eng. & Comp. Sci., vol.8, iss.1.
Information and Average Information Rates of a Graphical Access Structure on Six Vertices
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.
Keywords:
Turk. J. Elec. Eng. & Comp. Sci., 8, (2000), 55-66. Full text: pdf Other articles published in the same issue: Turk. J. Elec. Eng. & Comp. Sci., vol.8, iss.1.,
- ISSN: 1300-0632
- Yayın Aralığı: Yılda 6 Sayı
- Yayıncı: TÜBİTAK