Agung Lukito | Universitas Negeri Surabaya (original) (raw)
Uploads
Papers by Agung Lukito
Journal of Education and Learning (EduLearn)
This article describes a generalization strategy on pictorial visual patterns. This explorative d... more This article describes a generalization strategy on pictorial visual patterns. This explorative descriptive study involves 60 students of 7 Grade Student of private junior high school in Tuban East Java Indonesia. Data obtained through the pattern generalization task. The type of pattern used in this research is pictorial sequences with two non-consecutive terms. Selection of a pictorial sequences with two non-consecutive pattern to focus students' attention on visual stimuli. Based on the students answers of pattern generalization task, there are 33 students who answered correctly and 27 students answered wrong. From the correct answer, there are six different general formula representations. The visualization strategy used by the students begins by splitting the image into smaller elements. The way students break down into smaller elements is also diverse. Students divide the image in the form of V (2 matchsticks), U shape (3 matchsticks), square shape (4 matchsticks) and last...
Discrete Mathematics, 2000
A new upper bound is presented for the length of a snake in a hypercube of dimension n. This boun... more A new upper bound is presented for the length of a snake in a hypercube of dimension n. This bound is better than all bounds derived thusfar for 376n619079.
Electronic Notes in Discrete Mathematics, 2002
Designs, Codes and Cryptography, 1999
An ordered list of binary words of length n is called a distance-preserving m, n -code, if the li... more An ordered list of binary words of length n is called a distance-preserving m, n -code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n -codes is presented, based on the standard Gray code and on some simple tools from linear algebra.
Designs, Codes and Cryptography, 1999
An ordered list of binary words of length n is called a distance-preserving 〈m, n〉-code, if the l... more An ordered list of binary words of length n is called a distance-preserving 〈m, n〉-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic 〈m, n〉-codes is presented, based on the standard Gray code and on some simple tools from linear algebra.
Journal of Education and Learning (EduLearn)
This article describes a generalization strategy on pictorial visual patterns. This explorative d... more This article describes a generalization strategy on pictorial visual patterns. This explorative descriptive study involves 60 students of 7 Grade Student of private junior high school in Tuban East Java Indonesia. Data obtained through the pattern generalization task. The type of pattern used in this research is pictorial sequences with two non-consecutive terms. Selection of a pictorial sequences with two non-consecutive pattern to focus students' attention on visual stimuli. Based on the students answers of pattern generalization task, there are 33 students who answered correctly and 27 students answered wrong. From the correct answer, there are six different general formula representations. The visualization strategy used by the students begins by splitting the image into smaller elements. The way students break down into smaller elements is also diverse. Students divide the image in the form of V (2 matchsticks), U shape (3 matchsticks), square shape (4 matchsticks) and last...
Discrete Mathematics, 2000
A new upper bound is presented for the length of a snake in a hypercube of dimension n. This boun... more A new upper bound is presented for the length of a snake in a hypercube of dimension n. This bound is better than all bounds derived thusfar for 376n619079.
Electronic Notes in Discrete Mathematics, 2002
Designs, Codes and Cryptography, 1999
An ordered list of binary words of length n is called a distance-preserving m, n -code, if the li... more An ordered list of binary words of length n is called a distance-preserving m, n -code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n -codes is presented, based on the standard Gray code and on some simple tools from linear algebra.
Designs, Codes and Cryptography, 1999
An ordered list of binary words of length n is called a distance-preserving 〈m, n〉-code, if the l... more An ordered list of binary words of length n is called a distance-preserving 〈m, n〉-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic 〈m, n〉-codes is presented, based on the standard Gray code and on some simple tools from linear algebra.