
A Direct Construction of Optimal ZCCS and IGC Code Set With Maximum Column Sequence PMEPR Two For MCCDMA System
Multicarrier codedivision multipleaccess (MCCDMA) combines an orthogon...
read it

New Construction of ZComplementary Code Sets and Mutually Orthogonal Complementary Sequence Sets
Due to the zero nontrivial aperiodic correlation of complete complementa...
read it

A Generalised Construction of Multiple Complete Complementary Codes and Asymptotically Optimal Aperiodic QuasiComplementary Sequence Sets
In recent years, complementary sequence sets have found many important a...
read it

A Direct Construction of PrimePowerLength ZeroCorrelation Zone Sequences for QSCDMA System
In the recent years, zerocorrelation zone (ZCZ) sequences have been stu...
read it

Asymptotically Optimal and Nearoptimal Aperiodic QuasiComplementary Sequence Sets Based on Florentine Rectangles
Quasicomplementary sequence sets (QCSSs) can be seen as a generalized v...
read it

Cyclic Shift Code for SACOCDMA Using Fiber BraggGrating
We proposed a novel code called cyclic shift (CS) code to overcome the d...
read it

Direct Construction of Optimal ZComplementary Code Sets for all Possible Even Length by Using PseudoBoolean Functions
Zcomplementary code set (ZCCS) are well known to be used in multicarrie...
read it
Optimal Zcomplementary Code Set From Generalized ReedMuller Codes
Zcomplementary code set (ZCCS), an extension of perfect complementary codes (CCs), refers to a set of twodimensional matrices having zero correlation zone properties. ZCCS can be used in various multichannel systems to support, for example, quasisynchronous interferencefree multicarrier codedivision multiple access communication and optimal channel estimation in multipleinput multipleoutput systems. Traditional constructions of ZCCS heavily rely on a series of sequence operations which may not be feasible for rapid hardware generation particularly for long ZCCSs. In this paper, we propose a direct construction of ZCCS using secondorder ReedMuller codes with efficient graphical representation. Our proposed construction, valid for any number of isolated vertices present in the graph, is capable of generating optimal ZCCS meeting the set size upper bound.
READ FULL TEXT
Comments
There are no comments yet.