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: | Özkaya, Buket, Güneri, Cem, Sayıcı, Selcen |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2018
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/89665 http://hdl.handle.net/10220/46715 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
On linear complementary pairs of codes
由: Solé, Patrick, et al.
出版: (2019) -
Quasi-cyclic codes
由: Güneri, Cem, et al.
出版: (2021) -
New bounds on the minimum distance of cyclic codes
由: Ling, San, et al.
出版: (2021) -
Zpk+1-linear codes
由: Ling, S., et al.
出版: (2014) -
The minimum distance of the duals of binary irreducible cyclic codes
由: Ding, C., et al.
出版: (2014)