A general theory of codes, II: Paradigms and homomorphisms

1Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

When two competing paradigms bear on a single area of study, investigators have more choices at their disposal. This is not always an advantage. This paper, like its predecessor, adopts a paradigm for codes. This paradigm ignores the purposes which might have given rise to a code, the size of the code, or the arithmetic used in implementing the code. It concentrates solely on the (set-theoretic) structure of that code. Once adopted, this structure-oriented paradigm leads naturally to a theory of homomorphisms for the general theory of codes. Code homomorphisms satisfy the standard isomorphism theorems, respect certain important properties of codes, are compatible with products and quotients, and possess other desirable features. Thus, codes fit into general algebra alongside such familiar objects as groups, graphs and posets.

Cite

CITATION STYLE

APA

Blakley, G. R., & Borosh, I. (1998). A general theory of codes, II: Paradigms and homomorphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1396, pp. 1–31). Springer Verlag. https://doi.org/10.1007/bfb0030405

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free