BINARY SYNCHRONOUS TRANSMISSION

Domain	Definition
Computing	Binary Synchronous Transmission (Bisynch) An IBM link protocol, developed in the 1960 and popular in the 1970s and 1980s. Binary Synchronous Transmission has been largely replaced in IBM environments with SDLC. Bisync was developed for batch communications between a System 360 computer and the IBM 2780 and 3780 Remote Job Entry (RJE) terminals. It supports RJE and on-line terminals in the CICS/VSE environment. It operates with EBCDIC or ASCII character sets. It requires that every message be acknowledged (ACK) or negatively acknowledged (NACK) so it has high transmission overhead. It is typically character oriented and half-duplex, although some of the bisync protocol flavours or dialects support binary transmission and full-duplex operation. (1997-01-07). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Specialty Definition: Binary Synchronous Transmission

Binary Synchronous Transmission (Bisynch) is an IBM link protocol, developed in the 1960 and popular in the 1970s and 1980s.

Binary Synchronous Transmission has been largely replaced in IBM environments with SDLC. Bisync was developed for batch communications between a System 360 mainframe and the IBM 2780 and IBM 3780 Remote Job Entry (RJE) terminals. It supports RJE and on-line terminals in the CICS/VSE environment. It operates with EBCDIC or ASCII character sets. It requires that every message be acknowledged (ACK) or negatively acknowledged (NACK) so it has high transmission overhead. It is typically character oriented and half-duplex, although some of the bisync protocol flavours or dialects support binary transmission and full-duplex operation. Based on material from FOLDOC, used with permission. Update as needed.

Alternative Orthography: BINARY SYNCHRONOUS TRANSMISSION

Hexadecimal (or equivalents, 770AD-1900s) (references)

42 49 4E 41 52 59 53 59 4E 43 48 52 4F 4E 4F 55 53 54 52 41 4E 53 4D 49 53 53 49 4F 4E

Leonardo da Vinci (1452-1519; backwards) (references)

Binary Code (1918-1938, probably earlier) (references)

01000010 01001001 01001110 01000001 01010010 01011001 00100000 01010011 01011001 01001110 01000011 01001000 01010010 01001111 01001110 01001111 01010101 01010011 00100000 01010100 01010010 01000001 01001110 01010011 01001101 01001001 01010011 01010011 01001001 01001111 01001110

HTML Code (1990) (references)

&#66 &#73 &#78 &#65 &#82 &#89 &#32 &#83 &#89 &#78 &#67 &#72 &#82 &#79 &#78 &#79 &#85 &#83 &#32 &#84 &#82 &#65 &#78 &#83 &#77 &#73 &#83 &#83 &#73 &#79 &#78

ISO 10646 (1991-1993) (references)

0042 0049 004E 0041 0052 0059 0053 0059 004E 0043 0048 0052 004F 004E 004F 0055 0053 0054 0052 0041 004E 0053 004D 0049 0053 0053 0049 004F 004E

Encryption (beginner's substitution cypher): (references)

BINARY SYNCHRONOUS TRANSMISSION

Specialty Definition: BINARY SYNCHRONOUS TRANSMISSION

Computing

Specialty Definition: Binary Synchronous Transmission

Crosswords: BINARY SYNCHRONOUS TRANSMISSION

Alternative Orthography: BINARY SYNCHRONOUS TRANSMISSION

42 49 4E 41 52 59 53 59 4E 43 48 52 4F 4E 4F 55 53 54 52 41 4E 53 4D 49 53 53 49 4F 4E

01000010 01001001 01001110 01000001 01010010 01011001 00100000 01010011 01011001 01001110 01000011 01001000 01010010 01001111 01001110 01001111 01010101 01010011 00100000 01010100 01010010 01000001 01001110 01010011 01001101 01001001 01010011 01010011 01001001 01001111 01001110

&#66 &#73 &#78 &#65 &#82 &#89 &#32 &#83 &#89 &#78 &#67 &#72 &#82 &#79 &#78 &#79 &#85 &#83 &#32 &#84 &#82 &#65 &#78 &#83 &#77 &#73 &#83 &#83 &#73 &#79 &#78

0042 0049 004E 0041 0052 0059 0053 0059 004E 0043 0048 0052 004F 004E 004F 0055 0053 0054 0052 0041 004E 0053 004D 0049 0053 0053 0049 004F 004E

364348355259253594837425249484955532545235485347435353434948

INDEX