On degree-3 and \((n - 4)\)-correlation-immune perfect colorings of \(n\)-cubes
From MaRDI portal
Publication:6570053
DOI10.1016/j.disc.2024.114138zbMATH Open1543.05056MaRDI QIDQ6570053
Alexander Valyuzhenich, Denis S. Krotov
Publication date: 10 July 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cameron-Liebler line classes in \(PG(n,4)\)
- On weight distributions of perfect colorings and completely regular codes
- On the degree of Boolean functions as real polynomials
- Problems in algebraic combinatorics
- Boolean degree 1 functions on some classical association schemes
- Cycle-balance conditions for distance-regular graphs
- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function
- The extended 1-perfect trades in small hypercubes
- Equitable 2-partitions of the Hamming graphs with the second eigenvalue
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- Maximal partial packings of \(\mathbb Z_2^n\) with perfect codes
- On multifold MDS and perfect codes that are not splittable into onefold codes
- A bound on correlation immunity
- Degree 2 Boolean functions on Grassmann graphs
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Cameron‐Liebler line classes in PG(3, 5)
- On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
- On Multifold Packings of Radius-1 Balls in Hamming Graphs
- Analysis of Boolean Functions
This page was built for publication: On degree-3 and \((n - 4)\)-correlation-immune perfect colorings of \(n\)-cubes
