Linear complementary dual codes over rings

Zihui Liu*, Jinliang Wang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

21 Citations (Scopus)

Abstract

By using linear algebra over finite commutative rings, we will present some judging criterions for linear complementary dual (LCD) codes over rings, in particular, free LCD codes over finite commutative rings are described. By using free LCD codes over finite commutative rings and the Chinese Remainder Theorem, LCD codes over semi-simple rings are constructed and the equivalence of free codes and free LCD codes is given. In addition, all the possible LCD codes over chain rings are determined. We also generalize the judging criterion for cyclic LCD codes over finite fields to cyclic LCD codes over chain rings. Based on the above results and the Chinese Remainder Theorem, we also present results for LCD codes over principal ideal rings.

Original languageEnglish
Pages (from-to)3077-3086
Number of pages10
JournalDesigns, Codes, and Cryptography
Volume87
Issue number12
DOIs
Publication statusPublished - 1 Dec 2019

Keywords

  • Chain rings
  • Chinese Remainder Theorem
  • Generating polynomial
  • LCD codes
  • Principal ideal rings

Fingerprint

Dive into the research topics of 'Linear complementary dual codes over rings'. Together they form a unique fingerprint.

Cite this