On linear complementary pair of nD cyclic codes
The security parameter for a linear complementary pair (C,D) of codes is defined to be the minimum of the minimum distances d(C) and d(D⊥). Recently, Carlet et al. showed that if C and D are both cyclic or both two-dimensional (2D) cyclic linear complementary pair of codes, then C and D⊥ are equival...
Saved in:
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/89665 http://hdl.handle.net/10220/46715 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|