The Reduction of Scans in the Minimization of Dictionary Codes,
Abstract
The paper considers a problem that arose in the course of computer implementation of a letter compression method for dictionary contraction. For obtaining letter convolutions of a minimal length the minimum of a function defined on a tree must be found. The properties of this function are described and methods for the solution of the problem offered. In Chapter 1, three problems are considered by way of example which are reduced to the problem of minimizing the function over the tree. Chapter 2, gives a formal statement of the problem and reduces it to the problem of minimizing the function over a tree. Chapter 3 describes the general algorithm of moving along the tree which is very similar to the programme of scanning the branching alternatives described. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 29, 1971
- Accession Number
- AD0734991
Entities
People
- L. M. Frid
Organizations
- National Air and Space Intelligence Center