Best Random Codes Construction for Syndrome Coding Scheme

Abstract

Syndrome coding is a very classical coding scheme in Physical layer security. It is necessary to design a efficient and secure code for syndrome coding to guarantee the security of the instant communications. In this paper, we apply two ways to construct random codes. By analysing on the effect of the parity check matrix on the average equivocation, we propose a method to generate the best random codes with low computation complexity and high security level. The simulation results show that the security performance of the best random codes (BRC) are close to that of the best equivocation codes (BEC) in syndrome coding. Specially, compared to BEC, BRC has a much lower computation complexity.