Notes on coding theory
This note covers the following topics: The naive way of coding, Coding schemes for binary channels and Shannon theorem, Shannon theorem, Exponential growth rate, Binary codes, The Hamming bound and perfect codes, The Gilbert-Varshamov bound, Error probability estimations, Union bound for BER, State representations and trellises of general codes, Convolutional codes, Tanner graphs and factor graphs.
Author(s): Fabio Fagnani
NA Pages 
Programming Fundamentals by Kenneth Leroy Busbee
Kenneth Leroy Busbee and Dave Braunschweig's Programming Fundamentals is a book that offered readers a more solid foundation in programming concepts. The text covers the basic elements of programming systems: from data types to the operators and the functions, to control structures including the conditions and the loops, advanced elements such as arrays and strings processing files among others. The book focuses on object-oriented programming and brings out classes and objects. This material is widely used by students looking to develop a solid foundation of programming principles and practices-a growing emphasis on practical application and theoretical knowledge.
Author(s): Kenneth Leroy Busbee, Dave Braunschweig
424 Pages
Coding Theory and Applications
This book is meant for undergraduate students who wish to obtain a basic knowledge in coding theory based on the subject of linear codes. It begins with introductory chapters based on Shannon theory and relevant to coding, then advances to detailed discussions about decoding linear codes and the MacWilliams identity. Besides these, the construction of new codes and the attainment of bounds on code performance are subjects of discussion, and thus Reed-Muller codes prove very significant in this light. This book is an exposition of the practical coding theory applied in many fields: telecommunications to data storage. It focuses on fast decoding techniques and higher-order RM codes.
Author(s): Enes Pasalic
154 Pages
