Paterson, Maura B. and Stinson, D. (2016) Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Discrete Mathematics 339 (12), pp. 2891-2906. ISSN 0012-365X.
|
Text
AMD.pdf - Author's Accepted Manuscript Download (329kB) | Preview |
Abstract
This paper provides a mathematical analysis of optimal algebraic manipulation detection (AMD) codes. We prove several lower bounds on the success probability of an adversary and we then give some combinatorial characterizations of AMD codes that meet the bounds with equality. These characterizations involve various types of generalized difference families. Constructing these difference families is an interesting problem in its own right.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Difference family, Algebraic manipulation detection |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Maura Paterson |
| Date Deposited: | 08 Jul 2016 09:57 |
| Last Modified: | 09 Aug 2023 12:38 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/15431 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
