Content deleted Content added
→Lower and upper bounds of block codes: Per MOS:LINKSTYLE: move links out of section headers, use Template:Main article instead. |
03170806664 Tags: Mobile edit Mobile web edit |
||
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".Ti
== The block code and its parameters ==
| |||