Abstract
In this paper, an equivocation scheme with finite code length is proposed for a wiretap channel. The proposed coding scheme is composed of two constituent codes, an outer code and an inner code, which are used efficiently for various channel conditions. A Hamming code and its cosets are used for an outer code and bit-extension mapping is adopted for an inner code. The average equivocation is discussed for small messages and the probability of causing imperfect secrecy is defined to investigate the performance of outer and inner codes. The results show that usage of inner codes increases the equivocation capability of wiretap channels.
References
Wyner, A. D. (1975). The wire-tap channel. The Bell System Technical Journal, 54, 1355–1387.
Ozarow, L. H., & Wyner, A. D. (1984). Wire-tap channel II. The Bell System Technical Journal, 63(10), 2135–2157.
Wei, V. K. (1991). Generalized Hamming weights for linear codes. IEEE Transactions on Information Theory, 37(5), 1412–1418.
Thangaraj, A., Dihidar, S., Calderbank, A. R., McLaughlin, S., & Merolla, J.-M. (2007). Application of LDPC codes to the wiretap channel. IEEE Transaction on Information Theory, 53(8), 2933–2945.
MacWilliams, F. J., & Sloane, N. J. A. (1977). The theory of error-correcting codes. Amsterdam, The Netherlands: North-Holland.
Acknowledgments
This work was supported by 2013 Special Research Fund of Electrical Engineering at University of Ulsan.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, S. New Codes with Finite Length for a Wiretap Channel. Wireless Pers Commun 75, 601–608 (2014). https://doi.org/10.1007/s11277-013-1380-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-013-1380-9