2019/05/04 by Minfeng Shao, Ying Miao, Shao, Minfeng +1 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Coding theory and cryptography #Combinatorics (math.CO) #Cryptography and Security (cs.CR) #DNA and Biological Computing #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #graph theory and CDMA systems
paper · doi:10.48550/arxiv.1905.01412
openalex publication_date 2019/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper provides a combinatorial characterization of weak algebraic manipulation detection (AMD) codes via a kind of generalized external difference families called bounded standard weighted external difference families (BSWEDFs). By means of this characterization, we improve a known lower bound on the maximum probability of successful tampering for the adversary's all possible strategies in weak AMD codes. We clarify the relationship between weak AMD codes and BSWEDFs with various properties. We also propose several explicit constructions for BSWEDFs, some of which can generate new optimal weak AMD codes.