arXiv (OAI Expanded)
open access
Perfect Combinatorial Structures in Coding Theory and Cryptography
This book develops algebraic and combinatorial methods for studying discrete structures. It brings together graph theory, Boolean functions, Fourier analysis on finite groups, coding theory, perfect colorings and perfect codes, association schemes, Latin squares, and related topics. A central theme
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
- Cyclicity of Binary Group Codes.#1173
- Infinite families of 3-designs from linear and nonlinear codes#1109523
- On the Hamming distance properties of group codes#490073
- On the construction of universal families of hash functions via geometric codes and concatenation#612900
- Balanced Gray Codes for Permutations and Rainbow Cycles for Associahedra#1014533
Record · ID 1069934
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