Sciweavers

2658 search results - page 41 / 532
» On efficient balanced codes
Sort
View
ICASSP
2011
IEEE
13 years 26 days ago
On efficient soft-input soft-output encoding of convolutional codes
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
Andreas Winkelbauer, Gerald Matz
ICICS
2010
Springer
13 years 7 months ago
Efficient Authentication for Mobile and Pervasive Computing
With today's technology, many applications rely on the existence of small devices that can exchange information and form communication networks. In a significant portion of su...
Basel Alomair, Radha Poovendran
SENSYS
2004
ACM
14 years 2 months ago
Power - time optimal algorithm for computing FFT over sensor networks
bstract: Power - Time Optimal Algorithm for Computing FFT over Sensor Networks Categories and Subject Descriptors C.2.1 [Network Architecture and Design] Wireless Communication, Di...
Turkmen Canli, Mark Terwilliger, Ajay K. Gupta, As...
ICIP
2003
IEEE
14 years 10 months ago
Product code error protection of packetized multimedia bitstreams
Sherwood and Zeger proposed a source-channel coding system where the source code is an embedded bitstream and the channel code is a product code such that each row code is a conca...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
CORR
2008
Springer
80views Education» more  CORR 2008»
13 years 9 months ago
Reserved-Length Prefix Coding
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
Michael B. Baer