The following pages link to (Q4206689):
Displaying 14 items.
- A two-family extremal problem in Hamming space (Q789376) (← links)
- Pairs of codes with prescribed Hamming distances and coincidences (Q851769) (← links)
- On the high density behavior of Hamming codes with fixed minimum distance (Q852065) (← links)
- An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes (Q1065758) (← links)
- A general 4-words inequality with consequences for 2-way communication complexity (Q1118569) (← links)
- Universal code families (Q1310750) (← links)
- Disconnected vertex sets and equidistant code pairs (Q1378495) (← links)
- Code pairs with specified parity of the Hamming distances (Q1584332) (← links)
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance (Q1696750) (← links)
- Codes and Xor graph products (Q2466342) (← links)
- (Q3824342) (← links)
- On the Hamming distance properties of group codes (Q4024558) (← links)
- (Q4470359) (← links)
- Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions (Q4915250) (← links)
