Covering radius and the chromatic number of Kneser graphs
Journal of Combinatorial Theory Series A
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
On the classification of APN functions up to dimension five
Designs, Codes and Cryptography
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
On Almost Perfect Nonlinear Functions Over
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We prove that given a binary Hamming code $${{\mathcal{H}}^n}$$ of length n = 2 m 驴 1, m 驴 3, or equivalently a projective geometry PG(m 驴 1, 2), there exist permutations $${\pi \in \mathcal{S}_n}$$ , such that $${{\mathcal{H}}^n}$$ and $${\pi({\mathcal{H}}^n)}$$ do not have any Hamming subcode with the same support, or equivalently the corresponding projective geometries do not have any common flat. The introduced permutations are called AF permutations. We study some properties of these permutations and their relation with the well known APN functions.