Randomized Nested Polar Subcode Constructions for Privacy, Secrecy, and Storage

Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/GutachtenBeitrag in KonferenzbandBeigetragenBegutachtung

Beitragende

  • Onur Gunlu - , Technische Universität Berlin (Autor:in)
  • Peter Trifonov - , St. Petersburg National Research University of Information Technologies, Mechanics and Optics (ITMO) (Autor:in)
  • Muah Kim - , Technische Universität Berlin (Autor:in)
  • Rafael F. Schaefer - , Technische Universität Berlin (Autor:in)
  • Vladimir Sidorenko - , Technische Universität Berlin (Autor:in)

Abstract

We consider polar subcodes (PSCs), which are polar codes (PCs) with dynamically-frozen symbols, to increase the minimum distance as compared to corresponding PCs. A randomized nested PSC construction with a low-rate PSC and a high-rate PC, is proposed for list and sequential successive cancellation decoders. This code construction aims to perform lossy compression with side information. Nested PSCs are used in the key agreement problem with physical identifiers. Gains in terms of the secret-key vs. storage rate ratio as compared to nested PCs with the same list size are illustrated to show that nested PSCs significantly improve on nested PCs. The performance of the nested PSCs isshown to improve with larger list sizes, which is not the case for nested PCs considered.

Details

OriginalspracheEnglisch
TitelProceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020
Herausgeber (Verlag)Institute of Electrical and Electronics Engineers Inc.
Seiten475-479
Seitenumfang5
ISBN (elektronisch)9784885523304
PublikationsstatusVeröffentlicht - 24 Okt. 2020
Peer-Review-StatusJa
Extern publiziertJa

Publikationsreihe

ReiheIEICE proceeding series (ISITA)

Konferenz

Titel16th International Symposium on Information Theory and its Applications, ISITA 2020
Dauer24 - 27 Oktober 2020
StadtVirtual, Kapolei
LandUSA/Vereinigte Staaten

Externe IDs

ORCID /0000-0002-1702-9075/work/165878301