Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Fundamentals of Codes, Graphs, and Iterative Decoding, Stephen B. Wicker; Saejoon Kim


Варианты приобретения
Цена: 13060.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Stephen B. Wicker; Saejoon Kim
Название:  Fundamentals of Codes, Graphs, and Iterative Decoding
ISBN: 9781475778250
Издательство: Springer
Классификация: ISBN-10: 1475778252
Обложка/Формат: Soft cover
Страницы: 224
Вес: 0.35 кг.
Дата издания: 26.04.2013
Серия: The Springer International Series in Engineering and Computer Science
Язык: English
Размер: 234 x 156 x 13
Читательская аудитория: Science
Основная тема: Electrical Engineering
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Fundamentals of Codes, Graphs, and Iterative Decoding contains need-to-know information for both professionals and academicians working in the field of communications.
Fifty years of learning how to design good codes can now be reduced to a single sentence: Good codes have a high degree of local connectivity, but must have simple structural descriptions to facilitate iterative decoding.
Fundamentals of Codes, Graphs, and Iterative Decoding is an explanation of how to introduce local connectivity, and how to exploit simple structural descriptions. Chapter 1 provides an overview of Shannon theory and the basic tools of complexity theory, communication theory, and bounds on code construction. Chapters 2 - 4 provide an overview of classical error control coding, with an introduction to abstract algebra, and block and convolutional codes. Chapters 5 - 9 then proceed to systematically develop the key research results of the 1990s and early 2000s with an introduction to graph theory, followed by chapters on algorithms on graphs, turbo error control, low density parity check codes, and low density generator codes.
Fundamentals of Codes, Graphs, and Iterative Decoding is intended as a synthesis of recent research results with a recognition of where these results fit into the bigger picture of error control coding.
Containing hundreds of theorems, proofs, and definitions, Fundamentals of Codes, Graphs, and Iterative Decoding is suitable for a graduate-level course in communications, as well as for a professional reference.



Iterative Methods in Combinatorial Optimization

Автор: Lau
Название: Iterative Methods in Combinatorial Optimization
ISBN: 1107007518 ISBN-13(EAN): 9781107007512
Издательство: Cambridge Academ
Рейтинг:
Цена: 12830.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows.

Iterative Solution of Large Sparse Systems of Equations

Автор: Hackbusch
Название: Iterative Solution of Large Sparse Systems of Equations
ISBN: 3319284819 ISBN-13(EAN): 9783319284811
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature.
The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms.
The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.

ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия