Papers
Topics
Authors
Recent
2000 character limit reached

Optimal Z-complementary Code Set From Generalized Reed-Muller Codes

Published 8 Nov 2019 in cs.IT and math.IT | (1911.03313v1)

Abstract: Z-complementary code set (ZCCS), an extension of perfect complementary codes (CCs), refers to a set of two-dimensional matrices having zero correlation zone properties. ZCCS can be used in various multi-channel systems to support, for example, quasi-synchronous interference-free multicarrier code-division multiple access communication and optimal channel estimation in multiple-input multiple-output 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 second-order Reed-Muller 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.

Citations (63)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.