Equitable \([[2, 10], [6, 6]]\)-partitions of the 12-cube

DOI10.1007/S12095-024-00716-ZMaRDI QIDQ6643242

Denis S. Krotov

Publication date: 26 November 2024

Published in: Cryptography and Communications (Search for Journal in Brave)

zbMATH Keywords

orthogonal arraysperfect coloringsequitable partitionsintriguing setscorrelation-immune Boolean functions

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Boolean functions (94D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classification algorithms for codes and designs
• On perfect 2-colorings of the hypercube
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• On unbalanced Boolean functions with best correlation immunity
• Practical graph isomorphism. II.
• A bound on correlation immunity
• Perfect colorings of the 12-cube that attain the bound on correlation immunity
• Estimates of the capacity of orthogonal arrays of large strength
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Complete enumeration of pure-level and mixed-level orthogonal arrays
• On Orthogonal Arrays

This page was built for publication: Equitable \([[2, 10], [6, 6]]\)-partitions of the 12-cube

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