hkr.sePublications
Change search
Refine search result
1 - 22 of 22
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Braco, Veletanlic
    et al.
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Flipped classroom approach and its implementation in an online course2016In: Lärarlärdom 2016: Högskolan Kristianstad / [ed] Claes Dahlqvist & Stefan Larsson, Högskolan Kristianstad: Kristianstad University Press , 2016Conference paper (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.

  • 2.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    A new iterative computer search algorithm for good quasi-twisted codes2015In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 76, no 2, p. 307-323Article in journal (Refereed)
    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.

  • 3.
    Chen, Eric Zhi
    Kristianstad University, School of Engineering.
    An explicit construction of 2-generator quasi-twisted codes2008In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 54, no 12, p. 5770-5773Article in journal (Refereed)
    Abstract [en]

    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.

  • 4.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society.
    Computer construction of quasi-twisted two-weight codes2009In: Proceedings of the sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria, 2009, p. 62-68Conference 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.

  • 5.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Constructions of 2-generator quasi-cyclic codes2006In: Proceedings of the tenth International Workshop on Algebraic and Combinatorial Coding Theory, Zvenigorod: Institute of Information Transmission Problems of Russian Academy of Sciences , 2006, p. 60-63Conference paper (Refereed)
  • 6.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Constructions of quasi-cyclic two-weigh codes2006In: Proc. of the tenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10), 2006, p. 56-59Conference paper (Refereed)
    Abstract [en]

    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.

  • 7.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Flipped classroom model and its implementation in a computer programming course2014In: Lärarlärdom: Högskolepedagogisk Konferens 2014, Blekinge Tekniska Högskola / [ed] Christina Hansson, 2014, p. 180-200Conference 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.

  • 8.
    Chen, Eric Zhi
    Linköping university.
    Further results on difference triangle sets1994In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 40, no 4, p. 1268-1270Article in journal (Refereed)
    Abstract [en]

    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.

  • 9.
    Chen, Eric Zhi
    Kristianstad University, School of Engineering.
    Good quasi-cyclic codes derived from irreducible cyclic codes2005In: Proceedings of Optimal Codes and Related Topics (OC2005), 2005, p. 74-81Conference paper (Refereed)
    Abstract [en]

    As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound on the minimum distance, is also constructed.

  • 10.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds2016In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 80, no 1, p. 1-10Article in journal (Refereed)
    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.

  • 11.
    Chen, Eric Zhi
    Kristianstad University, School of Engineering.
    New constructions of a family of 2-generator quasi-cyclic two-weight codes and related codes2007In: Proc. of 2007 IEEE Internat. Symp. on Inform. Theory, Piscataway, NJ: IEEE , 2007, p. 2191-2195Conference paper (Refereed)
    Abstract [en]

    Based on cyclic simplex codes, a new construction of a family of two-weight codes is given. These two-weight codes are in a simple 2-generator quasi-cyclic form. Based on this construction, new optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary  [195, 6, 126], [208, 6, 135], [221, 6, 144] codes are thus obtained. It was also shown that some codes that meet the Griesmer bound and thus are optimal. Furthermre, binary  self-complementary codes in a 3-generator quasi-cyclic form,  are also constructed.

  • 12.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    New constructions of combinatorial designs and related codes2002In: Proceedings of the 8th International Workshop on Algebraic coding and Combinatorial Theory (ACCT-VIII), 2002, p. 264-267Conference paper (Refereed)
    Abstract [en]

    New constructions of Steiner systems, majority logic decodable codes, and constant weight codes are presented. Comparisons with known results as well as examples are also given.

  • 13.
    Chen, Eric Zhi
    Kristianstad University, School of Engineering.
    New quasi-cyclic codes from simplex codes2007In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 53, no 3, p. 1193-1196Article in journal (Refereed)
    Abstract [en]

    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 correspondence, 2-generator and 3-generator QC codes are studied, and many good, new QC codes are constructed from simplex codes. Some new binary QC codes or related codes, that improve the bounds on maximum minimum distance for binary linear codes are constructed. They are 5-generator QC [93 17 34] and [254,23, 102] codes, and related [96, 17, 361, [256, 23,104] codes.

  • 14.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    New results on binary quasi-cyclic codes2000In: 2000 Ieee International Symposium on Information Theory: Proceedings, IEEE conference proceedings, 2000, p. 197-Conference paper (Refereed)
    Abstract [en]

    Twelve new binary quasi-cyclic codes, which improve the lower bounds on minimum distances for binary linear codes, are presented, and a Web database on best-known binary quasi-cyclic codes is constructed for public access.

  • 15.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Quasi-cyclic codes derived from cyclic codes2004In: Proceedings of Int. Symp. on Information Theory and its Applications (ISITA2004), Parma, Italy, 2004, p. 162-165Conference paper (Refereed)
  • 16.
    Chen, Eric Zhi
    Linköping university.
    Six new binary quasi-cyclic codes1994In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 40, no 5, p. 1666-1667Article in journal (Refereed)
    Abstract [en]

    Six new quasi-cyclic codes are presented, which improve thelower bounds on the minimum distance for a binary code. A localexhaustive search is used to find these codes and many other quasi-cycliccodes which attain the lower bounds.

  • 17.
    Chen, Eric Zhi
    et al.
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Aydin, Nuh
    USA.
    New databases of linear codes over GF(11) and GF(13)2014In: Proceedings of Karatekin mathematics days 2014: international mathematics symposium, 2014, p. 22-22Conference paper (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.

  • 18.
    Chen, Eric Zhi
    et al.
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Aydın, Nuh
    USA.
    A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm2015In: Journal of Algebra Combinatorics Discrete Structures and Application, ISSN 2148-838X, Vol. 2, no 1, p. 1-18Article in journal (Refereed)
    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.

  • 19.
    Chen, Eric Zhi
    et al.
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Nuh, Aydin
    USA.
    New quasi-twisted codes over F11— minimum distance bounds and a new database2015In: Journal of Information and Optimization Sciences, ISSN 0252-2667, E-ISSN 2169-0103, Vol. 36, no 1-2, p. 129-157Article in journal (Refereed)
    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.

  • 20.
    Chen, Wende
    et al.
    Academia Sinica and Key State Lab. of Information Security, Graduate School of Academia Sinica, Institute of Systems Science, Beijing.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Klove, Torleiv
    Department of Informatics, University of Bergen.
    New constructions of disjoint distinct difference sets1998In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 15, no 2, p. 157-165Article in journal (Refereed)
    Abstract [en]

    New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular,multiplicative and additive DDDS are considered.

  • 21.
    Lu, Jun
    et al.
    Kristianstad University, Forskningsplattformen Hälsa i samverkan.
    Zhang, Song
    Kristianstad University, Forskningsplattformen Hälsa i samverkan.
    Chen, Eric
    Kristianstad University, Forskningsplattformen Hälsa i samverkan. Kristianstad University, School of Health and Society.
    E-health web application framework and platform based on the cloud technology2013Report (Other academic)
  • 22.
    Song, Qunying
    et al.
    Kristianstad University, Forskningsplattformen Hälsa i samverkan.
    Xu, Jingjing
    Kristianstad University, Forskningsplattformen Hälsa i samverkan.
    Chen, Eric
    Kristianstad University, Forskningsplattformen Hälsa i samverkan. Kristianstad University, School of Health and Society.
    Study and implementation of patient data collection and presentation for an eHealth application2013Report (Other academic)
1 - 22 of 22
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf