hkr.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Chen, Eric Zhi
Alternative names
Publications (10 of 22) Show all publications
Braco, V. & Chen, E. Z. (2016). Flipped classroom approach and its implementation in an online course. In: Claes Dahlqvist & Stefan Larsson (Ed.), Lärarlärdom 2016: Högskolan Kristianstad. Paper presented at Lärarlärdom, Högskolan Kristianstad, 17 augusti, 2016. Högskolan Kristianstad: Kristianstad University Press
Open this publication in new window or tab >>Flipped classroom approach and its implementation in an online course
2016 (English)In: Lärarlärdom 2016: Högskolan Kristianstad / [ed] Claes Dahlqvist & Stefan Larsson, Högskolan Kristianstad: Kristianstad University Press , 2016Conference paper, Oral presentation with published abstract (Other academic)
Abstract [en]

Active learning is the process where students learn beyond passively listening to an instructor's lecture. In this way students are engaged in their learning activities. It has been accepted that active learning leads to deeper understanding and better learning outcomes.

The term flipped classroom has been widely used to describe a new pedagogical approach in which traditional lecture and homework elements of a course are reversed so that the initial exposure to the learning content takes place outside of the classroom. This approach frees up class time, promotes active learning and engagement in learning and facilitates student-centered learning.

In this study we experimented with flipped classroom approach in the online course Programming in C during the autumn term 2015. The purpose of the experiment was to determine whether flipped classroom can serve as an appropriate method to use in an online course and to find out to what extent flipped classroom can stimulate active learning in an online setting. Based on known concept of flipped classroom approach and literature review, we systematically reviewed YouTube videos and selected 52 video clips to use as companion course materials. We also compiled and produced 212 quiz questions to use as formative assessment. In order to promote interaction among the students, we experimented with peer-review as a part of the laboratory work process. We also provided scheduled online sessions in the form of chat rooms. Short video clips were positively received by the students. Even the peer-review approach was positively received but the students gave up this activity at the end of the course, due to the work load. Flipped classroom has potential to be used in online settings but distinction between "classroom" and "outside classroom" is not always clear.

More work is needed to make this distinction visible and to make the transition between these two learning environments smooth.

Place, publisher, year, edition, pages
Högskolan Kristianstad: Kristianstad University Press, 2016
National Category
Pedagogy
Identifiers
urn:nbn:se:hkr:diva-16572 (URN)
Conference
Lärarlärdom, Högskolan Kristianstad, 17 augusti, 2016
Available from: 2017-03-01 Created: 2017-03-01 Last updated: 2017-03-07Bibliographically approved
Chen, E. Z. (2016). New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds. Designs, Codes and Cryptography, 80(1), 1-10
Open this publication in new window or tab >>New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
2016 (English)In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 80, no 1, p. 1-10Article in journal (Refereed) Published
Abstract [en]

An [n, k, d] code is a binary linear code of block length n, dimension k and minimum Hamming distance d. Since the minimum distance determines the error detection or correction capability, it is desired that d is as large as possible for the given block length n and dimension k. One of the most fundamental problems in coding theory is to construct codes with best possible minimum distances. This problem is very difficult in both theory and practice. During the last decades, it has proved that the class of quasi-cyclic (QC) codes contain many such codes. In this paper, augmentation of binary QC codes is studied. A new augmentation algorithm is presented, and 10 new h-generator QC codes that are better than previously known code have been constructed. Furthermore, Construction X has been applied to obtain another 18 new improved binary linear codes.With the standard construction techniques, a total of 124 new binary linear codes that improve the lower bound on the minimum distance have been obtained.

Keywords
Best-known codes, Coding theory, Search algorithm, Linear codes, Quasi-cyclic codes, Construction X
National Category
Computer Sciences
Identifiers
urn:nbn:se:hkr:diva-13742 (URN)10.1007/s10623-015-0059-5 (DOI)000377188000001 ()
Available from: 2015-03-24 Created: 2015-03-24 Last updated: 2018-01-11Bibliographically approved
Chen, E. Z. & Aydın, N. (2015). A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm. Journal of Algebra Combinatorics Discrete Structures and Application, 2(1), 1-18
Open this publication in new window or tab >>A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
2015 (English)In: Journal of Algebra Combinatorics Discrete Structures and Application, ISSN 2148-838X, Vol. 2, no 1, p. 1-18Article in journal (Refereed) Published
Abstract [en]

Error control codes have been widely used in data communications and storage systems. One centralproblem in coding theory is to optimize the parameters of a linear code and construct codes withbest possible parameters. There are tables of best-known linear codes over finite fields of sizes up to9. Recently, there has been a growing interest in codes over F13 and other fields of size greater than9. The main purpose of this work is to present a database of best-known linear codes over the fieldF13 together with upper bounds on the minimum distances. To find good linear codes to establishlower bounds on minimum distances, an iterative heuristic computer search algorithm is employed toconstruct quasi-twisted (QT) codes over the field F13 with high minimum distances. A large numberof new linear codes have been found, improving previously best-known results. Tables of [pm;m] QTcodes over F13 with best-known minimum distances as well as a table of lower and upper bounds onthe minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.

