| 1. |
- Chen, Wende, et al.
(författare)
-
New constructions of disjoint distinct difference sets
- 1998
-
Ingår i: Designs, Codes and Cryptography. - 0925-1022 .- 1573-7586. ; 15:2, s. 157-165
-
Tidskriftsartikel (refereegranskat)abstract
- New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular,multiplicative and additive DDDS are considered.
|
|
| 2. |
- Braco, Veletanlic, et al.
(författare)
-
Flipped classroom approach and its implementation in an online course
- 2016
-
Ingår i: Lärarlärdom 2016. - Högskolan Kristianstad : Kristianstad University Press.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- 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.
|
|
| 3. |
- Chen, Eric Zhi, 1963-, et al.
(författare)
-
A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- 2015
-
Ingår i: Journal of Algebra Combinatorics Discrete Structures and Application. - Turkey. - 2148-838X. ; 2:1, s. 1-16
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 4. |
- Chen, Eric Zhi, 1963-
(författare)
-
A new iterative computer search algorithm for good quasi-twisted codes
- 2015
-
Ingår i: Designs, Codes and Cryptography. - 0925-1022 .- 1573-7586. ; 76:2, s. 307-323
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 5. |
- Chen, Eric Zhi, 1963-
(författare)
-
An explicit construction of 2-generator quasi-twisted codes
- 2008
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 54:12, s. 5770-5773
-
Tidskriftsartikel (refereegranskat)abstract
- Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction.
|
|
| 6. |
- Chen, Eric Zhi, 1963-
(författare)
-
Computer construction of quasi-twisted two-weight codes
- 2009
-
Ingår i: Proceedings of the sixth International Workshop on Optimal Codes and Related Topics. - Varna, Bulgaria. ; , s. 62-68
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 7. |
- Chen, Eric Zhi, 1963-
(författare)
-
Constructions of 2-generator quasi-cyclic codes
- 2006
-
Ingår i: Proceedings of the tenth International Workshop on Algebraic and Combinatorial Coding Theory. - Zvenigorod : Institute of Information Transmission Problems of Russian Academy of Sciences. ; , s. 60-63
-
Konferensbidrag (refereegranskat)
|
|
| 8. |
- Chen, Eric Zhi, 1963-
(författare)
-
Constructions of quasi-cyclic two-weigh codes
- 2006
-
Ingår i: Proc. of the tenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10). ; , s. 56-59
-
Konferensbidrag (refereegranskat)abstract
- As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this paper, 2-generator QC codes are studied, and many good 2-generator QC codes are constructed using simplex codes. A computer algorithm is given, and used to find the best possible 2-generator QC codes. Among those 2-generator QC codes constructed, some codes are two-weight codes.
|
|
| 9. |
- Chen, Eric Zhi, 1963-
(författare)
-
Flipped classroom model and its implementation in a computer programming course
- 2014
-
Ingår i: Lärarlärdom. - 9789172959682 ; , s. 180-200
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 10. |
- Chen, Eric Zhi, 1963-
(författare)
-
Further results on difference triangle sets
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 40:4, s. 1268-1270
-
Tidskriftsartikel (refereegranskat)abstract
- Further results on the upper bounds for difference tri8nglesets (DTS) are derived from disjoint difference sets and additive sequencesof permutations, whit3 greatly improve the known bounds.
|
|
