Coding theory MOC

Perfect code

A -ary code of length in alphabet is said to be a perfect -error correcting code, or briefly a perfect code, iff¹ code

• it has ^minimumDistance ; and
• for every string there exists a unique codeword with .

equivalently, has a minimum distance and ^coveringRadius . See also Quasi-perfect code.

Properties

• Sphere packing condition for a perfect code
• The extended code of a linear perfect code is quasi-perfect.

---

tidy | en | sembr

Footnotes

1. 1999. Introduction to coding theory, §3.1, p. 34 ↩