Some t-homogeneous sets of permutations

DOI10.1023/A:1027333822360zbMATH Open0859.05033MaRDI QIDQ1924166FDOQ1924166

Authors: Stephen Black, Yves Edel, Jürgen Bierbrauer 

Publication date: 7 April 1997

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Recommendations

• Some highly symmetric authentication perpendicular arrays
• Theory of perpendicular arrays
• Some perpendicular arrays for arbitrarily large \(t\)

zbMATH Keywords

authenticationcombinatorial designsnumber of permutationsperpendicular arrayssets of permutationsgroups of permutationsuniformly \(t\)-homogeneous sets of permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other designs, configurations (05B30)

Cited In (7)

• A bound on permutation codes
• A recursive construction of \(t\)-wise uniform permutations
• Suitable permutations, binary covering arrays, and Paley matrices
• Large sets with multiplicity
• Some perpendicular arrays for arbitrarily large \(t\)
• On t-homogeneous permutation sets
• Title not available (Why is that?)

This page was built for publication: Some \(t\)-homogeneous sets of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924166)