Transmitting in the n-dimensional cube

Transmitting in the n-dimensional cube

0.00 Avg rating0 Votes
Article ID: iaor1993413
Country: Netherlands
Volume: 37/38
Issue: 1/5
Start Page Number: 9
End Page Number: 11
Publication Date: Jul 1992
Journal: Discrete Applied Mathematics
Authors:
Keywords: combinatorial analysis
Abstract:

Motivated by a certain communication problem the paper shows 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 a is strictly bigger than k-i for all 1•i•k.

Reviews

Required fields are marked *. Your email address will not be published.