检索结果-南通市图书馆

THE HAMMING DISTANCES OF NEGACYCLIC CODES OF LENGTH 2~s OVER GR (2~a,m)

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2008年第1期21卷 60-66页

作者： Shixin ZHU xiaoshan KAI Department of Applied Mathematics Hefei University of Technology Hefei 230009 China.

The Hamming distances of all negacyclic codes of length 28 over the Gaiois ring GR （2^α, m） are given. In particular, the Lee distances of all negacyclic codes over Z4 of length 2^s are obtained. The Gray images of... 详细信息

关键词： Gray map Hamming distances Hamming weights negacyclic codes.

Delays for Both Pedestrians Classified and Vehicles at a Signalized Crosswalk

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2016年第1期29卷 202-218页

作者： GUO Renyong LU xiaoshan College of Computer Science Inner Mongolia University School of Transportation Engineering Hefei University of Technology

Delays of both pedestrians,who are classified according to whether complying with traffic law,and vehicles at a signalized crosswalk are analyzed in this *** truncated Adams' model is applied to generate the probability and mean of delay of pedestrians non-complying with traffic *** the section-based traffic queuing-theory and the stochastic decomposition property of M/G/1vacation system with exhaustive service,the mean delay of vehicles is formulated.A multi-objective optimization model simultaneously minimizing the delays of pedestrians and vehicles during a signal period is *** effects,which several model parameters have on the delays and the optimal solution of the model,are illustrated by numerical examples.

关键词： Optimization pedestrians delay signalized crosswalk transportation management vehicles delay

On Self-dual and LCD Double Circulant Codes over a Non-chain Ring

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第5期28卷 1018-1024页

作者： YAO Ting ZHU Shixin KAI xiaoshan School of Mathematics Hefei University of Technology

In this paper, we study double circulant codes of length 2n over the non-chain ring R = Fq+ v Fq+v2Fq, where q is an odd prime power and v3= v. Exact enumerations of self-dual and LCD double circulant codes of length 2n over R are derived. When n is an odd prime,using random coding, we obtain families of asymptotically good self-dual and LCD codes of length 6n over Fq.

关键词： Double circulant codes Non-chain ring Self-dual codes Linear complementary dual(LCD) codes Artin conjecture

ON THE RAYLEIGH QUOtieNT FOR SINGULAR VALUES

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computational Mathematics 2007年第5期25卷 512-521页

作者： xiaoshan Chen Wen Li School of Mathematical Sciences South China Normal University Guangzhou 510631 China

In this paper, the theoretical analysis for the Rayleigh quotient matrix is studied, some results of the Rayleigh quotient （matrix） of Hermitian matrices are extended to those for arbitrary matrix on one hand. On the other hand, some unitarily invariant norm bounds for singular values are presented for Rayleigh quotient matrices. Our results improve the existing bounds.

关键词： The singular value Rayleigh quotient Canonical angle matrix

Solving Boolean equation systems and applications in cryptanalysis

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第5期59卷 13-14页

作者： xiaoshan GAO Zhenyu HUANG Academy of Mathematics and Systems Science Chinese Academy of Sciences State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences

Solving Boolean equation systems plays a fundamental role in many important fields such as coding theory,cryptology,and analysis of computer *** find efficient algorithms for solving Boolean equations and estimate their complexities are central issues in theoretic computer *** this note,we will survey recent results on the complexity of using the approximate algorithm to solve Boolean equation systems and on new characteristic set algorithms for solving Boolean equation systems and their applications in cryptanalysis.

关键词： MAX Solving Boolean equation systems and applications in cryptanalysis MQ TDCS

A brief review of ferroelectric control of magnetoresistance in organic spin valves

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Materiomics 2018年第1期4卷 1-12页

作者： xiaoshan Xu Department of Physics and Astronomy Nebraska Center for Materials and NanoscienceUniversity of NebraskaLincolnNE 68588USA

Magnetoelectric coupling has been a trending research topic in both organic and inorganic materials and *** concept of controlling magnetism using an electric field is particularly appealing in energy efficient *** this spirit,ferroelectricity has been introduced to organic spin valves to manipulate the magneto transport,where the spin transport through the ferromagnet/organic spacer interfaces(spinterface)are under intensive *** ferroelectric materials in the organic spin valves provide a knob to vary the interfacial energy alignment and the interfacial crystal structures,both are critical for the spin *** this review,we introduce the recent efforts of controlling magnetoresistance of organic spin valves using ferroelectricity,where the ferroelectric material is either inserted as an interfacial layer or used as a spacer *** realization of the ferroelectric control of magneto transport in organic spin valve,advances our understanding in the spin transport through the ferromagnet/organic interface,and suggests more functionality of organic spintronic devices.

关键词： Organic spin valve Ferroelectricity Spinterface Magnetoresistance

Asymptotically Good Additive Cyclic Codes

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2020年第5期29卷 859-864页

作者： YAO Ting ZHU Shixin KAI xiaoshan School of Mathematics Hefei University of Technology

ZPZPs-additive cyclic codes have been proved to be asymptotically good by Yao and *** binary Hamming scheme,we introduce a type of Z2（Z2+uZ2）-additive cyclic codes generated by pairs of *** R be the chain ring Z2+uZ2,where u2=*** asymptotic rates and relative distances of this class of codes are presented by establishing the relationship between the random Z2-R-additive cyclic code and random binary quasi-cyclic code of index *** show that Z2-Radditive cyclic codes are asymptotically good.

关键词： Additive cyclic codes Random codes Relative minimum distance Asymptotically good codes

A FAMILY OF CONSTACYCLIC CODES OVER F_2+μF_2+ vF_2+ uvF_2

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2012年第5期25卷 1032-1040页

作者： xiaoshan KAI Shixin ZHU Liqi WANG School of Mathematics Hefei University of Technology National Mobile Communications Research Laboratory Southeast University

This paper studies （1 ＋ u）-constacyelic codes over the ring F2 ＋ uF2 ＋ vF,2 ＋ uvF2. It is proved that the image of a （1 ＋ u）-constacyclic code of length n over F2 ＋ uF2 ＋ vF2 ＋uvF2 under a Gray map is a distance invariant binary quasi-cyclic code of index 2 and length 4n. A set of generators of such constacyclic codes for an arbitrary length is determined, Some optimal binary codes are obtained directly from （1 ＋ u）-constacyclic codes over F2 ＋ uF2 ＋ vF2 ＋ uvF2.

关键词： Constacyclic code generator polynomial Gray distance Gray map.

On the Gray Images of Some Constacyclic Codes over Fp ＋ uFp ＋ u^2Fp

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2016年第3期29卷 842-849页

作者： YU Haifeng ZHU Shixin KAI xiaoshan Department of Mathematics and Physics Hefei University Hefei 230601 China. School of Mathematics Hefei University of Technology Hefei 230009 China National Mobile Communications Research Laboratory Southeast University Nanjinq 210096 China.

Abstract Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, a new Gray map between codes over Fp ＋ uFp ＋ u^2Fp and codes over Fp is defined, where p is an odd prime. By means of this map, it is shown that the Gray image of a linear （1 ＋ u ＋ u2）-constacyclic code over Fp ＋ uFp ＋ u^2Fp of length n is a repeated-root cyclic code over Fp of length pn. Furthermore, some examples of optimal linear cyclic codes over F3 from （1 ＋ u ＋ u2）-constacyclic codes over F3 ＋ uF3 ＋ u^2F3 are given.

关键词： Constacyclic code cyclic code Gray map.