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 
Introduction to Programming Lectures Notes
The lecture note covers programming concepts in detail with regard to the importance of beginners. The note compiles basic elements about objects, variables, and methods in relation to the significance of classes in object-oriented programming. Readers will learn about primitive data types, conditional and loop statements, and application of arrays and matrices in the management of data. Another aspect that the note focuses on is practical skills, such as file handling and error management, recursion, etc. What makes this resource absolute for beginning programmers is its clarity and structured approach.
Author(s): Prof. Diego Calvanese
NA 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
