Random sequential coding by Hamming distance

DOI10.2307/3214007MaRDI QIDQ3741630zbMATH OpenOpenAlexFDO

Authors Yoshiaki Itoh, H. Solomon

Publication date 1986

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3214007

zbMATH Keywords

computer simulationscubic random packingpacking densitypacking of spheressequential random packing

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Combinatorial aspects of packing and covering (05B40) Geometric probability and stochastic geometry (60D05) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Communication, information (94A99)

Recommendations

• Packing densities of randomly constructed codes
• scientific article; zbMATH DE number 3890593
• scientific article; zbMATH DE number 3780
• Packing points into a unit cube in higher space
• On the high density behavior of Hamming codes with fixed minimum distance

Cited in

(6)

• A simple method for determining Hadamard sequency vectors
• Evolutive tandem repeats using Hamming distance
• Packing densities of randomly constructed codes
• A binomial splitting process in connection with corner parking problems
• Random packings by cubes
• Combinatorial cube packings in the cube and the torus

This page was built for publication: Random sequential coding by Hamming distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741630)