检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:WANG Yaru LI Fulin ZHU Shixin
机构地区:[1]School of Mathematics, Hefei University of Technology
出 处:《Chinese Journal of Electronics》2019年第4期706-711,共6页电子学报(英文版)
基 金:supported by the National Natural Science Foundation of China(No.61772168,No.60973125,No.61572168);the Natural Science Foundation of Anhui Province(No.1508085MA13)
摘 要:Linear codes with few weighs have many applications in secret sharing.Determining the access structure of the secret sharing scheme based on a linear code is a very difficult problem.We provides a method to construct a class of two-weight torsion codes over finite non-chain ring.We determine the minimal codewords of these torsion codes over the finite non-chain ring.Based on the two-weight codes,we find the access structures of secret sharing schemes.Linear codes with few weighs have many applications in secret sharing. Determining the access structure of the secret sharing scheme based on a linear code is a very difficult problem. We provides a method to construct a class of two-weight torsion codes over finite non-chain ring. We determine the minimal codewords of these torsion codes over the finite non-chain ring. Based on the two-weight codes, we find the access structures of secret sharing schemes.
关 键 词:Finite non-chain ring MACDONALD CODES TORSION CODES SECRET sharing Access structure
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.138.137.25