Sciweavers

3852 search results - page 195 / 771
» Construction of Codes for Network Coding
Sort
View
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 6 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff
TIT
2008
115views more  TIT 2008»
15 years 4 months ago
Affine Reflection Group Codes
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
Terasan Niyomsataya, Ali Miri, Monica Nevins
SIGCOMM
1996
ACM
15 years 8 months ago
DPF: Fast, Flexible Message Demultiplexing Using Dynamic Code Generation
Fast and flexible message demultiplexing are well-established goals in the networking community [1, 18, 22]. Currently, however, network architects have had to sacrifice one for t...
Dawson R. Engler, M. Frans Kaashoek
ICMCS
2006
IEEE
149views Multimedia» more  ICMCS 2006»
15 years 10 months ago
Authenticating Multimedia Transmitted Over Wireless Networks: A Content-Aware Stream-Level Approach
We propose in this paper a novel content-aware stream-level approach to authenticating multimedia data transmitted over wireless networks. The proposed approach is fundamentally d...
Zhi Li, Yong Lian, Qibin Sun, Chang Chen
ICDAR
2003
IEEE
15 years 9 months ago
Bayesian Network Modeling of Hangul Characters for On-line Handwriting Recognition
In this paper, we propose a Bayesian network framework for explicitly modeling components and their relationships of Korean Hangul characters. A Hangul character is modeled with h...
Sung-Jung Cho, Jin Hyung Kim