I Nengah, Suparta (2014) ON COUNTING SEQUENCES AND SOME RESEARCH QUESTIONS. Proceeding of International Conference On Research, Implementation And Education Of Mathematics And Sciences 2014. (Submitted)
|
Text
M-1 I Nengah Suparta.pdf Download (577kB) | Preview |
Abstract
A counting sequence is a list of all binary words of the same length. Counting sequences of any fixed odd Hamming distance between successive words (codewords) are discussed. Gray codes are examples of counting sequences having a single-bit change between neighboring codewords. We describe some results on Gray codes and highlight some research questions. The spectrum of bit changes or transition counts for individual variables for some uniform counting sequences is considered. We show some recent minor findings and pose remaining open questions.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Counting sequences, Gray codes, Hamming distance, transition counts, uniform counting sequences. |
| Subjects: | Prosiding > ICRIEMS 2014 > MATHEMATICS & MATHEMATICS EDUCATION |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Pendidikan Matematika > Matematika |
| Depositing User: | Eprints |
| Date Deposited: | 07 Nov 2014 04:28 |
| Last Modified: | 07 Nov 2014 04:28 |
| URI: | http://eprints.uny.ac.id/id/eprint/11470 |
Actions (login required)
 |
View Item |