On optimal weak algebraic manipulation detection codes and weighted external difference families

05/04/2019
by   Minfeng Shao, et al.
0

This paper provides a characterization of weak algebraic manipulation detection codes via a kind of generalized external difference families called bounded standard weighted external difference families (BSWEDFs). The relationship shows that the weak algebraic manipulation detection codes are equivalent with BSWEDFs not only for the R-optimal case as mentioned by Huczynska and Paterson [11] but also for the general case. Explicit constructions for both BSWEDFs and SWEDFs are also proposed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2023

Several families of ternary negacyclic codes and their duals

Constacyclic codes contain cyclic codes as a subclass and have nice alge...
research
05/02/2020

New families of self-dual codes

In the recent paper entitled "Explicit constructions of MDS self-dual co...
research
08/21/2009

Computational Understanding and Manipulation of Symmetries

For natural and artificial systems with some symmetry structure, computa...
research
05/16/2023

Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families

Various notions of non-malleable secret sharing schemes have been consid...
research
10/20/2021

Constructions and Applications of Perfect Difference Matrices and Perfect Difference Families

Perfect difference families (PDFs for short) are important both in theor...
research
10/14/2022

Codes on Subgroups of Weighted Projective Tori

We obtain certain algebraic invariants relevant to study codes on subgro...

Please sign up or login with your details

Forgot password? Click here to reset