Sciweavers

2961 search results - page 21 / 593
» Optimization of tele-immersion codes
Sort
View
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 8 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
ICC
2007
IEEE
14 years 2 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
ICASSP
2011
IEEE
12 years 11 months ago
Reusing the H.264/AVC deblocking filter for efficient spatio-temporal prediction in video coding
The prediction step is a very important part of hybrid video codecs for effectively compressing video sequences. While existing video codecs predict either in temporal or in spati...
Jürgen Seiler, André Kaup
ICCS
2009
Springer
14 years 2 months ago
Generating Empirically Optimized Composed Matrix Kernels from MATLAB Prototypes
The development of optimized codes is time-consuming and requires extensive architecture, compiler, and language expertise, therefore, computational scientists are often forced to ...
Boyana Norris, Albert Hartono, Elizabeth R. Jessup...
CORR
2004
Springer
76views Education» more  CORR 2004»
13 years 7 months ago
Improved Upper Bound for the Redundancy of Fix-Free Codes
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...
Sergey Yekhanin