A bound on correlation immunity

From MaRDI portal
Publication:2481175

zbMath1132.05309MaRDI QIDQ2481175

Dmitry G. Fon-Der-Flaass

Publication date: 14 April 2008

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/53809




Related Items (27)

Perfect 2-colorings of the generalized Petersen graphPerfect 2-colorings of the generalized Petersen graph GP(n,3)Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codesThe perfect 2-colorings of infinite circulant graphs with a continuous set of odd distancesSimplicity conditions for binary orthogonal arraysOn perfect 2-colorings of the \(q\)-ary \(n\)-cubeEquitable 2-partitions of the Hamming graphs with the second eigenvaluePerfect 2‐colorings of Hamming graphsThe classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codesCombinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphsPerfect colorings of the infinite square grid: coverings and twin colorsOn completely regular codesUnnamed ItemOn diameter perfect constant-weight ternary codesOn calculation of the interweight distribution of an equitable partitionFROM CRYPTANALYSIS TO CRYPTOGRAPHIC PROPERTY OF A BOOLEAN FUNCTIONPerfect 2-colorings of the cubic graphs of order less than or equal to 10Distance-2 MDS codes and Latin colorings in the Doob graphsUnnamed ItemOn the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arraysEstimates of the capacity of orthogonal arrays of large strengthOn unbalanced Boolean functions with best correlation immunityPerfect 3-colorings on 6-regular graphs of order 9Unnamed ItemUnnamed ItemUnnamed ItemPerfect 3-colorings of the cubic graphs of order 10




This page was built for publication: A bound on correlation immunity