Transmitting in the n-dimensional cube

Noga Alon

doi:10.1016/0166-218X(92)90121-P

Transmitting in the n-dimensional cube

Noga Alon

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

Motivated by a certain communication problem we show that for any integer n and for any sequence (a₁,...,a_k) of k = ⌈ n 2⌉ binary vectors of length n, there is a binary vector z of length n whose Hamming distance from a_i is strictly bigger than k-i for all 1 ≤ i ≤ k.

Original language	English (US)
Pages (from-to)	9-11
Number of pages	3
Journal	Discrete Applied Mathematics
Volume	37-38
Issue number	C
DOIs	https://doi.org/10.1016/0166-218X(92)90121-P
State	Published - Jul 15 1992
Externally published	Yes

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/0166-218X(92)90121-P

Cite this

@article{a6c8e9af03e64cf5b13aff47090b2a27,

title = "Transmitting in the n-dimensional cube",

abstract = "Motivated by a certain communication problem we show that for any integer n and for any sequence (a1,...,ak) of k = ⌈ n 2⌉ binary vectors of length n, there is a binary vector z of length n whose Hamming distance from ai is strictly bigger than k-i for all 1 ≤ i ≤ k.",

author = "Noga Alon",

year = "1992",

month = jul,

day = "15",

doi = "10.1016/0166-218X(92)90121-P",

language = "English (US)",

volume = "37-38",

pages = "9--11",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Transmitting in the n-dimensional cube

AU - Alon, Noga

PY - 1992/7/15

Y1 - 1992/7/15

N2 - Motivated by a certain communication problem we show that for any integer n and for any sequence (a1,...,ak) of k = ⌈ n 2⌉ binary vectors of length n, there is a binary vector z of length n whose Hamming distance from ai is strictly bigger than k-i for all 1 ≤ i ≤ k.

AB - Motivated by a certain communication problem we show that for any integer n and for any sequence (a1,...,ak) of k = ⌈ n 2⌉ binary vectors of length n, there is a binary vector z of length n whose Hamming distance from ai is strictly bigger than k-i for all 1 ≤ i ≤ k.

UR - http://www.scopus.com/inward/record.url?scp=38249013075&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249013075&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(92)90121-P

DO - 10.1016/0166-218X(92)90121-P

M3 - Article

AN - SCOPUS:38249013075

SN - 0166-218X

VL - 37-38

SP - 9

EP - 11

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - C

ER -

Transmitting in the n-dimensional cube

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this