Sciweavers

2621 search results - page 12 / 525
» Near orders and codes
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICIP
2007
IEEE
16 years 1 months ago
Inverse Bit Plane Decoding Order for Turbo Code Based Distributed Video Coding
For Turbo Code based Wyner-Ziv codecs, we propose to use an inverse bit plane decoding order. The investigations have shown that the knowledge about MSB's has only a marginal...
Jörn Ostermann, Sven Klomp, Yuri Vatis
ICC
2007
IEEE
15 years 6 months ago
A Space-Time Code Design for Partial-Response CPM: Diversity Order and Coding Gain
— Using a linear decomposition of continuous phase modulated (CPM) signals with tilted-phase, sufficient conditions are derived under which M-ary partial-response CPM spacetime ...
Alenka G. Zajic, Gordon L. Stüber
ICMCS
1999
IEEE
122views Multimedia» more  ICMCS 1999»
15 years 4 months ago
Tailored Transmissions for Efficient Near-Video-on-Demand Service
Near-Video-On-Demand (NVOD) entails the provision of viewing flexibility that approaches that of VOD to an unlimited number of viewers of a "hot" movie at afixed cost to...
Yitzhak Birk, Ron Mondri
AAECC
1997
Springer
113views Algorithms» more  AAECC 1997»
15 years 4 months ago
Order Functions and Evaluation Codes
Based on the notion of an order function we construct and determine the parameters of a class of error-correcting evaluation codes. This class includes the one-point algebraic geo...
Tom Høholdt, Jacobus H. van Lint, Ruud Pell...