| 21. | In general, most prefix codes for integers assign longer codewords to larger integers.
|
| 22. | Here all codewords must have the same length.
|
| 23. | Note that the rate may vary between codewords.
|
| 24. | The recommended number of check words is 23 % of symbol capacity plus 3 codewords.
|
| 25. | More than that and it's easily cracked with the short list of codewords.
|
| 26. | Now let C denote the ( finite ) set of codewords in the given code.
|
| 27. | This proves that C is equidistant since all codewords have the same weight as A.
|
| 28. | Let X ^ n and Y ^ n be the codewords and received codewords, respectively.
|
| 29. | Let X ^ n and Y ^ n be the codewords and received codewords, respectively.
|
| 30. | The actual choice of mapping plays a major role in secondary structure formations in the codewords.
|
