Punctured Low-Bias Codes Behave Like Random Linear Codes

Guruswami, Venkatesan; Mosheiff, Jonathan

doi:10.1109/focs54457.2022.00011

Cited by 9 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This result is independent of its applications to hashing, and it can be strengthened if random linear codes are replaced with the ensemble of all binary codes of the same cardinality. More precisely, if C ′ is the set of all (n, q k ) q codes, then d) , which shows that ( 17) is a better bound than (16). Since this result does not have direct implication for hashing, we will omit the proof.…”

Section: Smoothing-based Randomness Extractionmentioning

confidence: 95%

“…This version of Lemma 3.4 has been used in the literature to prove that some ensembles of linear codes achieve list decoding capacity [29]. In particular, it is known that some random ensembles such as LDPC codes [29] and randomly punctured low-bias codes [16] approximately satisfy (19). The aforementioned papers used this fact to show that these code ensembles also achieve list decoding capacity.…”

Section: Smoothing-based Randomness Extractionmentioning

confidence: 99%

See 1 more Smart Citation

Smoothing of Binary Codes, Uniform Distributions, and Applications

Pathegama,

Barg

2023

Entropy

View full text Add to dashboard Cite

The action of a noise operator on a code transforms it into a distribution on the respective space. Some common examples from information theory include Bernoulli noise acting on a code in the Hamming space and Gaussian noise acting on a lattice in the Euclidean space. We aim to characterize the cases when the output distribution is close to the uniform distribution on the space, as measured by the Rényi divergence of order α∈(1,∞]. A version of this question is known as the channel resolvability problem in information theory, and it has implications for security guarantees in wiretap channels, error correction, discrepancy, worst-to-average case complexity reductions, and many other problems. Our work quantifies the requirements for asymptotic uniformity (perfect smoothing) and identifies explicit code families that achieve it under the action of the Bernoulli and ball noise operators on the code. We derive expressions for the minimum rate of codes required to attain asymptotically perfect smoothing. In proving our results, we leverage recent results from harmonic analysis of functions on the Hamming space. Another result pertains to the use of code families in Wyner’s transmission scheme on the binary wiretap channel. We identify explicit families that guarantee strong secrecy when applied in this scheme, showing that nested Reed–Muller codes can transmit messages reliably and securely over a binary symmetric wiretap channel with a positive rate. Finally, we establish a connection between smoothing and error correction in the binary symmetric channel.

show abstract

Section: Smoothing-based Randomness Extractionmentioning

confidence: 95%