Sciweavers

2658 search results - page 1 / 532
» On efficient balanced codes
Sort
View
ACM
1987
13 years 8 months ago
On efficient balanced codes
Balanced codes have the property that no codeword is "contained" in another.This property makes balanced codes attractive for certain applications, such as the encoding ...
Guan Jiwen, Victor R. Lesser
JSAC
2010
132views more  JSAC 2010»
13 years 2 days ago
Very Efficient Balanced Codes
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated...
K. Schouhamer Immink, J. Weber
ADHOC
2008
122views more  ADHOC 2008»
13 years 5 months ago
Balancing computation and communication costs: The case for hybrid execution in sensor networks
Virtual machines (VM) are promising as system software in sensor networks. A major impediment to their widespread acceptance is their performance overhead. Compiling VM bytecode to...
Joel Koshy, Ingwar Wirjawan, Raju Pandey, Yann Ram...

Book
2145views
15 years 3 months ago
An Introduction to Binary Search Trees and Balanced Trees
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This book provides an introduction to binary tree techniques and presents all of Libavl’s ...
Ben Pfaff
GPC
2009
Springer
13 years 12 months ago
Efficient Parallelized Network Coding for P2P File Sharing Applications
In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that net...
Karam Park, Joon-Sang Park, Won Woo Ro