Presentation Theorems for Coded Character Sets
Dele Oluwade
TL;DR
This paper applies group presentation concepts to coded character sets in digital networks, providing a new mathematical framework to describe and analyze CCSs like EBCDIC.
Contribution
It introduces a novel application of presentation theory from group mathematics to characterize coded character sets in digital communication.
Findings
Presented a group-theoretic framework for CCSs
Applied the framework to EBCDIC example
Enhanced understanding of CCS structure and interchangeability
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cellular Automata and Applications