Listing 1 - 10 of 123 | << page >> |
Sort by
|
Choose an application
Proefschriften --- Thèses --- Academic collection --- 681.3*I42 --- #BIBC:T1996 --- Compression (coding): approximate methods; exact coding (Image processing)--See also {681.3*E4} --- Theses --- 681.3*I42 Compression (coding): approximate methods; exact coding (Image processing)--See also {681.3*E4}
Choose an application
Choose an application
Management information systems --- Mathematical models --- 681.3*H11 --- Systems and information theory: value of information--See also {681.3*E4} --- 681.3*H11 Systems and information theory: value of information--See also {681.3*E4} --- Management information systems - Mathematical models
Choose an application
Choose an application
Choose an application
The need to transmit and store massive amounts of data reliably and without error is a vital part of modern communications systems. Error-correcting codes play a fundamental role in minimising data corruption caused by defects such as noise, interference, crosstalk and packet loss. This book provides an accessible introduction to the basic elements of algebraic codes, and discusses their use in a variety of applications. The author describes a range of important coding techniques, including Reed-Solomon codes, BCH codes, trellis codes, and turbocodes. Throughout the book, mathematical theory is illustrated by reference to many practical examples. The book was first published in 2003 and is aimed at graduate students of electrical and computer engineering, and at practising engineers whose work involves communications or signal processing.
Data transmission systems --- Signal processing --- Data communication systems --- Transmission of data --- Digital communications --- Electronic data processing --- Electronic systems --- Information theory --- Telecommunication systems --- Mathematical models. --- Mathematics. --- Data transmission systems - Mathematical models --- Signal processing - Mathematics --- 681.3*E4 --- 681.3*I42 --- 681.3*I42 Compression (coding): approximate methods; exact coding (Image processing)--See also {681.3*E4} --- Compression (coding): approximate methods; exact coding (Image processing)--See also {681.3*E4} --- 681.3*E4 Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- Mathematical models --- Mathematics
Choose an application
Mathematical control systems --- Coding theory --- 681.3*E4 --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- 681.3*E4 Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11}
Choose an application
These lecture notes are the contents of a two-term course given by me during the 1970-1971 academic year as Morgan Ward visiting professor at the California Institute of Technology. The students who took the course were mathematics seniors and graduate students. Therefore a thorough knowledge of algebra. (a. o. linear algebra, theory of finite fields, characters of abelian groups) and also probability theory were assumed. After introducing coding theory and linear codes these notes concern topics mostly from algebraic coding theory. The practical side of the subject, e. g. circuitry, is not included. Some topics which one would like to include 1n a course for students of mathematics such as bounds on the information rate of codes and many connections between combinatorial mathematics and coding theory could not be treated due to lack of time. For an extension of the course into a third term these two topics would have been chosen. Although the material for this course came from many sources there are three which contributed heavily and which were used as suggested reading material for the students. These are W. W. Peterson's Error-Correcting Codes «(15]), E. R. Berlekamp's Algebraic Coding Theory «(5]) and several of the AFCRL-reports by E. F. Assmus, H. F. Mattson and R. Turyn ([2], (3), [4] a. o. ). For several fruitful discussions I would like to thank R. J. McEliece.
Mathematical control systems --- 519.7 --- 681.3*E4 --- Mathematical cybernetics --- Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- Coding theory. --- 681.3*E4 Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- 519.7 Mathematical cybernetics
Choose an application
Mathematical control systems --- Information theory --- 519.7 --- 681.3*E4 --- Mathematical cybernetics --- Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- 681.3*E4 Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- 519.7 Mathematical cybernetics --- Communication theory --- Communication --- Cybernetics
Choose an application
Ergodic theory. Information theory --- 519.7 --- 681.3*E4 --- Mathematical cybernetics --- Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- 681.3*E4 Coding and information theory: data compaction and compression; formal modelsof communication; nonsecret encoding schemes--See also {681.3*H11} --- 519.7 Mathematical cybernetics
Listing 1 - 10 of 123 | << page >> |
Sort by
|