Place, publisher, year, edition, pages
Turkey: , 2015
Keywords
Database of linear codes, Quasi-twisted codes, Heuristic search algorithm, Iterative search
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:hkr:diva-13390 (URN)
Available from: 2015-01-09 Created: 2015-01-09 Last updated: 2018-01-11Bibliographically approved
Chen, E. Z. (2015). A new iterative computer search algorithm for good quasi-twisted codes. Designs, Codes and Cryptography, 76(2), 307-323
Open this publication in new window or tab >>A new iterative computer search algorithm for good quasi-twisted codes
2015 (English)In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 76, no 2, p. 307-323Article in journal (Refereed) Published
Abstract [en]

As a generalization to cyclic and consta-cyclic codes, quasi-twisted (QT) codes contain many good linear codes. During the last twenty years, a lot of record-breaking codes have been found by computer search for good QT codes. But due to the time complexity, very few QT codes have been reported recently. In this paper, a new iterative, heuristic computer search algorithm is presented, and a lot of new QT codes have been obtained. With these results, a total of 45 entries in the code tables for the best-known codes have been improved. Also, as an example to show the effectiveness of the algorithm, 8 better binary quasi-cyclic codes with dimension 12 and m = 13 than previously best-known results are constructed.

Keywords
best-known codes, coding theory, search algorithm, linear codes, quasi-twisted codes, simplex code
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:hkr:diva-11871 (URN)10.1007/s10623-014-9950-8 (DOI)000356360000010 ()
Available from: 2014-03-20 Created: 2014-03-20 Last updated: 2018-01-11Bibliographically approved
Chen, E. Z. & Nuh, A. (2015). New quasi-twisted codes over F11— minimum distance bounds and a new database. Journal of Information and Optimization Sciences, 36(1-2), 129-157
Open this publication in new window or tab >>New quasi-twisted codes over F11— minimum distance bounds and a new database
2015 (English)In: Journal of Information and Optimization Sciences, ISSN 0252-2667, E-ISSN 2169-0103, Vol. 36, no 1-2, p. 129-157Article in journal (Refereed) Published
Abstract [en]

One fundamental and challenging problem in coding theory is to optimize the parameters [nk,d] of a linear code over the finite field Fq and construct codes with best possible parameters. There are tables and databases of best-known linear codes over the finite fields of size up to 9 together with upper bounds on the minimum distances. Motivated by recent works on codes over F11, we present a table of best-known linear codes over F11 together with upper bounds on minimum distances. Our table covers the range n ≤ 150 for the length, and 3 ≤ k ≤ 7 for the dimension. To the best of our knowledge, this is the first time such a table is presented in the literature. For the construction of the best-known codes, we employed an iterative heuristic search algorithm to search for new linear codes in the class of quasi-twisted (QT) codes. The search yielded many new codes with better parameters than previously known codes. In many cases, optimal codes are obtained. In addition to presenting a comprehensive table of best-known codes over F11 of dimensions up to 7 with upper bounds on the minimum distances, we also present separate tables for the optimal codes and new QT codes over F11. We hope that this work will be a useful source for further study on codes over F11.

Keywords
Quasi-twisted codes, heuristic search algorithm, iterative search, distance bounds
National Category
Computer Sciences
Identifiers
urn:nbn:se:hkr:diva-13778 (URN)10.1080/02522667.2014.961788 (DOI)
Available from: 2015-04-08 Created: 2015-04-08 Last updated: 2018-01-11Bibliographically approved
Chen, E. Z. (2014). Flipped classroom model and its implementation in a computer programming course. In: Christina Hansson (Ed.), Lärarlärdom: Högskolepedagogisk Konferens 2014, Blekinge Tekniska Högskola. Paper presented at Lärarlärdom 2014 (Scholarship of Teaching and Learning), Blekinge Tekniska Högskola, 20 augusti 2014 (pp. 180-200).
Open this publication in new window or tab >>Flipped classroom model and its implementation in a computer programming course
2014 (English)In: Lärarlärdom: Högskolepedagogisk Konferens 2014, Blekinge Tekniska Högskola / [ed] Christina Hansson, 2014, p. 180-200Conference paper, Published paper (Refereed)
Abstract [en]

The flipped classroom approach provides implementation of a student-centered learning environment. By changing the traditional classroom lectures and homework elements of a course, it facilitates active learning and higher-order understanding. This paper presents initial experiments on a flipped classroom approach and its application in a programming course. The course results and evaluation show that this approach is rewarding, and why it deserves further investigation.

