A low spatial complexity algorithm to generate combinations with the strong minimal change property

DOI10.1142/S1793830919500605zbMath1426.05003MaRDI QIDQ5242834

Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez

Publication date: 7 November 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

combinationsgeneration of combinationsstrong minimal change property

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Three new combination algorithms with the minimal change property
• Efficient generation of the binary reflected gray code and its applications
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: A low spatial complexity algorithm to generate combinations with the strong minimal change property