549 citations · 1.3k across the 49 of their papers we have counts for
58 papers
Polar Codes Do Not Have Many Affine Automorphisms
Kirill Ivanov, Rüdiger Urbanke
Polar coding solutions demonstrate excellent performance under the list decoding that is challenging to implement in hardware due to the path sorting operations. As a potential sol…
Noether: The More Things Change, the More Stay the Same
Grzegorz Głuch, Rüdiger Urbanke
Symmetries have proven to be important ingredients in the analysis of neural networks. So far their use has mostly been implicit or seemingly coincidental. We undertake a systemati…
On the efficiency of polar-like decoding for symmetric codes
Kirill Ivanov, Rüdiger Urbanke
The recently introduced polar codes constitute a breakthrough in coding theory due to their capacityachieving property. This goes hand in hand with a quasilinear construction, enco…
Adversarial Robustness: What fools you makes you stronger
Grzegorz Głuch, Rüdiger Urbanke
We prove an exponential separation for the sample complexity between the standard PAC-learning model and a version of the Equivalence-Query-learning model. We then show that this s…
Capacity-achieving codes: a review on double transitivity
Kirill Ivanov, Rüdiger L. Urbanke
Recently it was proved that if a linear code is invariant under the action of a doubly transitive permutation group, it achieves the capacity of erasure channel. Therefore, it is o…
Query complexity of adversarial attacks
Grzegorz Głuch, Rüdiger Urbanke
There are two main attack models considered in the adversarial robustness literature: black-box and white-box. We consider these threat models as two ends of a fine-grained spectru…