On unbalanced Boolean functions with best correlation immunity

DOI10.37236/8557OpenAlexW3102415219MaRDI QIDQ2309213

Konstantin Vorob'ev, Denis S. Krotov

Publication date: 30 March 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.02166

Mathematics Subject Classification ID

Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Boolean functions (06E30)

Related Items

The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances ⋮ Equitable 2-partitions of the Hamming graphs with the second eigenvalue ⋮ Perfect 2‐colorings of Hamming graphs ⋮ The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes ⋮ Unnamed Item

Uses Software

• nauty
• Traces

Cites Work

• On perfect 2-colorings of the \(q\)-ary \(n\)-cube
• Nonexistence of a few binary orthogonal arrays
• On weight distributions of perfect colorings and completely regular codes
• Classification algorithms for codes and designs
• On perfect colorings of Boolean \(n\)-cube and correlation immune functions with small density
• Orthogonal arrays. Theory and applications
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• 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
• Bounds on orthogonal arrays and resilient functions
• Integer Programming for Classifying Orthogonal Arrays
• On Orthogonal Arrays
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On unbalanced Boolean functions with best correlation immunity