Flags of almost affine codes
Trygve Johnsen, Hugues Verdure
TL;DR
This paper explores the use of almost affine codes in a two-party wire-tap channel, relating cryptological performance to code profiles similar to generalized Hamming weights in linear codes.
Contribution
It introduces a novel framework connecting almost affine codes with wire-tap channel security analysis, extending concepts from linear code theory.
Findings
Cryptological performance linked to code profiles
Profiles are analogues of generalized Hamming weights
Framework extends linear code concepts to almost affine codes
Abstract
We describe a two-party wire-tap channel of type II in the framework of almost affine codes. Its cryptological performance is related to some relative profiles of a pair of almost affine codes. These profiles are analogues of relative generalized Hamming weights in the linear case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cellular Automata and Applications