Transmitting in the \(n\)-dimensional cube (Q1199408): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Noga Alon / rank | |||
Property / author | |||
Property / author: Noga Alon / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ``Integer-making'' theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Balancing matrices with line shifts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3899809 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)90121-p / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2030639873 / rank | |||
Normal rank |
Latest revision as of 10:25, 30 July 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