Content deleted Content added
No edit summary Tags: Mobile edit Mobile web edit |
Revert to revision 898640070 dated 2019-05-25 00:00:31 by Harry- using popups |
||
Line 7:
Algebraic block codes are typically [[Soft-decision decoder|hard-decoded]] using algebraic decoders.{{Technical statement|date=May 2015}}
The term ''block code'' may also refer to any error-correcting code that acts on a block of <math>k</math> bits of input data to produce <math>n</math> bits of output data <math>(n,k)</math>. 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".
| |||