Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-26T19:42:08.470Z Has data issue: false hasContentIssue false
  • English
  • Français

Packing densities of randomly constructed codes

Published online by Cambridge University Press:  14 July 2016

Clifton Sutton
Clifton Sutton*
Affiliation:
George Mason University
*
∗Postal address: George Mason University, Operations Research and Applied Statistics, 4400 University Dr., Fairfax, VA 22030, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Codes having all pairs of words separated by a Hamming distance of at least d are stochastically constructed by sequentially packing randomly generated q-ary n-tuples. Estimates of the random packing densities are obtained by repeated simulation. Using non-linear regression to fit the estimated densities, an asymptotic approximation formula is obtained for the packing densities which depends only on q, n, d, and an empirical constant.

Keywords

SEQUENTIAL RANDOM PACKINGHAMMING DISTANCE
Type
Research Papers
Information
Journal of Applied Probability , Volume 26 , Issue 3 , September 1989 , pp. 512 - 523
Copyright
Copyright © Applied Probability Trust 1989 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Dixon, W. J., (Ed.) (1981) BMDP Statistical Software 1981. University of California Press, Berkeley.Google Scholar
[2] Itoh, Y. and Solomon, H. (1986) Random sequential coding by Hamming distance. J. Appl. Prob. 23, 688–695.Google Scholar
[3] Klamkin, M. S. and Newman, D. J. (1967) Extensions of the birthday surprise. J. Combinatorial Theory 3, 279–282.Google Scholar
[4] Solomon, H. (1967) Random packing density. Proc. 5th Berkeley Symp. Math. Statist. Prob. 3, 119–134.Google Scholar
[5] Solomon, H. and Weiner, H. (1986) A review of the packing problem. Commun. Statist. — Theor. Meth. 15, 2571–2607.Google Scholar
[6] Sutton, C. (1987) Random packing and random covering sequences. Technical report No. 402, Department of Statistics, Stanford University, Stanford, California.Google Scholar