On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes | Zendy

Zihui Liu | Zendy; Jie Wang | Zendy; Xin-Wen Wu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes

Author(s) -

Zihui Liu,

Jie Wang,

Xin-Wen Wu

Publication year - 2010

Publication title -

siam journal on discrete mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.843

H-Index - 66

eISSN - 1095-7146

pISSN - 0895-4801

DOI - 10.1137/090770254

Subject(s) - mathematics , hamming code , hamming bound , hamming graph , hamming distance , projective test , code (set theory) , linear code , discrete mathematics , hamming weight , hamming(7,4) , combinatorics , pure mathematics , algorithm , block code , computer science , decoding methods , set (abstract data type) , programming language

We first present an equivalent definition of relative generalized Hamming weights of a linear code and its subcodes, and develop a method using finite projective geometry. Making use of the equivalent definition and the projective-geometry method, all of the relative generalized Hamming weights of a 3-dimensional q-ary linear code and its subcodes will be determined.Full Tex

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research