Abstract | ||
---|---|---|
We give easy proofs of some recent results concerning threshold gaps in ramp schemes. We then generalise a construction method for ramp schemes employing error-correcting codes so that it can be applied using nonlinear (as well as linear) codes. Finally, as an immediate consequence of these results, we provide a new explicit bound on the minimum length of a code having a specified distance and dual distance. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/s12095-013-0082-1 | Cryptography and Communications |
Keywords | DocType | Volume |
Threshold scheme,Ramp scheme,Code,Dual distance | Journal | 5 |
Issue | ISSN | Citations |
4 | 1936-2447 | 3 |
PageRank | References | Authors |
0.44 | 13 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Maura B. Paterson | 1 | 164 | 17.08 |
Douglas R. Stinson | 2 | 2387 | 274.83 |