An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes

DOI10.1016/S0012-365X(85)80008-XzbMATH Open0576.94017OpenAlexW2022772864MaRDI QIDQ1065758FDOQ1065758

Authors: Ph. Piret, Philippe Delsarte 

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(85)80008-x

Recommendations

• Inequalities for code pairs
• scientific article; zbMATH DE number 4127151
• scientific article; zbMATH DE number 3930896
• On the average Hamming distance for binary codes
• A two-family extremal problem in Hamming space

zbMATH Keywords

orthogonal codesproduct of the cardinalities

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• A two-family extremal problem in Hamming space
• Unrestricted codes with the Golay parameters are unique

Cited In (8)

• Inequalities for code pairs
• Codes with given distances
• Code pairs with specified parity of the Hamming distances
• A general 4-words inequality with consequences for 2-way communication complexity
• Title not available (Why is that?)
• A two-family extremal problem in Hamming space
• Forbidden Intersections
• On a restricted cross-intersection problem

This page was built for publication: An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes

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