A construction of codes with linearity from two linear codes

Chengju Li; Sunghan Bae; Haode Yan

doi:10.1007/s12095-016-0193-6

A construction of codes with linearity from two linear codes

Chengju Li^*
, Sunghan Bae
, Haode Yan

^*此作品的通讯作者

软件工程学院

Korea Advanced Institute of Science and Technology
Hong Kong University of Science and Technology

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

7 引用（Scopus）

摘要

Let F_p be a finite field, where p is a prime. This paper presents a new construction of a code C over F_p2 from two linear codes over F_p, which has F_p-linearity and its minimum distance is equal to its minimum nonzero weight. Based on our construction, we shall determine the weight enumerators of some codes defined by quadratic bent functions and simplex codes. It will be shown that these codes have a few nonzero weights.

源语言	英语
页（从-至）	55-69
页数	15
期刊	Cryptography and Communications
卷	9
期	1
DOI	https://doi.org/10.1007/s12095-016-0193-6
出版状态	已出版 - 1 1月 2017

访问文件

10.1007/s12095-016-0193-6

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{a728ca996ca345b792b0075a2489782b,

title = "A construction of codes with linearity from two linear codes",

abstract = "Let Fp be a finite field, where p is a prime. This paper presents a new construction of a code C over Fp2 from two linear codes over Fp, which has Fp-linearity and its minimum distance is equal to its minimum nonzero weight. Based on our construction, we shall determine the weight enumerators of some codes defined by quadratic bent functions and simplex codes. It will be shown that these codes have a few nonzero weights.",

keywords = "Codes, Quadratic bent functions, Simplex codes, Weight enumerators",

author = "Chengju Li and Sunghan Bae and Haode Yan",

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

year = "2017",

month = jan,

day = "1",

doi = "10.1007/s12095-016-0193-6",

language = "英语",

volume = "9",

pages = "55--69",

journal = "Cryptography and Communications",

issn = "1936-2447",

publisher = "Springer Publishing Company",

number = "1",

}

TY - JOUR

T1 - A construction of codes with linearity from two linear codes

AU - Li, Chengju

AU - Bae, Sunghan

AU - Yan, Haode

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Let Fp be a finite field, where p is a prime. This paper presents a new construction of a code C over Fp2 from two linear codes over Fp, which has Fp-linearity and its minimum distance is equal to its minimum nonzero weight. Based on our construction, we shall determine the weight enumerators of some codes defined by quadratic bent functions and simplex codes. It will be shown that these codes have a few nonzero weights.

AB - Let Fp be a finite field, where p is a prime. This paper presents a new construction of a code C over Fp2 from two linear codes over Fp, which has Fp-linearity and its minimum distance is equal to its minimum nonzero weight. Based on our construction, we shall determine the weight enumerators of some codes defined by quadratic bent functions and simplex codes. It will be shown that these codes have a few nonzero weights.

KW - Codes

KW - Quadratic bent functions

KW - Simplex codes

KW - Weight enumerators

UR - https://www.scopus.com/pages/publications/85008312195

U2 - 10.1007/s12095-016-0193-6

DO - 10.1007/s12095-016-0193-6

M3 - 文章

AN - SCOPUS:85008312195

SN - 1936-2447

VL - 9

SP - 55

EP - 69

JO - Cryptography and Communications

JF - Cryptography and Communications

IS - 1

ER -

A construction of codes with linearity from two linear codes

摘要

访问文件

其它文件与链接

学术指纹

引用此