Okada et al., 2003 - Google Patents
A new delta compression algorithm suitable for program updating in embedded systemsOkada et al., 2003
- Document ID
- 17967841893297085326
- Author
- Okada Y
- Terazono K
- Publication year
- Publication venue
- Data Compression Conference, 2003. Proceedings. DCC 2003
External Links
Snippet
Summary form only given. A new delta compression algorithm most suitable for RISC binary programs of embedded systems is presented. Conventional delta algorithms are mainly suitable for character codes. These codes compact only the same strings found in both the …
- 238000007906 compression 0 title abstract description 5
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/21—Text processing
- G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30861—Retrieval from the Internet, e.g. browsers
- G06F17/30899—Browsing optimisation
- G06F17/30905—Optimising the visualization of content, e.g. distillation of HTML documents
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Boldi et al. | The webgraph framework ii: Codes for the world-wide web | |
| Sendrier et al. | On the computation of the automorphism group of a linear code | |
| Mitran et al. | Turbo source coding: A noise-robust approach to data compression | |
| Prakash et al. | A simple and fast scheme for code compression for VLIW processors | |
| Okada et al. | A new delta compression algorithm suitable for program updating in embedded systems | |
| Tjalkens et al. | A context-tree weighting method for text generating sources | |
| Barbulescu et al. | Interleaver design for three dimensional turbo codes | |
| Adiego et al. | Merging prediction by partial matching with structural contexts model | |
| Nielsen et al. | MST for lossy compression of image sets | |
| Dawy et al. | Implementing the context tree weighting method for content recognition | |
| Zhou et al. | Chaotic turbo codes in secure communication | |
| Jacobson | Random access in huffman-coded files | |
| Van Eupen | Five new optimal ternary linear codes | |
| Feng et al. | Network source coding using entropy constrained dithered quantization | |
| Nagy et al. | Experimental study of a binary block sorting compression scheme | |
| Mertz | The multicovering radii of linear codes with 1-covering radius one | |
| Tjalkens et al. | Variable-to-fixed length codes: A geometrical approach to low-complexity source codes | |
| Frey et al. | Concurrent turbo-decoding | |
| Kobayashi et al. | Enumerative coding for k-ary trees | |
| Desoky et al. | Compression of text and binary files using adaptive Huffman coding techniques | |
| Voronov et al. | The redundancy of successive refinement codes and codes with side information | |
| Orpaz et al. | Pattern matching by means of multi-resolution compression | |
| Withers | The ELS-coder: a rapid entropy coder | |
| Shields | Finite-state coding of individual sequences | |
| Berrou et al. | Multidimensional turbo codes |