Hamming complement --- Introduction ---

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

It is therefore very important to find such codes which are as efficient as possible, that is, for a fixed code length, find a code composed of as many words as possible, while respecting the minimum distance among the words.

With Hamming complement, 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).

Now you can go to with a difficulty level . Knowledge on the geometry of the finite field FF2 and coding theory are necessary for this activity. The most recent version

This page is not in its usual appearance because WIMS is unable to recognize your web browser.

In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press ``Enter''.

Please 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. interactive exercises, online calculators and plotters, mathematical recreation and games

Keywords: interactive mathematics, interactive math, server side interactivity, coding, Hamming distance, cyclic code, linear code, error correcting code