Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
Paterson, Maura B. and Stinson, D.R. (2015) Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. Technical Report. Birkbeck, University of London, London, UK.
|
Text
26731.pdf - Draft Version Download (1MB) | 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: | Monograph (Technical Report) |
|---|---|
| Additional Information: | Birkbeck Pure Mathematics Preprint Series #13 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 22 Mar 2019 13:17 |
| Last Modified: | 09 Aug 2023 12:46 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/26731 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |