In this study, random codes are applied to the classical syndrome coding scheme to achieve secrecy of communications. By analysing the effect of the values of the columns of the parity check matrix on the resulting se...
详细信息
In this study, random codes are applied to the classical syndrome coding scheme to achieve secrecy of communications. By analysing the effect of the values of the columns of the parity check matrix on the resulting security level of communications, a code design method is presented which constructs a class of random codes, termed random permutation codes, which achieve high security levels and are easily generated. A theoretical analysis method is presented which determines the security level achieved by randomly chosen, linear binary codes, and compared with simulation results obtained by Monte Carlo analysis. The results verify the theoretical approach. In particular, the theoretical method is also suitable for analysis of long codes having a large number of parity check bits which are beyond evaluation by computer simulation. The results show that the security performance of any randomly chosen permutation code is close to that of the best equivocation code having the same code parameters. This has the practical advantage in syndrome coding of being able to use an ephemeral code for each communication session, thereby providing forward secrecy, a desired feature of modern, secure communication systems.
In this paper, we consider the design of a binary network coding scheme for the wireless broadcast, in which the same packet sequence is broadcasted to multiple receivers. In the proposed coding scheme, a short block ...
详细信息
ISBN:
(纸本)9781424492688
In this paper, we consider the design of a binary network coding scheme for the wireless broadcast, in which the same packet sequence is broadcasted to multiple receivers. In the proposed coding scheme, a short block code is employed for the coding across the broadcasted packets to generate redundant packets to recover the lost packets for all terminals in the service. In particular, we assume the optimal decoder and consider the design of short block codes with a small number of redundancy. We present a residual graph based code design method and propose an iterative design algorithm with stochastic update. The short block code is then extended with an improved pseudo-random code to achieve the flexibility on redundancy. Numerical results show that the proposed coding scheme provides superior performance over other coding schemes.
暂无评论