Digital Commons @ Michigan Tech
metadata only
Some t-homogeneous sets of permutations
Perpendicular Arrays are ordered combinatorial structures, which recently have found applications in cryptography. A fundamental construction uses as ingredients combinatorial designs and uniformly t-homogeneous sets of permutations. We study the latter type of objects. These may also be viewed as g
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An experimental study of forbidden patterns in geometric permutations by combinatorial lifting#311963
- Construction of orthogonal arrays#356746
- A Description of the Camellia Encryption Algorithm#476232
- Perfect Combinatorial Structures in Coding Theory and Cryptography#1069934
- Distributed Algorithms for Near-Equitable Coloring#429339
Record · ID 1089333
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive