Presentation Theorems for Coded Character Sets

Simple item page
dc.creatorOluwade, Dele
dc.date2006-10-30
dc.date.accessioned2026-07-07T07:27:56Z
dc.date.available2026-07-07T07:27:56Z
dc.descriptionThe 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
dc.description14 pages, including a page of symbols and a page containing a table
dc.identifierhttps://arxiv.org/abs/cs/0610168
dc.identifierhttp://arxiv.org/abs/cs/0610168
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117554
dc.subjectDiscrete Mathematics
dc.subjectG.2.0; E.4; I.1.1
dc.titlePresentation Theorems for Coded Character Sets
dc.typetext

Files

Collections

arXiv