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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/89665 http://hdl.handle.net/10220/46715 |