|
copy edits, recat, etc.
|
→Information rate: indent the equations
|
||
| Line 14: | Line 14: | ||
==Information rate== |
==Information rate== |
||
When <math>C</math> is a binary block code, consisting of <math>A</math> codewords of length ''n'' bits, then the information rate of <math>C</math> is defined as: |
When <math>C</math> is a binary block code, consisting of <math>A</math> codewords of length ''n'' bits, then the information rate of <math>C</math> is defined as |
||
|
|||
:<math>\frac{\!^{2}log(A)}{n}</math>. |
|||
|
|||
When f.i. the first ''k'' bits of a codeword are independent informationbits, then the information rate is |
|||
|
|||
:<math>\frac{\!^{2}log(2^k)}{n}=\frac{k}{n}</math>. |
|||
[[Category:Coding theory]] |
[[Category:Coding theory]] |
||
Incomputer science, a block code is a type of channel coding. It adds redundancy to a message so that, at the receiver, one can decode with minimal (theoretically zero) errors, provided that the information rate (amount of transported informationinbits per sec) would not exceed the channel capacity.
The main characterisation of a block code is that it is a fixed length channel code (unlike source coding schemes such as Huffman coding, and unlike channel coding methods like convolutional encoding). Typically, a block code takes a k-digit information word, and transforms this into an n-digit codeword.
Block coding was the primary type of channel coding used in earlier mobile communication systems.
A block code is a code which encodes strings formed from an alphabet set 
.The trade-off between efficiency (large informationrate) and correction capabilities can also be seen from the attempt to, given a fixed codeword length and a fixed correction capability (represented by the Hamming distanced) maximize the total amount of codewords. A[n,d] is the maximum number of codewords for a given codeword length n and Hamming distance d.
When 
.When f.i. the first k bits of a codeword are independent informationbits, then the information rate is
.
