Further results on the semilinear equivalence of linear codes

Zihui Liu; Xiangyong Zeng

doi:10.1016/j.ins.2012.09.007

Further results on the semilinear equivalence of linear codes

Zihui Liu^*, Xiangyong Zeng

^*此作品的通讯作者

数学学院

Hubei University

科研成果: 期刊稿件 › 文章 › 同行评审

1 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	571-578
页数	8
期刊	Information Sciences
卷	221
DOI	https://doi.org/10.1016/j.ins.2012.09.007
出版状态	已出版 - 1 2月 2013

访问文件

10.1016/j.ins.2012.09.007

其它文件与链接

链接到 Scopus 的出版物

引用此

Liu, Z., & Zeng, X. (2013). Further results on the semilinear equivalence of linear codes. Information Sciences, 221, 571-578. https://doi.org/10.1016/j.ins.2012.09.007

@article{e4539b1153fb44d292d5e167b663451b,

title = "Further results on the semilinear equivalence of linear codes",

abstract = "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.",

keywords = "Relative generalized Hamming weight, Relative projective subspace, Relative subcode, Semilinear code equivalence, Value assignment",

author = "Zihui Liu and Xiangyong Zeng",

year = "2013",

month = feb,

day = "1",

doi = "10.1016/j.ins.2012.09.007",

language = "English",

volume = "221",

pages = "571--578",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

}

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 -

Further results on the semilinear equivalence of linear codes

摘要

访问文件

其它文件与链接

指纹

引用此