Transmitting in the \(n\)-dimensional cube (Q1199408): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q178698 |
||
Property / author | |||
Property / author: Noga Alon / rank | |||
Revision as of 09:39, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Transmitting in the \(n\)-dimensional cube |
scientific article |
Statements
Transmitting in the \(n\)-dimensional cube (English)
0 references
16 January 1993
0 references
It is proved that for any integer \(n\) and for any sequence \(a_ 1,\dots,a_ k\) of \(k=\lceil n/2\rceil\) binary vectors of dimension \(n\) there is a binary vector \(z\) of dimension \(n\) such that the Hamming distance between \(z\) and \(a_ i\) is greater than \(k-i\) for \(i=1,\dots,k\). This result shows that the strategy of the lazy sender on the broadcast problem in the \(n\)-dimension cube with a sender is optimal.
0 references
Hamming distance
0 references
broadcast problem
0 references
\(n\)-dimension cube
0 references