scientific article; zbMATH DE number 4018402

MaRDI QIDQ3030262zbMATH OpenFDO

Authors Ning Cai

Publication date 1986

zbMATH Keywords

communication complexityfinite setsLee distancemonochromatic rectanglestrong 4-words property

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Bounds on permutation codes of distance four
• A new upper bound for binary codes with minimum distance four
• Semidefinite Code Bounds Based on Quadruple Distances
• Bounds on distance distributions in codes of given size
• scientific article; zbMATH DE number 3948152
• Bounds on the weight hierarchies of linear codes of dimension 4
• On the minimum length of \(q\)-ary linear codes of dimension four
• A simple proof to the minimum distance of \(\mathbb{Z}_{4}\)-linear Goethals-like codes
• scientific article; zbMATH DE number 4150083
• Bounds on Distance Distributions in Codes of Known Size

Cited in

(2)

• Code pairs with specified parity of the Hamming distances
• A general 4-words inequality with consequences for 2-way communication complexity

This page was built for publication:

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