skip to main content
article
Free Access

Transparent-mode control procedures for data communication, using the American standard code for information interchange—a tutorial

Published:01 April 1965Publication History
Skip Abstract Section

Abstract

This paper gives the considerations of Task Group X3.3.4 in the area of transparent-mode data communication control philosophy. The appearance of this paper was forecast (under the name of “second-level control”) in the earlier tutorial paper, “Control Procedures for Data Communications,” Task Group document X3.3.4.44, dated May 1964.

The present paper elaborates upon solutions to the problems of transparency to the basic ASCII communication control characters, as outlined in the previous paper mentioned above. Moreover, it goes on to cover the additional control problems of handling material such as offline encrypted data or non-ASCII codes by means of systems providing complete character transparency. It does not cover concepts of transparency in which the normal character structure or modulation rate of a system may be abandoned.

In conjunction with the earlier tutorial paper, this paper is expected to lead to a proposal for standardization of data communication control procedures using the American Standard Code for Information Interchange.

Index Terms

  1. Transparent-mode control procedures for data communication, using the American standard code for information interchange—a tutorial

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image Communications of the ACM
                Communications of the ACM  Volume 8, Issue 4
                April 1965
                63 pages
                ISSN:0001-0782
                EISSN:1557-7317
                DOI:10.1145/363831
                Issue’s Table of Contents

                Copyright © 1965 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 April 1965

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • article
              • Article Metrics

                • Downloads (Last 12 months)25
                • Downloads (Last 6 weeks)3

                Other Metrics

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader