지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록· 키워드
오류제보하기
The set $D$ of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let $D$ be a subset of $\mathbb{F}_2^n$, and $W$ (resp.~$V$) be a subspace of $\mathbb{F}_2$ (resp.~$\mathbb{F}_2^n$). We define the linear code $\mathcal{C}_D(W; V)$ with defining set $D$ and restricted to $W, V$ by \[ \mathcal{C}_D(W; V) = \{(s+u\cdot x)_{x\in D^*} \,|\, s\in W, u\in V\}. \] We obtain two- or three-weight codes by taking $D$ to be a Vasil'ev code of length $n=2^m-1 (m \geq 3)$ and a suitable choices of $W$. We do the same job for $D$ being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.
목차
등록된 정보가 없습니다.
참고문헌 (11)
참고문헌 신청
A. Ashikhmin / 1998 / Minimal vectors in linear codes / IEEE Transactions on Information Theory 44(5):2010~2017
R. Calderbank / 1986 / The geometry of two-weight codes / Bull. London Math. Soc 18(2):97~122
Seunghwan Chang / 2018 / Linear codes from simplicial complexes / Designs, Codes and Cryptography 86(10):2167~2181
Yanling Chen / 2010 / A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes / IEEE Transactions on Information Theory 56(9):4309~4320
G. D. Cohen / 2013 / Cryptography and coding / Springer :85~98
R. Calderbank / 1986 / The geometry of two-weight codes / Bull. London Math. Soc 18(2):97~122
Seunghwan Chang / 2018 / Linear codes from simplicial complexes / Designs, Codes and Cryptography 86(10):2167~2181
Yanling Chen / 2010 / A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes / IEEE Transactions on Information Theory 56(9):4309~4320
G. D. Cohen / 2013 / Cryptography and coding / Springer :85~98
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
A construction of two-weight codes and its applications
대한수학회보
2017 .01
-
New extremal binary self-dual codes of lengths 66 and 68 from codes over Rk,m
대한수학회보
2017 .01
-
ONE-HOMOGENEOUS WEIGHT CODES OVER FINITE CHAIN RINGS
대한수학회보
2015 .01
-
Quasi-cyclic self-dual codes with four factors
한국수학논문집
2024 .09
-
On closing codes
대한수학회보
2018 .01
-
Linear and non-linear loop-transversal codes in error-correction and graph domination
대한수학회보
2020 .01
-
The t-wise intersection of relative three-weight codes
대한수학회보
2017 .07
-
ON THE EXTREMAL TYPE I BINARY SELF-DUAL CODES WITH NEAR-MINIMAL SHADOW
Journal of applied mathematics & informatics
2019 .01
-
Self-dual codes over ${\mathbb Z}_{p^2}$ of small lengths
한국수학논문집
2017 .01
-
QUANTUM CODES FROM CYCLIC CODES OVER F<sub>4</sub> + vF<sub>4</sub>
Journal of applied mathematics & informatics
2016 .01
-
On LCD codes over finite chain rings
대한수학회보
2020 .01
-
Construction for self-orthogonal codes over a certain non-chain Frobenius ring
대한수학회지
2022 .01
-
Extremal Type I additive self-dual codes over $GF(4)$ with near-minimal shadow
한국수학논문집
2018 .01
-
Complete weight enumerators of some classes of linear codes with a few weights
대한수학회보
2018 .01
-
Quantum codes with improved minimum distance
대한수학회보
2019 .01
-
AN EFFICIENT CONSTRUCTION OF SELF-DUAL CODES
대한수학회보
2015 .01
-
Cyclic and constacyclic self-dual codes over R_k
대한수학회보
2017 .07
-
On quantum codes from cyclic codes over a class of nonchain rings
대한수학회보
2016 .01
-
Glift codes over chain ring and non-chain ring $R_{e,s}$
대한수학회보
2022 .11
-
An altered group ring construction of the $[24,12,8]$ and $[48,24,12]$ Type II linear block code
대한수학회보
2023 .05
이 논문의 저자 정보
최근 본 자료
댓글(0)
0