Pages that link to "Item:Q5317578"

The following pages link to Combinatorial Constructions for Optimal Splitting Authentication Codes (Q5317578):

Displaying 20 items.

• Some new classes of 2-fold optimal or perfect splitting authentication codes (Q507956) (← links)
• A note on cyclic almost difference families (Q533763) (← links)
• Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order (Q534518) (← links)
• A new class of splitting 3-designs (Q548095) (← links)
• Combinatorial bounds and characterizations of splitting authentication codes (Q601095) (← links)
• A new class of 3-fold perfect splitting authentication codes (Q663455) (← links)
• Disjoint difference families and their applications (Q908044) (← links)
• Authentication codes and bipartite graphs (Q932829) (← links)
• Further results on the existence of splitting BIBDs and application to authentication codes (Q973782) (← links)
• Perfect difference systems of sets and Jacobi sums (Q1043561) (← links)
• New combinatorial designs and their applications to authentication codes and secret sharing schemes. (Q1428540) (← links)
• Combinatorial classification of optimal authentication codes with arbitration (Q1581793) (← links)
• A construction for optimal \(c\)-splitting authentication and secrecy codes (Q1650431) (← links)
• On the equivalence of authentication codes and robust (2, 2)-threshold schemes (Q2033514) (← links)
• Existence on splitting-balanced block designs with resolvability (Q2364419) (← links)
• A new class of optimal 3-splitting authentication codes (Q2491277) (← links)
• Combinational constructions of splitting authentication codes with perfect secrecy (Q2673993) (← links)
• (Q3572584) (← links)
• Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes (Q6047434) (← links)
• Decomposing complete graphs into isomorphic complete multipartite graphs (Q6613355) (← links)