Random Sequential Coding by Hamming Distance

摘要

Simple cubic random packing and random packing by Hamming distance are analyzed. Consider the packing density gamma sub d of dimension d by cubic random packing. From simulations up to dimension 11, gamma sub d + 1/gamma sub d seems to approach one. Simulation results for random packing by Hamming distance are obtained. For the case of Hamming distances of 2 or 3, d-gamma fits the simulation results of packing density where gamma is an empirical constant. (Author)