Randomized Nested Polar Subcode Constructions for Privacy, Secrecy, and Storage
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
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
Original language | English |
---|---|
Title of host publication | Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 475-479 |
Number of pages | 5 |
ISBN (electronic) | 9784885523304 |
Publication status | Published - 24 Oct 2020 |
Peer-reviewed | Yes |
Externally published | Yes |
Publication series
Series | IEICE proceeding series (ISITA) |
---|
Conference
Title | 16th International Symposium on Information Theory and its Applications, ISITA 2020 |
---|---|
Duration | 24 - 27 October 2020 |
City | Virtual, Kapolei |
Country | United States of America |
External IDs
ORCID | /0000-0002-1702-9075/work/165878301 |
---|