We investigate coding schemes that map source symbols into multisets of an alphabet set.
Such a formulation of source coding is an alternative approach to the traditional framework …

Nearly perfect packing codes are those codes that meet the Johnson upper bound on the
size of error-correcting codes. This bound is an improvement to the sphere-packing bound …