On the second relative greedy weight

Based on the wire-tap channel of type II with two users given by Luo et al. in 2005, we introduce the relative greedy weights. A finite projective geometry method is presented in order to describe the relative greedy weights. By using this finite projective geometry method, the optimal 3-dimensional q-ary codes are searched so as to maximize the effort for the adversary to obtain the second data symbol on condition that he has obtained the first data symbol from the wire-tap channel of type II with two users.