Let C be a binary linear self-dual doubly-even code of length n and minimal weight d. Such codes exist only if 12 = 0 (mod 8). We put II = 24r + 8s, s = 0, 1, 2. It follows from the work of Gleason [2] and of Mallows and Sloane [6] that d s 4r + 4. C is called extremal if d = 4r + 4. In the following, an extremal code means a binary linear self-dual doubly-even extremal code. We use the set-the...

ImageNet pre-training has enabled state-of-the-art results on many tasks. In spite of its recognized contribution to generalization, we observed in this study that also transfers adversarial non-robustness from pre-trained model into fine-tuned the downstream classification We first conducted experiments various datasets and network backbones uncover model. Further analysis was examining learne...