Welcome to the archive of my work with Dr. Savage on antipodal Gray codes.

New: See the submission of the paper with Dr. Savage: Antipodal Gray Codes
Corrections to paper:

• On page 15, line 4 of the 8 bit antipodal Gray code should be "(A_1 | A_0^2 ; 6), (A_1 | A_0^3 ; 4), (A_1 | A_0^0 ; 0), (A_1 | A_0^1 ; 12)", correction thanks to Dr. Todd Will, UW-LaCrosse

Details of some [older] results:

• The 16 bit antipodal gray code
• The 16 bit antipodal gray code
• The maple function to put two lists next to each other
• A maple function to cycle through the m's, but not the way we needed to
• The maple function to cycle through the m's like we need to
• The maple function to create an 8 bit APGC
• The maple function to create a 16 bit APGC
• The perl program to test consecutive elements for only one bit change
• The perl program to test and see if the 11..100..0 antipode structure is maintained
• The 8 bit antipodal gray code
• The maple generated html of the 8 bit binary code
• Just the code: (PDF or PS)
• The 6 bit antipodal gray code (or rather, lack of one)
• The code I used to generate bit sequences: createcode2.cpp
• The code I used to generate the binary string sequences: helperflipbit2.pl
• The code I used to check for cyclic property: passone2.pl
• The code I used to check for duplicates: passtwo2.pl
• A gzipped tar of the code I used: n6testcode.tgz
• A gzipped tar of the output of the programs: outfiles2.tar.gz