TY - JOUR
T1 - Further results on the semilinear equivalence of linear codes
AU - Liu, Zihui
AU - Zeng, Xiangyong
PY - 2013/2/1
Y1 - 2013/2/1
N2 - Based on relative subcodes, we address an equivalent condition for a one-to-one semilinear mapping between two linear codes to be in fact a semimonomial transformation, that is, the underlying two codes are semilinearly equivalent. The result in the present paper substantially improves the equivalent condition in recent literatures. Moreover, it also generalizes the well-known MacWilliams theorem of code equivalence.
AB - Based on relative subcodes, we address an equivalent condition for a one-to-one semilinear mapping between two linear codes to be in fact a semimonomial transformation, that is, the underlying two codes are semilinearly equivalent. The result in the present paper substantially improves the equivalent condition in recent literatures. Moreover, it also generalizes the well-known MacWilliams theorem of code equivalence.
KW - Relative generalized Hamming weight
KW - Relative projective subspace
KW - Relative subcode
KW - Semilinear code equivalence
KW - Value assignment
UR - http://www.scopus.com/inward/record.url?scp=84884202148&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2012.09.007
DO - 10.1016/j.ins.2012.09.007
M3 - Article
AN - SCOPUS:84884202148
SN - 0020-0255
VL - 221
SP - 571
EP - 578
JO - Information Sciences
JF - Information Sciences
ER -