Two results on the bit extraction problem

DOI10.1016/S0166-218X(99)00150-XMaRDI QIDQ1962063zbMATH OpenOpenAlexWikidataFDO

Authors Katalin Friedl, Shi-Chun Tsai

Publication date 13 June 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00150-x

zbMATH Keywords

bit extraction problemBoolean cubecoloring problemdistance distribution of color classesKrawtchouk polynomialslocally symmetric coloringresilient functionsXOR-type coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Boolean functions (06E30) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 1256667
• Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
• A note on a conjecture concerning symmetric resilient functions
• A note on a conjecture concerning symmetric resilient functions
• On perfect 2-colorings of the q-ary n-cube

Cites work

• A note on a conjecture concerning symmetric resilient functions
• An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256667 (Why is no real title available?)
• scientific article; zbMATH DE number 1406784 (Why is no real title available?)
• Privacy Amplification by Public Discussion

Cited in

(1)

• scientific article; zbMATH DE number 1256667 (Why is no real title available?)

This page was built for publication: Two results on the bit extraction problem

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