scholarly journals Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes

Author(s):  
Claude Crépeau ◽  
Daniel Gottesman ◽  
Adam Smith
2005 ◽  
Vol 5 (1) ◽  
pp. 68-79 ◽  
Author(s):  
H. Imai ◽  
J. Mueller-Quade ◽  
A.C.A. Nascimento ◽  
P. Tuyls ◽  
A. Winter

Similarly to earlier models for quantum error correcting codes, we introduce a quantum information theoretical model for quantum secret sharing schemes. This model provides new insights into the theory of quantum secret sharing. By using our model, among other results, we give a shorter proof of Gottesman's theorem that the size of the shares in a quantum secret sharing scheme must be as large as the secret itself. Also, we introduced approximate quantum secret sharing schemes and showed robustness of quantum secret sharing schemes by extending Gottesman's theorem to the approximate case.


Symmetry ◽  
2019 ◽  
Vol 11 (11) ◽  
pp. 1406
Author(s):  
Bras-Amorós

Several results relating additive ideals of numerical semigroups and algebraic-geometrycodes are presented. In particular, we deal with the set of non-redundant parity-checks, the codelength, the generalized Hamming weights, and the isometry-dual sequences of algebraic-geometrycodes from the perspective of the related Weierstrass semigroups. These results are related tocryptographic problems such as the wire-tap channel, t-resilient functions, list-decoding, networkcoding, and ramp secret sharing schemes.


2011 ◽  
Vol 20 (5) ◽  
pp. 050309 ◽  
Author(s):  
Zu-Rong Zhang ◽  
Wei-Tao Liu ◽  
Cheng-Zu Li

2013 ◽  
Vol 57 (11-12) ◽  
pp. 2695-2702 ◽  
Author(s):  
Qi Chen ◽  
Dingyi Pei ◽  
Chunming Tang ◽  
Qiang Yue ◽  
Tongkai Ji

Author(s):  
Shingo HASEGAWA ◽  
Shuji ISOBE ◽  
Jun-ya IWAZAKI ◽  
Eisuke KOIZUMI ◽  
Hiroki SHIZUYA

2008 ◽  
Vol 25 (4) ◽  
pp. 519-522
Author(s):  
Yongjun Du ◽  
Yuefei Ma

Sign in / Sign up

Export Citation Format

Share Document