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 language | English |
|---|---|
| Pages (from-to) | 3077-3086 |
| Number of pages | 10 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 87 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver