Recently, the analysis of in-store customer behavior has been garnering increasing attention as a marketing strategy of retail stores. In this paper, we focus on the effects of customers’ migratory behavior in the inner areas on the resulting purchase amount. We examine the difference between the shopping path of high-volume customers and that of low-volume customers in the inner side of the sales floor to investigate how purchase amount differs when the shopping path contains a longer migration in the inner areas or a larger number of transitions from the outer areas to the inner areas.

By utilizing the method to get the upper bound on the average probability of undetected error for all binary linear systematic block codes, we newly get each upper bound on the average probability of undetected error for the ensembles of all binary product codes and all binary expansions of concatenated codes which include the constructive algebraic codes satisfying Shannon's channel coding theorem or being the asymptotically good. By comparing those upper bounds, we can clearly show that the average capability of concatenation structure is stronger than that of product codes, although the bound for concatenated codes is below that for the ensemble of all binary linear systematic block codes.

Recently, Schwartz and Etzion proposed several efficient code construction methods of two-dimensional linear codes capable of correcting a single arbitrary cluster of errors of size . Some of their methods, however, impose the constraint that the degree of GF must be even. In this correspondence, we investigate whether such Schwartz-Etzion's methods are applicable to the case is odd. We provide necessary and sufficient conditions for the original Schwartz-Etzion's methods to be used for constructing two-dimensional cluster-error-correcting linear codes for odd , and show that the methods are available extensively.