Content deleted Content added
+ A[n,d] |
information rate |
||
Line 10:
===A[n,d]===
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 distance]] d) maximise the total amount of codewords. A[n,d] is the maximum number of codewords for a given codeword length n and Hamming distance d.
===Information rate===
When <math>C</math> is a binary blockcode, 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>.
| |||