Please use this identifier to cite or link to this item:
|Title:||On linear complementary pair of nD cyclic codes||Authors:||Özkaya, Buket
|Keywords:||LCP Of Codes
nD Cyclic Codes
|Issue Date:||2018||Source:||Güneri, C., Özkaya, B., & Sayıcı , S. On linear complementary pair of nD cyclic codes. IEEE Communications Letters, 1-1. doi:10.1109/LCOMM.2018.2872046||Series/Report no.:||IEEE Communications Letters||Abstract:||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 equivalent codes. Hence, the security parameter for cyclic and 2D cyclic linear complementary pair of codes is simply d(C). We extend this result to nD cyclic linear complementary pair of codes. The proof of Carlet et al. for the 2D cyclic case is based on the trace representation of the codes, which is technical and nontrivial to generalize. Our proof for the generalization is based on the zero sets of the ideals corresponding to nD cyclic codes.||URI:||https://hdl.handle.net/10356/89665
|ISSN:||1089-7798||DOI:||http://dx.doi.org/10.1109/LCOMM.2018.2872046||Rights:||© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/LCOMM.2018.2872046].||metadata.item.grantfulltext:||open||metadata.item.fulltext:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.