| 21. | It can be seen that the master sequence is not as dominant, however, sequences with low Hamming distance are in majority.
|
| 22. | Another special case, the closest string problem, arises when the inputs are strings and their distance is measured using Hamming distance.
|
| 23. | Since polynomial codes are linear codes, the minimum Hamming distance is equal to the minimum weight of any non-zero codeword.
|
| 24. | These codes are also known as " single-distance codes ", reflecting the Hamming distance of 1 between adjacent codes.
|
| 25. | This provides single-bit error " correction " ( a minimum Hamming distance of 3 ) whenever this code is transmitted.
|
| 26. | The cost ( number of moves ) to the goal ( an ordered puzzle ) is at least the Hamming distance of the puzzle.
|
| 27. | The Hamming distance between two codewords is used as a metric in finding the nearest codeword, given the received word by the decoder.
|
| 28. | They make it computationally infeasible two find two inputs, that are more than t Hamming distance apart and hash to the same value.
|
| 29. | As for all digital codes, the error detection and correction abilities of polynomial codes are determined by the minimum Hamming distance of the code.
|
| 30. | ;Dalal : the models of P having a minimal Hamming distance to models of K are selected to be the models that result from the change;
|
