Simplicity conditions for binary orthogonal arrays

DOI10.1007/s10623-022-01105-4OpenAlexW4293916949WikidataQ114849654 ScholiaQ114849654MaRDI QIDQ2678983

Claude Carlet, Rebeka Kiss, Gábor P. Nagy

Publication date: 18 January 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

orthogonal arrayBoolean functionlinear programming boundRao's boundcorrelation-immune

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial aspects of block designs (05B05) Boolean functions (06E30)

Uses Software

• z3
• Orthogonal Array

Cites Work

• Unnamed Item
• Unnamed Item
• Nonexistence of a few binary orthogonal arrays
• Orthogonal arrays. Theory and applications
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• Hadamard matrices, \(d\)-linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights
• Classification of orthogonal arrays by integer programming
• A bound on correlation immunity
• Estimates of the capacity of orthogonal arrays of large strength
• A class of low-rate nonlinear binary codes
• Complete enumeration of pure-level and mixed-level orthogonal arrays
• A spectral characterization of correlation-immune combining functions
• Bounds on orthogonal arrays and resilient functions
• On the nonexistence of certain orthogonal arrays of strength four
• Boolean Functions for Cryptography and Coding Theory

This page was built for publication: Simplicity conditions for binary orthogonal arrays