High-density and Secure Data Transmission via Linear Combinations
| dc.creator | Grolmusz, Vince | |
| dc.date | 2003-07-17 | |
| dc.date.accessioned | 2026-07-07T03:20:04Z | |
| dc.date.available | 2026-07-07T03:20:04Z | |
| dc.description | Suppose that there are $n$ Senders and $n$ Receivers. Our goal is to send long messages from Sender $i$ to Receiver $i$ such that no other receiver can retrieve the message intended for Receiver $i$. The task can easily be completed using $n$ private channels between the pairs. Solutions, using one channel needs either encryption or switching elements for routing the messages to their addressee. The main result of the present work is a description of a network in which The Senders and the Receivers are connected with only $n^{o(1)}$ channels; the encoding and de-coding is nothing else just very fast linear combinations of the message-bits; and there are no switching or routing-elements in the network, just linear combinations are computed, with fixed connections (channels or wires). In the proofs we do not use {\em any} unproven cryptographical or complexity theoretical assumptions. | |
| dc.description | Preliminary version | |
| dc.identifier | https://arxiv.org/abs/cs/0307041 | |
| dc.identifier | http://arxiv.org/abs/cs/0307041 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31703 | |
| dc.subject | Computational Complexity | |
| dc.subject | Hardware Architecture | |
| dc.subject | F.1 | |
| dc.title | High-density and Secure Data Transmission via Linear Combinations | |
| dc.type | text |