Skip to Main Content
Advances in Visual Data Compression and Communication
book

Advances in Visual Data Compression and Communication

by Feng Wu
July 2014
Intermediate to advanced content levelIntermediate to advanced
513 pages
16h 40m
English
Auerbach Publications
Content preview from Advances in Visual Data Compression and Communication
i
i
i
i
i
i
i
i
52 3 Communication
codes, they were independently rediscovered by MacKay et al. [17]. Because of the
simple structure, they have been the focus of many theoretical analyses. They have
been proven to be capable of approaching the Shannon limit more closely than any
other class of codes.
Similar to Hamming codes, LDPC codes are linear block codes. They can be rep-
resented as (n,k) codes, where n is the code length and k is the information dimen-
sion. Here we consider binary LDPC codes only. For a LDPC code (n, k), the source
is a k ×1 vector and a codeword is a n ×1 vector. The generator matrix G is n×k and
the parity check matrix H is m×n, where m = nk. The LDPC code can be specified
by the parity check matrix H. Before we discuss how to
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

The Magic of Computer Graphics

The Magic of Computer Graphics

Noriko Kurachi

Publisher Resources

ISBN: 9781482234138