The traditional Bayesian approximation framework for filtering in discrete time systems assumes that the measurement is available at every time instant. But in practice, the measurements could be randomly delayed. In the literature, the problem has been examined and solution is provided by restricting the maximum number of delay to one or two time steps. This technical note develops an approach to deal with the filtering problems with an arbitrary number of delays in measurement. Pursuing this objective, traditional Bayesian approximation to nonlinear filtering problem is modified by reformulating the expressions of mean and covariances which appear during the measurement update. We use the cubature quadrature rule to evaluate the multivariate integral expressions for the mean vector and the covariance matrix which appear in the developed filtering algorithm. We compare the new algorithm which accounts for delay with the existing CQKF heuristics on two different examples and demonstrate how accounting for a random delay improves the filtering performance.