Sciweavers

4 search results - page 1 / 1
» Faster Algorithm for Designing Optimal Prefix-Free Codes wit...
Sort
View
DCC
2006
IEEE
13 years 8 months ago
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
Sorina Dumitrescu
ICC
1997
IEEE
162views Communications» more  ICC 1997»
13 years 9 months ago
Combined Source-Channel Coding for the Transmission of Still Images over a Code Division Multiple Access (CDMA) Channel
— This letter considers a combined source-channel coding scheme for image transmission over the uplink of a wireless IS-95 code division multiple access (CDMA) channel using disc...
E. V. H. Iun, Amir K. Khandani
BMCBI
2002
120views more  BMCBI 2002»
13 years 4 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam