2 research outputs found
Semantically Secure Lattice Codes for Compound MIMO Channels
We consider compound multi-input multi-output (MIMO) wiretap channels where
minimal channel state information at the transmitter (CSIT) is assumed. Code
construction is given for the special case of isotropic mutual information,
which serves as a conservative strategy for general cases. Using the flatness
factor for MIMO channels, we propose lattice codes universally achieving the
secrecy capacity of compound MIMO wiretap channels up to a constant gap
(measured in nats) that is equal to the number of transmit antennas. The
proposed approach improves upon existing works on secrecy coding for MIMO
wiretap channels from an error probability perspective, and establishes
information theoretic security (in fact semantic security). We also give an
algebraic construction to reduce the code design complexity, as well as the
decoding complexity of the legitimate receiver. Thanks to the algebraic
structures of number fields and division algebras, our code construction for
compound MIMO wiretap channels can be reduced to that for Gaussian wiretap
channels, up to some additional gap to secrecy capacity.Comment: IEEE Trans. Information Theory, to appea