Generalized linear threshold scheme
Proceedings of CRYPTO 84 on Advances in cryptology
Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Communications of the ACM
Discrete Linear Control: The Polynomial Equation Approach
Discrete Linear Control: The Polynomial Equation Approach
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
A Reliable Chunkless Peer-to-Peer Architecture for Multimedia Streaming
DCC '08 Proceedings of the Data Compression Conference
Peer-to-Peer File Sharing Based on Network Coding
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
IEEE Transactions on Information Theory
An efficient algorithm to find lattice chains
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
Some peer-to-peer streaming systemsmake use of linear codes to reduce the rate of the data uploaded by peers with limited upload capabilities. Such "data reduction" techniques are based on a vector-space approach and produce the data to be uploaded bymeans of linear combinations of the content data in a suitable finite field. In this paper, we propose a more general approach based on group theory. The new approach, while including the vector space approach as a special case, allows to design schemes that cannot be modeled as linear codes. We analyze the properties of the schemes based on the new approach, showing also how a group-based scheme can be used to prevent stream poisoning and how a group-based scheme can be converted into a secret-sharing scheme. Examples of group-based schemes that cannot be described in the vector-space framework are also shown.