Overview

perfect codes


Related Overviews

 

'perfect codes' can also refer to...

 

More Like This

Show all results sharing this subject:

  • Computing

GO

Show Summary Details

Quick Reference

Error-correcting codes in which the Hamming spheres surrounding the codewords entirely fill the Hamming space without overlap. These spheres all have radius e, where the code can correct e errors, and their centers (codewords) are separated from each other by a distance of (2e + 1); thus the spheres have no points (words) in common where they touch, but their surfaces are separated by unit distance with no points between them. Perfect codes attain the Hamming bound exactly.

The only binary linear perfect codes are the repetition codes, the Hamming codes, and the (23,12) Golay code.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.