Definition 4. 3.4 The minimum 0-1 distance of a code , denoted by d0→1( ), is defined as the smallest value among the 0-1 distances between any two different codewords in C, i.e., d0→1(C) = min d(ci → cj ), where ci, cj ∈ C. The minimum 0-1 distance of any conventional linear code is 0 since the zero code- word always lies in the code. The following theorem shows how to change a conven- tional linear code of Hamming distance d into a code with 0-1 distance d.
Appears in 2 contracts
Sources: Information Theoretic Secret Key Agreement, Information Theoretic Secret Key Agreement