scholarly journals The lower bound and exact value of the information rate of some developed graph access structures

2020 ◽  
Vol 39 (4) ◽  
pp. 1005-1017
Author(s):  
Abbas Cheraghi
Keyword(s):  
Lower Bound ◽  
Information Rate ◽  
Access Structures ◽  
Graph Access

The optimal information rate for graph access structures of nine participants

2015 ◽  
Vol 9 (5) ◽  
pp. 778-787 ◽  
Author(s):  
Yun Song ◽  
Zhihui Li ◽  
Yongming Li ◽  
Ren Xin
Keyword(s):  
Information Rate ◽  
Access Structures ◽  
Optimal Information ◽  
Graph Access

The complexity of the connected graph access structure on seven participants

2017 ◽  
Vol 11 (1) ◽  
pp. 25-35
Author(s):  
Massoud Hadian Dehkordi ◽  
Ali Safi
Keyword(s):  
Lower Bound ◽  
Secret Sharing ◽  
Upper Bound ◽  
Connected Graph ◽  
Access Structure ◽  
Decomposition Techniques ◽  
Induced Subgraph ◽  
Access Structures ◽  
Graph Access

AbstractIn this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of the graph G. Then, applying decomposition techniques, we obtain an upper bound on the complexity of the graph G. We determine the exact values of the complexity for each of the ten graph access structures on seven participants. Also, we improve the value bound of the complexity for the six graph access structures with seven participants.

The Optimal Information Rates of the Graph Access Structures on Seven Participants

2013 ◽  
Vol 859 ◽  
pp. 596-601
Author(s):  
Zhi Hui Li ◽  
Yun Song ◽  
Yong Ming Li
Keyword(s):  
Secret Sharing ◽  
Information Rate ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Open Problems ◽  
Information Rates ◽  
Access Structures ◽  
Sharing Scheme ◽  
Optimal Information ◽  
Graph Access

The information rate is an important metric of the performance of a secret-sharing scheme. In this paper, we deal with determining the exact values for the optimal information rates of the six graph access structures and improving the information rate of a graph access structure on seven participants, which remained as open problems in Song's and Wang's paper([1,2]). We prove that the optimal information rate for each of the six graph access structures is equal to 4/7

scholarly journals New Lower Bound below the Information Rate of Phase Noise Channel Based on Kalman Carrier Recovery

2012 ◽  
Vol 4 (4) ◽  
pp. 597-607 ◽  
Author(s):  
Luca Barletta ◽  
◽  
Maurizio Magarini ◽  
Arnaldo Spalvieri ◽  
◽  
...  
Keyword(s):  
Lower Bound ◽  
Phase Noise ◽  
Information Rate ◽  
Carrier Recovery

On the Pixel Expansion of Visual Cryptography Scheme

2017 ◽  
Vol 9 (2) ◽  
pp. 38-44 ◽  
Author(s):  
Teng Guo ◽  
Jian Jiao ◽  
Feng Liu ◽  
Wen Wang
Keyword(s):  
Visual Cryptography ◽  
Upper Bounds ◽  
Graph Decomposition ◽  
Decomposition Technique ◽  
Pixel Expansion ◽  
Access Structures ◽  
Visual Cryptography Scheme ◽  
Graph Access

In this paper, we first follow Ateniese et al.'s work that provides upper bounds of the pixel expansion of visual cryptography schemes(VCSs) for more kinds of graph access structures, in which we require that a subset of parties can determine the secret if they contain an edge of the graph G. The constructive upper bounds are derived by the graph decomposition technique. Then we generalize Ateniese et al.'s method of comparing the optimal pixel expansion of VCSs with two different access structures.

scholarly journals Graph access structures with optimal pixel expansion three

2013 ◽  
Vol 230 ◽  
pp. 67-75
Author(s):  
S. Arumugam ◽  
R. Lakshmanan ◽  
Atulya K. Nagar
Keyword(s):  
Pixel Expansion ◽  
Access Structures ◽  
Graph Access

Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

2010 ◽  
Vol 24 (2) ◽  
pp. 617-638 ◽  
Author(s):  
Hung-Min Sun ◽  
Huaxiong Wang ◽  
Bying-He Ku ◽  
Josef Pieprzyk
Keyword(s):  
Polynomial Time ◽  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Access Structures ◽  
Graph Access

scholarly journals On the achievable rate of bandlimited continuous-time AWGN channels with 1-bit output quantization

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Sandra Bender ◽  
Meik Dörpinghaus ◽  
Gerhard P. Fettweis
Keyword(s):  
Lower Bound ◽  
Mutual Information ◽  
Gaussian Noise ◽  
Continuous Time ◽  
Additive White Gaussian Noise ◽  
White Gaussian Noise ◽  
Information Rate ◽  
Achievable Rate ◽  
Zero Crossing ◽  
Lower Bounding

AbstractWe consider a real continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. We derive an approximate lower bound on the capacity by lower-bounding the mutual information rate for input signals with exponentially distributed zero-crossing distances, sine-shaped transition waveform, and an average power constraint. The focus is on the behavior in the mid-to-high signal-to-noise ratio (SNR) regime above 10 dB. For hard bandlimited channels, the lower bound on the mutual information rate saturates with the SNR growing to infinity. For a given SNR the loss with respect to the unquantized additive white Gaussian noise channel solely depends on the ratio of channel bandwidth and the rate parameter of the exponential distribution. We complement those findings with an approximate upper bound on the mutual information rate for the specific signaling scheme. We show that both bounds are close in the SNR domain of approximately 10–20 dB.

Sign in / Sign up

Export Citation Format

Share Document