Design of Short Blocklength Wiretap Channel Codes: Deep Learning and Cryptography Working Hand in Hand

Rana, Vidhi; Chou, Remi A.

doi:10.1109/itw48936.2021.9611401

Cited by 5 publications

(1 citation statement)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3) Finite-Blocklength-Specific Constructions: Code designs intended for performance at short blocklength have typically been either brute force searches for best codes [19], which provide optimal performance but which are limited to very short blocklength, and autoencoders [20], [21], which produce promising results but which cannot readily be applied to explicit design of coset codes. One code design technique useful for moderate-blocklength coset codes was developed by Al-Hassan, Ahmed, and Tomlinson in [10].…”

Section: Finite Blocklength Code Constructionmentioning

confidence: 99%

Subspace Decomposition of Extreme-Rate Secrecy Codes

Hunn

Harrison

2022

2022 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

A new method is explored for analyzing the performance of coset codes over the binary erasure wiretap channel (BEWC) by decomposing the code over subspaces of the code space. This technique leads to an improved algorithm for calculating equivocation loss. It also provides a continuous-valued function for equivocation loss, permitting proofs of local optimality for certain finite-blocklength code constructions, including a code formed by excluding from the generator matrix all columns which lie within a particular subspace. Subspace decomposition is also used to explore the properties of an alternative secrecy code metric, the χ 2 divergence. The χ 2 divergence is shown to be far simpler to calculate than equivocation loss. Additionally, the codes which are shown to be locally optimal in terms of equivocation are also proved to be globally optimal in terms of χ 2 divergence.

show abstract