Abstract
This paper shows (in tutorial fashion) how a particular problem in combinatorial mathematics and statistics may be easily solved when it is reformulated (using ztransforms) in a way amenable to solution using digital signal processing (DSP) theory. DSP also allows insights into the nature of the solution and other properties that at first might not be apparent to engineers attempting a mathematician’s non-DSP approach via generating functions, etc.—although both methods are essentially the same, differing only in name and nomenclature.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
McLernon, D. On the Application of Digital Signal Processing Theory to Solving Combinatorial Problems in Statistics. Circuits Syst Signal Process 22, 405–422 (2003). https://doi.org/10.1007/s00034-004-7040-2
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00034-004-7040-2