Using Reed—Muller RM (1, m) Codes Over Channels With Synchronization and Substitution Errors.

Saved in:
Bibliographic Details
Title: Using Reed—Muller RM (1, m) Codes Over Channels With Synchronization and Substitution Errors.
Authors: Dolecek, Lara, Anantharam, Venkat
Source: IEEE Transactions on Information Theory; Apr2007, Vol. 53 Issue 4, p1430-1443, 14p, 1 Graph
Subject Terms: CODING theory, ERROR-correcting codes, DECODERS & decoding, ALGORITHMS, DECODERS (Electronics), SYNCHRONIZATION
Abstract: We analyze the performance of a Reed-Muller RM (1, m) code over a channel that, in addition to substitution errors, permits either the repetition of a single bit or the deletion of a single bit; the latter feature is used to model synchronization errors. We first analyze the run-length structure of this code. We enumerate all pairs of codewords that can result in the same sequence after the deletion of a single bit, and propose a simple way to prune the code by dropping one information bit such that the resulting linear subcode has good post-deletion and post-repetition minimum distance. A bounded distance decoding algorithm is provided for the use of this pruned code over the channel. This algorithm has the same order of complexity as the usual fast Hadamard transform based decoder for the RM (1, m) code. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Be the first to leave a comment!
You must be logged in first