Author |
Topic: MESSAGE RECONSTRUCTION (Read 1884 times) |
|
kapiwu
Newbie
Gender: 
Posts: 14
|
 |
MESSAGE RECONSTRUCTION
« on: Dec 9th, 2007, 9:54pm » |
 Quote  Modify
|
alice sends different partial messages to a bunch of different receivers. by partial, we mean that one message by itself doesn't convey any meaningful information. let us denote the set of receivers as R. the messages are designed such that if any n receivers get together, they can somehow pool their partial messages together to get a meaningful message -- alice's intended message. however, if any n-1 or less receivers get together, they can't reconstruct anything meaningful whatsoever. n < |R|. what kind of messages are being sent by alice, and what mathematical function do the receivers apply on their pooled partial data to determine the intended message?
.
I had tried to search this in the forum and net but not found. Can anybody tell the solution for the above?
|
|
 IP Logged |
|
|
|
towr
wu::riddles Moderator
Uberpuzzler
Some people are average, some are just mean.
Gender:
Posts: 13730
|
|
Re: MESSAGE RECONSTRUCTION
« Reply #1 on: Dec 10th, 2007, 1:29am » |
Quote Modify
|
It is on the forum in a different form, where they use locks and keys such that |R| people can together unlock the box/treasure/message/whatever, but fewer can't.
I don't recall the solution at the moment though.
|
|
IP Logged |
Wikipedia, Google, Mathworld, Integer sequence DB
|
|
|
|
RIDDLES SITE
WRITE MATH!
Home 
Help 
Search 
Members 
Login 
Register
Reply
Notify of replies
Send Topic
Print