Keywords
flipped classroom, active learning, constructive alignment, computer science
National Category
Pedagogy
Identifiers
urn:nbn:se:hkr:diva-13391 (URN)978-91-7295-968-2 (ISBN)
Conference
Lärarlärdom 2014 (Scholarship of Teaching and Learning), Blekinge Tekniska Högskola, 20 augusti 2014
Available from: 2015-01-09 Created: 2015-01-09 Last updated: 2017-01-30Bibliographically approved
Chen, E. Z. & Aydin, N. (2014). New databases of linear codes over GF(11) and GF(13). In: Proceedings of Karatekin mathematics days 2014: international mathematics symposium. Paper presented at Karatekin Mathematics Days 2014, Çankırı, Turkey, 11-13 June, 2014 (pp. 22-22).
Open this publication in new window or tab >>New databases of linear codes over GF(11) and GF(13)
2014 (English)In: Proceedings of Karatekin mathematics days 2014: international mathematics symposium, 2014, p. 22-22Conference paper, Oral presentation with published abstract (Refereed)
Abstract [en]

One central problem in coding theory is to optimize the parameters of a linear code and construct codes with best possible parameters. There are tables of best-known linear codes over nite elds of sizes up to 9. Recently, there has been a growing interest in codes over GF(11), over GF(13) and other elds of size greater than 9. The main purpose of this work is to present new databases of best-known linear codes over the elds GF(11) and GF(13) together with upper bounds on the minimum distances. To nd good linear codes to establish lower bounds on minimum distances, an iterative heuristic computer search algorithm is employed to construct quasi-twisted (QT) codes over these elds with high minimum distances. A large number of new linear codes have been found, improving previously best-known results. Tables of [pm, m] QT codes over the two elds with best-known minimum distances as well as a table of lower and upper bounds on the minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.

Keywords
Database of linear codes, quasi-twisted codes, heuristic search algorithm, iterative search
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:hkr:diva-14835 (URN)
Conference
Karatekin Mathematics Days 2014, Çankırı, Turkey, 11-13 June, 2014
Available from: 2015-09-28 Created: 2015-09-28 Last updated: 2018-01-11Bibliographically approved
Lu, J., Zhang, S. & Chen, E. (2013). E-health web application framework and platform based on the cloud technology.
Open this publication in new window or tab >>E-health web application framework and platform based on the cloud technology
2013 (English)Report (Other academic)
Publisher
p. 62
Series
Forskningsplattformen för Hälsa i samverkan, ISSN 1652-9979 ; 7
National Category
Other Engineering and Technologies
Identifiers
urn:nbn:se:hkr:diva-12088 (URN)
Projects
Informationsteknik som stöd i egenvård vid kronisk sjukdom – Diabetes Typ 2
Available from: 2014-06-10 Created: 2014-06-10 Last updated: 2014-07-30
Song, Q., Xu, J. & Chen, E. (2013). Study and implementation of patient data collection and presentation for an eHealth application. Kristianstad
Open this publication in new window or tab >>Study and implementation of patient data collection and presentation for an eHealth application
2013 (English)Report (Other academic)
Place, publisher, year, edition, pages
Kristianstad: , 2013. p. 50
Series
Forskningsplattformen för Hälsa i samverkan, ISSN 1652-9979 ; 6
National Category
Other Engineering and Technologies
Identifiers
urn:nbn:se:hkr:diva-12087 (URN)
Projects
Informationsteknik som stöd i egenvård vid kronisk sjukdom – Diabetes Typ 2
Available from: 2014-06-10 Created: 2014-06-10 Last updated: 2014-06-10
Chen, E. Z. (2009). Computer construction of quasi-twisted two-weight codes. In: Proceedings of the sixth International Workshop on Optimal Codes and Related Topics: . Paper presented at Sixth International Workshop on Optimal Codes and Related Topics, June 16 - 22, 2009, Varna, BULGARIA (pp. 62-68). Varna, Bulgaria
Open this publication in new window or tab >>Computer construction of quasi-twisted two-weight codes
2009 (English)In: Proceedings of the sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria, 2009, p. 62-68Conference paper, Published paper (Refereed)
Abstract [en]

A code is said two-wight if the non-zero codewords have only two different weights w1 and w2. In this paper, it is generalized that a consta-cyclic code of composite length can be put in the quasi-twisted (QT) form. Based on this result, a new computer method of QT two-weight codes is presented. A large amount of QT two-weight codes are found, and several new codes are also constructed.

Place, publisher, year, edition, pages
Varna, Bulgaria: , 2009
Keywords
code and coding, quasi-twisted codes, two-weight codes, coding theory
National Category
Computer and Information Sciences Engineering and Technology
Identifiers
urn:nbn:se:hkr:diva-1015 (URN)
Conference
Sixth International Workshop on Optimal Codes and Related Topics, June 16 - 22, 2009, Varna, BULGARIA
Available from: 2009-07-09 Created: 2009-07-09 Last updated: 2018-01-13Bibliographically approved
Organisations

Search in DiVA

Show all publications