株式会社極東書店トップ > 商品一覧 > Source Coding Theory. Softcover reprint of the original 1st ed. 1990
商品詳細
Source Coding Theory. Softcover reprint of the original 1st ed. 1990
・ISBN 978-1-4612-8907-4 paper EUR 49.99
¥13,361.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Gray, Robert M., |
|---|---|
| シリーズ | (The Springer International Series in Engineering and Computer Science) |
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2011 |
| ページ数 | 188 pp. |
| 言語 | ENG |
| ニュース番号 | <A05-27810> |
解説
Source coding theory has as its goal the characterization of the optimal performance achievable in idealized communication systems which must code an information source for transmission over a digital communication or storage channel for transmission to a user. The user must decode the information into a form that is a good approximation to the original. A code is optimal within some class if it achieves the best possible fidelity given whatever constraints are imposed on the code by the available channel. In theory, the primary constraint imposed on a code by the channel is its rate or resolution, the number of bits per second or per input symbol that it can transmit from sender to receiver. In the real world, complexity may be as important as rate. The origins and the basic form of much of the theory date from Shan- non's classical development of noiseless source coding and source coding subject to a fidelity criterion (also called rate-distortion theory) [73] [74]. Shannon combined a probabilistic notion of information with limit theo- rems from ergodic theory and a random coding technique to describe the optimal performance of systems with a constrained rate but with uncon- strained complexity and delay. An alternative approach called asymptotic or high rate quantization theory based on different techniques and approx- imations was introduced by Bennett at approximately the same time [4]. This approach constrained the delay but allowed the rate to grow large.