A construction for authentication/secrecy codes from 3-homogeneous permutation groups
From MaRDI portal
Publication:909643
DOI10.1016/S0195-6698(13)80058-3zbMath0694.94008MaRDI QIDQ909643
Douglas R. Stinson, Luc Teirlinck
Publication date: 1990
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items (12)
A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ The combinatorics of authentication and secrecy codes ⋮ Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\). ⋮ Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes ⋮ Some highly symmetric authentication perpendicular arrays ⋮ Some perpendicular arrays for arbitrarily large \(t\) ⋮ Unnamed Item ⋮ Monotypical uniformly homogeneous sets of permutations ⋮ Three constructions of authentication/secrecy codes ⋮ On the construction of authentication and secrecy codes ⋮ On 1-factorizations of bipartite Kneser graphs ⋮ Theory of perpendicular arrays
Cites Work
- Steiner pentagon systems
- Ein elementarer und konstruktiver Beweis für die Zerlegungsgleichheit der Hill'schen Tetraeder mit einem Quader. (An elementary and constructive proof for the equivalence by dissection of the Hill tetrahedra with a rectangular parallelepipedon)
- Some constructions and bounds for authentication codes
- A construction for authentication/secrecy codes from certain combinatorial designs
- \(k\)-homogeneous groups
- Communication Theory of Secrecy Systems*
- Authentication Theory/Coding Theory
- Some New 5-Designs
- Codes Which Detect Deception
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A construction for authentication/secrecy codes from 3-homogeneous permutation groups
