TY - JOUR
TI - Fast Minimal Distance Enumeration of Small Combinations
DO - https://doi.org/doi:10.7282/T3JQ14GM
AU - Steiger, William L.
AU - Neuss, P. M.
PY - 1982-09
AB - We give a history dependent algorithm that satisfies the claims of the title. It has other desirable attributes as well. It is computationally much simpler than algorithms studied in recent work of Payne and Ives when, in enumerating n objects k at a time, k is small compared to n. In fact SN(n,k) decreases n -* - where SN denotes the complexity of the present method and PI , that of Payne-Ives. This is probably due to the savings in overhead required by history less enumeration.
KW - Combinations
KW - Pointers
KW - Constant weight codes
KW - Hamiltonian circuits on the N-cube
KW - Binomial coefficients
LA - English
ER -