Error-Correction Coding and Decoding

Abstract

adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this book are included in the book's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the book's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Multilevel High-Rate Coding With Twofold Concatenation for IoTs in Wireless Mesh Networks

“…Long codes can decrease the probability of error and it can help with both soft and hard decision decoding. Therefore, the concatenation method is used to construct long codes that can be decoded with less complexity [39], [40]. Multilevel concatenated codes with large minimum CGD can be designed easily by choosing appropriate binary block codes.…”

A Flexible Navigation Support System for a Team of Underwater Robots

“…We attempted two separate approaches to do so. First, we implemented Hamming (8,4) error correcting code [17], which encodes 4 bits of data into a packet of 8 bits by adding 4 parity bits. It can detect up to two bit errors or correct a single bit error.…”

On the error-correcting capabilities of iterative error correction codes

“…4. The minimum distance of algebraic LDPC codes is usually higher than random LDPC codes [15]. The minimum distance of regular LDPC codes approaches the distance of the best random linear codes [16].…”

“…There are new positions added in both extreme windows at the fourth iteration: z 25 andz 8 . At the fifth iteration, there are new positions in both extreme windows: z 18 and z 15 . Here permutations lead to the source codeword.…”

“…The iteratively decoded cyclic (15,11)-code given in [11] gives possibility to correct 40 % of triple errors. It is necessary to increase the check word to digit 7 to increase error-correcting capabilities to 100 %.…”