The Error Correction Zoo collects and organizes error-correcting codes.

Error correction is what ensures that the audio in your phone calls remains sharp, your hard drives do not deteriorate too quickly, and signals can be reliably transmitted to remote satellites.

Over multiple decades, and with the explosion of the information age, an enormous variety of error-correction schemes were developed. Recently, a radically new type of error correction was introduced, one that can protect the quantum information that is stored in a quantum computer or that is communicated over a quantum network.

We created the Error Correction Zoo to categorize and to organize known classical and quantum error-correction schemes. It is inspired by other similar zoos, including the complexity zoo, the quantum algorithm zoo, the quantum protocol zoo, and the qubit zoo.

Code entries form the primary content of the zoo. An entry can be a specific instance of a well-known code or a large family of codes, depending on community interest. The idea is to have a dedicated up-to-date webpage for each family, collecting original work, related protocols, and real-world implementations. Codes are organized into kingdoms by alphabet (Hilbert space structure) in the classical (quantum) case, with “parent” and “cousin” fields listing notable relations and connections.

A founding feature of the EC zoo is separation of data storage from presentation. Code information displayed in the zoo is stored in a structured form on github.com. This mechanism allows for the presentation of data in various ways, including through a code graph and code lists.

We hope you enjoy your visit! If you have feedback, please drop us a line. We'd love to hear from you.

The Zoo Team

A team of wonderful people have made it possible to create and maintain this zoo.

Contributing

Do you feel like contributing? Don't hesitate to send us an email or a pull request! You can also check out our contributing guidlines.

Licensing information

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.