A construction for authentication/secrecy codes from 3-homogeneous permutation groups
From MaRDI portal
Recommendations
- Three constructions of authentication codes with perfect secrecy
- scientific article; zbMATH DE number 1982612
- Three constructions of authentication/secrecy codes
- scientific article; zbMATH DE number 1247722
- scientific article; zbMATH DE number 4057437
- A construction for authentication/secrecy codes from certain combinatorial designs
- A new class of 3-fold perfect splitting authentication codes
- Three constructions of authentication codes from power function over finite fields with perfect secrecy.
- scientific article; zbMATH DE number 1029235
- scientific article; zbMATH DE number 4070794
Cites work
- scientific article; zbMATH DE number 3643278 (Why is no real title available?)
- scientific article; zbMATH DE number 3856985 (Why is no real title available?)
- scientific article; zbMATH DE number 4200214 (Why is no real title available?)
- scientific article; zbMATH DE number 4210147 (Why is no real title available?)
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 4070794 (Why is no real title available?)
- scientific article; zbMATH DE number 4075081 (Why is no real title available?)
- scientific article; zbMATH DE number 3715579 (Why is no real title available?)
- scientific article; zbMATH DE number 3893245 (Why is no real title available?)
- scientific article; zbMATH DE number 3895109 (Why is no real title available?)
- A construction for authentication/secrecy codes from certain combinatorial designs
- Authentication Theory/Coding Theory
- Codes Which Detect Deception
- Communication Theory of Secrecy 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 New 5-Designs
- Some constructions and bounds for authentication codes
- Steiner pentagon systems
- k-homogeneous groups
Cited in
(12)- scientific article; zbMATH DE number 1290176 (Why is no real title available?)
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- On the construction of authentication and secrecy codes
- Three constructions of authentication/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\)
- On 1-factorizations of bipartite Kneser graphs
- Monotypical uniformly homogeneous sets of permutations
- Theory of perpendicular arrays
This page was built for publication: A construction for authentication/secrecy codes from 3-homogeneous permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q909643)
