Abstract
The upper bounds on the difference between the third greedy weight and the third generalized Hamming weight of 4-dimensional q-ary codes are obtained by using the finite geometry method. The codes achieving the upper bounds are constructed, and these codes are optimal with respect to the security when they are used in the wire-tap channel of type II with the coset coding scheme.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
