Publication

Simple algorithms for BCH decoding

Martin Vetterli
1995
Journal Articles

Abstract

Proposes some simple algorithms for decoding BCH codes. The authors show that the pruned FFT is an effective method for evaluating syndromes and for finding the roots of error-locator polynomials. They show that a simple variation of the basic Gaussian elimination procedure can be adapted to compute the error-locator polynomial efficiently for codes with small designed distance. Finally, they give a procedure for computing the error values that has half the complexity of the Forney algorithm.

Official source

https://infoscience.epfl.ch/entities/publication/d16ed0fd-7042-469d-89c8-07da5eeda21e

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Martin Vetterli
1995
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/d16ed0fd-7042-469d-89c8-07da5eeda21e

About this result

Related concepts (32)

Error correction code

In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. The central idea is that the sender encodes the message in a redundant way, most often by using an error correction code or error correcting code (ECC). The redundancy allows the receiver not only to detect errors that may occur anywhere in the message, but often to correct a limited number of errors.

Polynomial code

In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length) that are divisible by a given fixed polynomial (of shorter length, called the generator polynomial). Fix a finite field , whose elements we call symbols. For the purposes of constructing polynomial codes, we identify a string of symbols with the polynomial Fix integers and let be some fixed polynomial of degree , called the generator polynomial.

Repetition code

In coding theory, the repetition code is one of the most basic linear error-correcting codes. In order to transmit a message over a noisy channel that may corrupt the transmission in a few places, the idea of the repetition code is to just repeat the message several times. The hope is that the channel corrupts only a minority of these repetitions. This way the receiver will notice that a transmission error occurred since the received data stream is not the repetition of a single message, and moreover, the receiver can recover the original message by looking at the received message in the data stream that occurs most often.

Related publications (30)

Simple algorithms for BCH decoding

Chat with Graph Search

Probabilistic Methods for Joint Eigenvalue Problems with Applications

FairTree: Subgroup Fairness Auditing of Machine Learning Models with Bias-Variance Decomposition

Decoding Product Codes with Belief Propagation