Foundations of Coding is a senior graduate level text as well as a professional reference on the mathematical foundation of coding theory. The book focuses on the algebraic constructions of error-correcting and optimal or secret codes, as well as cyclic codes, BCH codes, convolutional codes, performance of codes, cryptography and data compression. Although the exposition is rigourous, the book emphasizes the implementation of codes.

The concepts of a locally presentable category and an accessible category are extremely useful in formulating connections between universal algebra, model theory, logic, and computer science. The aim of this book is to provide an exposition of both the theory and the applications of these categories at a level accessible to graduate students. The concepts of lambda-presentable objects, locally lambda-presentable categories, and lambda-accessible categories are discussed in detail. The authors prove that Freyd's essentially algebraic categories are precisely the locally presentable categories....

Monograph( based very largely upon results original to the Czechoslovakian authors) presents an abstract account of the theory of automata for sophisticated readers presumed to be already conversant in the language of category theory. The seven chapters are punctuated at frequent intervals by exampl