A new class of optimal 3-splitting authentication codes (Q2491277): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10623-005-1501-x
+Normal rank
@@ Property / OpenAlex ID @@
+W4249185595
@@ Property / OpenAlex ID: W4249185595 / rank @@
+Normal rank
@@ Property / cites work @@
+Splitting balanced incomplete block designs with block size 3 × 2
+Normal rank
@@ Property / cites work @@
+On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
+Normal rank
@@ Property / cites work @@
+Lower bounds on the probability of deception in authentication with arbitration
+Normal rank
@@ Property / cites work @@
+Combinatorial Constructions for Optimal Splitting Authentication Codes
+Normal rank
@@ Property / cites work @@
+New combinatorial designs and their applications to authentication codes and secret sharing schemes.
+Normal rank
@@ Property / cites work @@
+Authentication Theory/Coding Theory
@@ Property / cites work: Authentication Theory/Coding Theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
+Normal rank