Basics of Secrecy Coding

Phillip A. Regalia ()
Additional contact information
Phillip A. Regalia: National Science Foundation, Directorate for Computer and Information Science and Engineering

Chapter 37 in Operator Theory, 2015, pp 931-966 from Springer

Abstract: Abstract Linear system theory over finite fields has played a major role in unveiling the properties of linear error correction codes, thus providing essential insights into key design parameters and features, such as minimal realizations, distance spectra, trapping sets, and efficient decoder structures, among others. A more recent thrust in error correction coding (linear or otherwise) is in secrecy systems, in the form of physical layer security that can complement, and in certain cases even replace, classical cryptography in specific communication settings. This chapter reviews the basic principles of secrecy coding, focusing on the properties of linear codes that approach secrecy capacity, as a precursor to understanding design strategies that attain these properties, as offered in the references. Applications beyond secure communications of these same coding techniques, notably in watermarking and steganography, are also outlined.

Keywords: Secret Message; Code Word; Polar Code; Virtual Channel; Secrecy Capacity (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-0667-1_71

Ordering information: This item can be ordered from
http://www.springer.com/9783034806671

DOI: 10.1007/978-3-0348-0667-1_71

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().