Strong qualitative independence.

DOI10.1016/S0166-218X(03)00190-2zbMath1088.90031OpenAlexW2064023821MaRDI QIDQ1422407

Gyula O. H. Katona

Publication date: 14 February 2004

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00190-2

zbMATH Keywords

Hadamard matrixSearchCodeQualitatively independent sets

Mathematics Subject Classification ID

Partitions of sets (05A18) Search theory (90B40) Communication, information (94A99)

Related Items (1)

Rényi 100, quantitative and qualitative (in)dependence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On qualitatively independent partitions and related problems
• Explicit construction of exponential sized families of k-independent sets
• On the maximum number of qualitative independent partitions
• A Sperner-type theorem and qualitative independence
• Sperner systems consisting of pairs of complementary subsets
• Sperner capacities
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Lower bounds for constant weight codes
• Orthogonal partitions and covering of graphs
• On A Problem of Purdy Related to Sperner Systems
• On generalized graphs
• A short proof of Sperner's lemma
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• Indépendance d'ensembles et prolongement de mesures (Résultats et problèmes)
• Delta-systems and qualitative (in)dependence

This page was built for publication: Strong qualitative independence.