Four families of minimal binary linear codes with wmin/wmax≤1/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w_{\min
Four families of minimal binary linear codes with wmin/wmax≤1/2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w_{\min
复制标题
DOI:
10.1007/s00200-018-0367-x
复制
发表时间:
2018-08
期刊:
影响因子:
--
通讯作者:
Wenqin Zhang;Haode Yan;Honglei Wei
中科院分区:
文献类型:
--
作者:
Wenqin Zhang;Haode Yan;Honglei Wei
As a special type of linear codes, minimal linear codes have important applications in secret sharing. Up to now, only a few infinite families of minimal binary linear codes withwere reported in the literature, while vast knowledge exists on the ones with. Herein,andrespectively denote the minimum and maximum nonzero Hamming weights in a linear code. Recently, several classes of linear codes with certain properties were constructed byZhou et al.from a generic construction. The objective of this paper is to obtain four families of minimal binary linear codes withfrom those linear codes proposed byZhou et al.The parameters of our minimal linear codes are quite different from known ones. Based on the properties of Krawtchouk polynomials, the weight distributions of all these four families of binary linear codes are established.