|
|||||
|
|
Golay code and random packing |
|
| Authors: | Yoshiaki Itoh |
| Abstract: | Summary A random sequential packing by Hamming distance is applied to study Golay code. The probability of getting Golay code is estimated by computer simulation. A histogram of number of packed points is given to show the existence of several remarkable clusters. The Institute of Statistical Mathematics |
| Keywords: | Random sequential packing Hamming distance stochastic algorithm Golay binary code clusters of histogram |
| 本文献已被 SpringerLink 等数据库收录！ | |