Presentation Theorems for Coded Character Sets
Dele Oluwade
Abstract
The notion of 'presentation', as used in combinatorial group theory, is applied to coded character sets(CCSs) - sets which facilitate the interchange of messages in a digital computer network(DCN) . By grouping each element of the set into two portions and using the idea of group presentation(whereby a group is specified by its set of generators and its set of relators), the presentation of a CCS is described. This is illustrated using the Extended Binary Coded Decimal Interchange Code(EBCDIC) which is one of the most popular CCSs in DCNs. Key words: Group presentation, coded character set, digital computer network
Create a lesson
Related papers
The Project Scheduling Interdiction Problem with Delay Groups
Fei Wu, Erik Demeulemeester, Jannik Matuschke
Rank-Three Projections and Minimal Multiplicity Bipartitions of Path Complements
Jintao Fei, Jiangying Luo
Faster FPRAS for the Permanent via Restricted Poincaré Inequalities and Coupled Flows
Xiaoyu Chen, Eric Vigoda, Xiongxin Yang
On identifying codes on oriented graphs
Soura Sena Das, Sagnik Sen
Parallelizable Gradient-Based Optimization For Multi-Objective MaxCut
Jingjuan Huang, Alvaro Velasquez, Jia Liu et al.
Algebraic Characterizations for Minors of Finite Graphs via Flow Transformation Monoid Division and Embedding
Amena Assem, Hanna Derets, Chrystopher L. Nehaniv