Quasi-perfect code
A
where𝑒 = ⌊ 𝑑 − 1 2 ⌋ is the minimum distance of𝑑 ; andC - the covering radius of
isC .𝑒 + 1
Properties
- The extended code of a linear perfect code is quasi-perfect.
#state/tidy | #lang/en | #SemBr
A
#state/tidy | #lang/en | #SemBr