The clique distribution in powers of hypercubes

DOI10.1016/J.DAM.2021.08.030zbMATH Open1486.94168OpenAlexW3201405287MaRDI QIDQ2235258FDOQ2235258

Authors: Yongfang Kou, Weihua Yang, Xiaomin Hu 

Publication date: 21 October 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2021.08.030

Recommendations

• Construction of several classes of maximum codes
• On a hypercube coloring problem
• scientific article; zbMATH DE number 3843662
• Maximal Binary Cliques
• On the large maximal \(\{ 0,1,2,\dots,t\}\)-cliques in Hamming graph \(H(n,q)\)

zbMATH Keywords

Hamming distancehypercubecliquecoding theory

Mathematics Subject Classification ID

Distance in graphs (05C12) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Cites Work

• Error detecting and error correcting codes
• Title not available (Why is that?)
• Binary codes with a minimum distance of four (Corresp.)
• A table of upper bounds for binary codes
• A coloring problem on the \(n\)-cube
• Some results on the existence of binary linear codes (Corresp.)
• On a combinatorial conjecture of Erdös
• Improved upper bounds on sizes of codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
• The distinguishing number of the hypercube
• Strengthening the Gilbert-Varshamov bound
• Sharpening the Gilbert-Varshamov bound in the finite case
• The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
• The chromatic number of the square of the 8-cube

Cited In (3)

• Some distribution numbers of the hypercubic association scheme
• Focusing of the scan statistic and geometric clique number
• Codes and Xor graph products

This page was built for publication: The clique distribution in powers of hypercubes

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