|
03043180445
Tags: Mobile edit Mobile web edit
|
revert vandalism/test edits
|
||
Line 1:
In [[coding theory]], a '''block code''' is any member of the large and important family of [[Channel coding|error-correcting codes]]
There is a vast number of examples for block codes, many of which have a wide range of practical applications. Block codes are conceptually useful because they allow coding theorists, [[mathematics|mathematicians]], and [[computer science|computer scientists]] to study the limitations of ''all'' block codes in a unified way.
Such limitations often take the form of ''bounds'' that relate different parameters of the block code to each other, such as its rate and its ability to detect and correct errors.
Line 9:
The term ''block code'' may also refer to any error-correcting code that acts on a block of ''k'' bits of input data to produce ''n'' bits of output data (n,k). Consequently, the block coder is a ''memoryless'' device. Under this definition codes such as [[turbo code]]s, terminated convolutional codes and other iteratively decodable codes (turbo-like codes) would also be considered block codes. A non-terminated convolutional encoder would be an example of a non-block (unframed) code, which has ''memory'' and is instead classified as a ''tree code''.
This article deals with "algebraic block codes".
== The block code and its parameters ==
| |||