Abstract
Motivated by the concepts of the relative generalized Hamming weight and the greedy weight, the relative greedy weight is introduced, and then it is shown that the codes achieving the upper bounds on the relative greedy weight are optimal on the security of the transmitted data symbols in the wire-tap channel. Based on such applications, the finite geometry method is generalized, and by using the generalized finite geometry method, certain upper bounds on the third relative greedy weight of 4-dimensional codes with respect to 1-dimensional subcodes are first determined, and then optimal codes are constructed with respect to these obtained upper bounds.
Sign-in/Register to access full text options 
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 callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
