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 |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89665 http://hdl.handle.net/10220/46715 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On linear complementary pairs of codes
by: Solé, Patrick, et al.
Published: (2019) -
Quasi-cyclic codes
by: Güneri, Cem, et al.
Published: (2021) -
New bounds on the minimum distance of cyclic codes
by: Ling, San, et al.
Published: (2021) -
Zpk+1-linear codes
by: Ling, S., et al.
Published: (2014) -
The minimum distance of the duals of binary irreducible cyclic codes
by: Ding, C., et al.
Published: (2014)