On the second relative greedy weight

Xin Li; Zihui Liu

doi:10.1007/s12095-015-0168-z

On the second relative greedy weight

Xin Li, Zihui Liu^*

^*此作品的通讯作者

数学学院

Beijing Institute of Technology

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

4 引用（Scopus）

摘要

Based on the wire-tap channel of type II with two users given by Luo et al. in 2005, we introduce the relative greedy weights. A finite projective geometry method is presented in order to describe the relative greedy weights. By using this finite projective geometry method, the optimal 3-dimensional q-ary codes are searched so as to maximize the effort for the adversary to obtain the second data symbol on condition that he has obtained the first data symbol from the wire-tap channel of type II with two users.

源语言	英语
页（从-至）	181-197
页数	17
期刊	Cryptography and Communications
卷	9
期	2
DOI	https://doi.org/10.1007/s12095-015-0168-z
出版状态	已出版 - 1 3月 2017

访问文件

10.1007/s12095-015-0168-z

其它文件与链接

链接到 Scopus 的出版物

引用此

Li, X., & Liu, Z. (2017). On the second relative greedy weight. Cryptography and Communications, 9(2), 181-197. https://doi.org/10.1007/s12095-015-0168-z

@article{84a7fcd7caa341338c5c02c36ad40241,

title = "On the second relative greedy weight",

abstract = "Based on the wire-tap channel of type II with two users given by Luo et al. in 2005, we introduce the relative greedy weights. A finite projective geometry method is presented in order to describe the relative greedy weights. By using this finite projective geometry method, the optimal 3-dimensional q-ary codes are searched so as to maximize the effort for the adversary to obtain the second data symbol on condition that he has obtained the first data symbol from the wire-tap channel of type II with two users.",

keywords = "Relative generalized Hamming weight, Relative greedy weight, Support weight, Upper bound, Value assignment",

author = "Xin Li and Zihui Liu",

note = "Publisher Copyright: {\textcopyright} 2015, Springer Science+Business Media New York.",

year = "2017",

month = mar,

day = "1",

doi = "10.1007/s12095-015-0168-z",

language = "English",

volume = "9",

pages = "181--197",

journal = "Cryptography and Communications",

issn = "1936-2447",

publisher = "Springer Publishing Company",

number = "2",

}

TY - JOUR

T1 - On the second relative greedy weight

AU - Li, Xin

AU - Liu, Zihui

PY - 2017/3/1

Y1 - 2017/3/1

N2 - Based on the wire-tap channel of type II with two users given by Luo et al. in 2005, we introduce the relative greedy weights. A finite projective geometry method is presented in order to describe the relative greedy weights. By using this finite projective geometry method, the optimal 3-dimensional q-ary codes are searched so as to maximize the effort for the adversary to obtain the second data symbol on condition that he has obtained the first data symbol from the wire-tap channel of type II with two users.

AB - Based on the wire-tap channel of type II with two users given by Luo et al. in 2005, we introduce the relative greedy weights. A finite projective geometry method is presented in order to describe the relative greedy weights. By using this finite projective geometry method, the optimal 3-dimensional q-ary codes are searched so as to maximize the effort for the adversary to obtain the second data symbol on condition that he has obtained the first data symbol from the wire-tap channel of type II with two users.

KW - Relative generalized Hamming weight

KW - Relative greedy weight

KW - Support weight

KW - Upper bound

KW - Value assignment

UR - http://www.scopus.com/inward/record.url?scp=85009987879&partnerID=8YFLogxK

U2 - 10.1007/s12095-015-0168-z

DO - 10.1007/s12095-015-0168-z

M3 - Article

AN - SCOPUS:85009987879

SN - 1936-2447

VL - 9

SP - 181

EP - 197

JO - Cryptography and Communications

JF - Cryptography and Communications

IS - 2

ER -

On the second relative greedy weight

摘要

访问文件

其它文件与链接

指纹

引用此