Randomized Nested Polar Subcode Constructions for Privacy, Secrecy, and Storage
Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/Gutachten › Beitrag in Konferenzband › Beigetragen › Begutachtung
Beitragende
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
Originalsprache | Englisch |
---|---|
Titel | Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020 |
Herausgeber (Verlag) | Institute of Electrical and Electronics Engineers Inc. |
Seiten | 475-479 |
Seitenumfang | 5 |
ISBN (elektronisch) | 9784885523304 |
Publikationsstatus | Veröffentlicht - 24 Okt. 2020 |
Peer-Review-Status | Ja |
Extern publiziert | Ja |
Publikationsreihe
Reihe | IEICE proceeding series (ISITA) |
---|
Konferenz
Titel | 16th International Symposium on Information Theory and its Applications, ISITA 2020 |
---|---|
Dauer | 24 - 27 Oktober 2020 |
Stadt | Virtual, Kapolei |
Land | USA/Vereinigte Staaten |
Externe IDs
ORCID | /0000-0002-1702-9075/work/165878301 |
---|