Abstract
Linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years for some practical applications. Hence, in this letter, we use simplicial complexes for construction of an infinite family of binary LCD codes and two infinite families of binary self-orthogonal codes. Moreover, we explicitly determine the weight distributions of these codes. We obtain binary LCD codes which have minimum weights two or three, and we also find some self-orthogonal codes meeting the Griesmer bound. As examples, we also present some (almost) optimal binary self-orthogonal codes and LCD distance optimal codes.
Original language | English |
---|---|
Article number | 9043524 |
Pages (from-to) | 1159-1162 |
Number of pages | 4 |
Journal | IEEE Communications Letters |
Volume | 24 |
Issue number | 6 |
DOIs | |
State | Published - Jun 2020 |
Bibliographical note
Publisher Copyright:© 1997-2012 IEEE.
Keywords
- LCD code
- Simplicial complex
- self-orthogonal code
- weight distribution