arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.12091cs.ITcs.CRcs.MMeess.SPmath.IT
收藏

用于隐私、保密和存储的随机嵌套极化子码构造

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

Onur Günlü, Peter Trifonov, Muah Kim, Rafael F. Schaefer, Vladimir Sidorenko

摘要:

我们考虑极化子码(PSC),其是具有动态冻结符号的极化码(PC),以与对应的PC相比增加最小距离。提出了一种随机嵌套PSC结构,它由一个低速率PSC和一个高速率PC组成,可用于列表和顺序连续消除解码器。该代码构造旨在利用边信息执行有损压缩。嵌套PSC被用于具有物理标识符的密钥协商问题。与具有相同列表大小的嵌套PC相比,在秘密密钥与存储速率比率方面的增益被示出以表明嵌套PSC在嵌套PC上显着改善。嵌套的PSC的性能提高较大的列表大小,这是不是嵌套PC的情况下考虑。

英文摘要:

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 is shown to improve with larger list sizes, which is not the case for nested PCs considered.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