Application cases of secrecy coding in communication nodes and terminals

Christiane Kameni Ngassa, Cong Ling, François Delaveau, Sandrine Boumard, Nir Shapira, Ling Liu, Renaud Molière, Adrian Kotelba, Jani Suomalainen

    Research output: Chapter in Book/Report/Conference proceedingChapter or book articleScientificpeer-review

    1 Citation (Scopus)


    The objective of this chapter is to study practical coding techniques to provide security to wireless systems. First, the chapter will briefly introduce theoretical results relevant to low density parity check (LDPC) codes, polar codes and lattice coding for the wiretap channel. Then, it will propose practical secrecy-coding schemes able to provide a reliable and confidential wireless communication link betweenAlice and Bob. Finally, these practical wiretap codes are implemented in WiFi and long-term evolution (LTE) testbeds, and their confidentiality performance is evaluated using the bit-error rate (BER) as it is a simple and practical the metric for secrecy. The reader is referred to [1] for a throughout survey on recent advances related to the design of wiretap codes for information-theoretic metrics such as strong secrecy and semantic secrecy.
    Original languageEnglish
    Title of host publicationTrusted Communications with Physical Layer Security for 5G and Beyond
    EditorsTrung Q. Dong, Xiangyun Zhou, H. Vincent Poor
    PublisherInstitution of Engineering and Technology IET
    ISBN (Electronic)978-1-78561-235-0
    ISBN (Print)978-1-78561-236-7
    Publication statusPublished - 1 Jan 2017
    MoE publication typeA3 Part of a book or another research book


    • fading channels
    • cellular radio
    • OFDM modulation
    • telecommunication security
    • cognitive radio
    • space division multiplexing
    • 5G mobile communication
    • MIMO communication
    • relay networks


    Dive into the research topics of 'Application cases of secrecy coding in communication nodes and terminals'. Together they form a unique fingerprint.

    Cite this