In this paper we give a new construction of authentication codes with arbitration using orthogonal spaces. Some parameters and the probabilities of successful attacks are computed.
M_(p)-Sequences or M-Sequence over Fp not used so much in current time as binary M-Sequences and it is pending with the difficult to construct there coders and decoders of M_(p)-Sequences further these reasons there i...M_(p)-Sequences or M-Sequence over Fp not used so much in current time as binary M-Sequences and it is pending with the difficult to construct there coders and decoders of M_(p)-Sequences further these reasons there is expensive values to construct them but the progress in the technical methods will be lead to fast using these sequences in different life’s ways,and these sequences give more collection of information and distribution them on the input and output links of the communication channels,building new systems with more complexity,larger period,and security.In current article we will study the construction of the multiplication M_(p)-Sequence{z_(n)}and its linear equivalent,this sequences are as multiple two sequences,the first sequence{Sn}is an arbitrary M_(p)-Sequence and the second sequence{ζ_(n)}reciprocal sequence of the first sequence{S_(n)},length of the sequence{z_(n)},period,orthogonal and the relations between the coefficients and roots of the characteristic polynomial of f(x)and it’s reciprocal polynomial g(x)and compare these properties with corresponding properties in M-Sequences.展开更多
By taking as blocks certain subspace-pairs of an orthogonal geometry over a finite field with characteristic≠2 we construct some new types of BIB designs and PBIB designs whose parameters are also given.
Optical orthogonal code is the main signature code employed by optical CDMA system. Starting from modern mathematics theory, finite projective geometry and Galois theory, the essential connection between optical ortho...Optical orthogonal code is the main signature code employed by optical CDMA system. Starting from modern mathematics theory, finite projective geometry and Galois theory, the essential connection between optical orthogonal code designing and finite geometry theory were discussed; find out the corresponding relationship between the parameter of OOC and that of finite geometry space. In this article, the systematic theory of OOC designing based on projective geometry is established in detail. The designing process and results of OOC on projective plane PG(2,q) and on m-dimension projective space are given respectively. Furthermore, the analytical theory for the corresponding relation between OOC with high cross-correlation and k-D manifold of projective space is set up. The OOC designing results given in this article have excellent performance, whose maximum cross-correlation is 1, and the cardinality reaches the Johnson upper bound, i.e. it realizes the optimization in both MUI and system capacity.展开更多
文摘In this paper we give a new construction of authentication codes with arbitration using orthogonal spaces. Some parameters and the probabilities of successful attacks are computed.
文摘M_(p)-Sequences or M-Sequence over Fp not used so much in current time as binary M-Sequences and it is pending with the difficult to construct there coders and decoders of M_(p)-Sequences further these reasons there is expensive values to construct them but the progress in the technical methods will be lead to fast using these sequences in different life’s ways,and these sequences give more collection of information and distribution them on the input and output links of the communication channels,building new systems with more complexity,larger period,and security.In current article we will study the construction of the multiplication M_(p)-Sequence{z_(n)}and its linear equivalent,this sequences are as multiple two sequences,the first sequence{Sn}is an arbitrary M_(p)-Sequence and the second sequence{ζ_(n)}reciprocal sequence of the first sequence{S_(n)},length of the sequence{z_(n)},period,orthogonal and the relations between the coefficients and roots of the characteristic polynomial of f(x)and it’s reciprocal polynomial g(x)and compare these properties with corresponding properties in M-Sequences.
文摘By taking as blocks certain subspace-pairs of an orthogonal geometry over a finite field with characteristic≠2 we construct some new types of BIB designs and PBIB designs whose parameters are also given.
基金The National Natural Science Foundationof China (No.:60272048) Natural Science Foundationof JiangsuEducation Department(No.04kjb510057) China Scholarship Council
文摘Optical orthogonal code is the main signature code employed by optical CDMA system. Starting from modern mathematics theory, finite projective geometry and Galois theory, the essential connection between optical orthogonal code designing and finite geometry theory were discussed; find out the corresponding relationship between the parameter of OOC and that of finite geometry space. In this article, the systematic theory of OOC designing based on projective geometry is established in detail. The designing process and results of OOC on projective plane PG(2,q) and on m-dimension projective space are given respectively. Furthermore, the analytical theory for the corresponding relation between OOC with high cross-correlation and k-D manifold of projective space is set up. The OOC designing results given in this article have excellent performance, whose maximum cross-correlation is 1, and the cardinality reaches the Johnson upper bound, i.e. it realizes the optimization in both MUI and system capacity.
基金supported by the National Natural Science Foundation of China(61179026)the Fundamental Research Funds for the Central Universities(Science)(ZXH2012K003)中国民航大学科研基金(2010kys04)~~
