Sciweavers

2572 search results - page 72 / 515
» codes 2008
Sort
View
113
Voted
TIP
1998
113views more  TIP 1998»
15 years 3 months ago
Best neighborhood matching: an information loss restoration technique for block-based image coding systems
—Imperfect transmission of block-coded images often results in lost blocks. A novel error concealment method called best neighborhood matching (BNM) is presented by using a speci...
Zhou Wang, Yinglin Yu, David Zhang
116
Voted
ICSEA
2008
IEEE
15 years 10 months ago
Reuse through Requirements Traceability
The Reuse of code artefacts can make development quicker, cheaper and more robust, but the process is complex and has many pitfalls: Code artefacts must exist, be available, be fo...
Rob Pooley, Craig Warren
120
Voted
GEM
2008
15 years 4 months ago
Better Huffman Coding via Genetic Algorithm
Abstract--We present an approach to compress arbitrary files using a Huffman-like prefix-free code generated through the use of a genetic algorithm, thus requiring no prior knowled...
Cody Boisclair, Markus Wagner
DM
1999
61views more  DM 1999»
15 years 3 months ago
Some codes related to BCH-codes of low dimension
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X a...
Yves Edel, Jürgen Bierbrauer
97
Voted
TVLSI
2002
134views more  TVLSI 2002»
15 years 3 months ago
Theoretical analysis of bus-invert coding
Theoretical analysis of bus-invert coding for reducing switching activity was previously investigated. In this paper we conduct a theoretical analysis of this method for coupling r...
Rung-Bin Lin, Chi-Ming Tsai