Coding theory MOC

Divisible code

A 𝑞-ary linear code C ≤𝕂𝑛𝑞 is 𝑚-divisible iff all codewords have Hamming weight divisible by 𝑚, #m/def/code i.e. wt⁡⃗𝐜 ∈𝑚ℤ for all ⃗𝐜 ∈C. In particular,

Properties


#state/tidy | #lang/en | #SemBr