Presentation Theorems for Coded Character Sets

Details Presentation Theorems for Coded Character Sets Presentation Theorems for Coded Character Sets

2006-10-30

arxiv.org/abs/cs/0610168v1

Computer Science

Discrete Mathematics

14 pages, including a page of symbols and a page containing a table

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Presentation Theorems for Coded Character Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Presentation Theorems for Coded Character Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Presentation Theorems for Coded Character Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-230348