Inequalities for code pairs

DOI10.1016/S0195-6698(88)80044-1zbMath0549.05007OpenAlexW2045682744MaRDI QIDQ800361

Michael Moers

Publication date: 1988

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(88)80044-1

zbMATH Keywords

Hamming distancecode pairs

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions ⋮ Code pairs with specified parity of the Hamming distances

Cites Work

• Unnamed Item
• A two-family extremal problem in Hamming space
• An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes

This page was built for publication: Inequalities for code pairs