Binary codes having a minimum distance equal to 3 are very interesting, because they are the first codes allowing the correction of transmission errors.

You can have a training on this question. The server will give you a `partial' code with several words, and it is up to you to add other words to the code, as many as possible, while respecting the minimum distance 3. And we assure you that each exercise proposed has at least one solution which is linear or affine (but you are free to find other solutions).

Knowledge on the geometry of the finite field ${F}_{2}$ and coding theory are necessary for this activity. The most recent versionPlease take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.

- Description: find a maximum of binary words respecting a given Hamming distance. exercises interactifs, calcul et tracé de graphes en ligne
- Keywords: interactive mathematics, interactive math, server side interactivity, coding,informatics, hamming, cyclic_code, error_correcting_codes