ACM

Communications of the ACM

Home/Magazine Archive/June 1974 (Vol. 17, No. 6)/The minimization of spatially-multiplexed character.../Abstract

The minimization of spatially-multiplexed character sets

By James F. Gimpel
Communications of the ACM, June 1974, Vol. 17 No. 6, Pages 315-318
10.1145/355616.361019
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

The paper describes a technique for compacting character sets in a digital computer while retaining fast access to individual bits. It considers the problem of minimizing the storage needed to contain such tables. Reduction techniques are developed, and the problem is shown to reduce to a covering problem.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.