Primal-dual distance bounds of linear codes with application to cryptography

Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh +2

Let $N(d,d^{\perp })$ denote the minimum length $n$ of a linear code $C$ with $d$ and $d^{\perp }$, where $d$ is the minimum Hamming distance of $C$ and $d^{\perp }$ is the minimum Hammin…