By the resultant theory, the E-characteristic polynomial of a real rectangular tensor is defined. It is proved that an E-singular value of a real rectangular tensor is always a root of the E-characteristic polynomial....By the resultant theory, the E-characteristic polynomial of a real rectangular tensor is defined. It is proved that an E-singular value of a real rectangular tensor is always a root of the E-characteristic polynomial. The definition of the regularity of square tensors is generalized to the rectangular tensors, and in the regular case, a root of the Echaracteristic polynomial of a special rectangular tensor is an E-singular value of the rectangular tensor. Moreover, the best rank-one approximation of a real partially symmetric rectangular tensor is investigated.展开更多
Linear recurring sequences over finite fields play an important role in coding theory and cryptography. It is known that subfield subcodes of linear codes yield some good codes. In this paper, we study linear recurrin...Linear recurring sequences over finite fields play an important role in coding theory and cryptography. It is known that subfield subcodes of linear codes yield some good codes. In this paper, we study linear recurring sequences and subfield subcodes. Let Mqm(f(x)) denote the set of all linear recurring sequences over Fqm with characteristic polynomial f(x) over Fqm . Denote the restriction of Mqm(f(x)) to sequences over Fq and the set after applying trace function to each sequence in Mqm(f(x)) by Mqm(f(x)) | Fq and Tr( Mqm(f(x))), respectively. It is shown that these two sets are both complete sets of linear recurring sequences over Fq with some characteristic polynomials over Fq. In this paper, we firstly determine the characteristic polynomials for these two sets. Then, using these results, we determine the generator polynomials of subfield subcodes and trace codes of cyclic codes over Fqm .展开更多
文摘By the resultant theory, the E-characteristic polynomial of a real rectangular tensor is defined. It is proved that an E-singular value of a real rectangular tensor is always a root of the E-characteristic polynomial. The definition of the regularity of square tensors is generalized to the rectangular tensors, and in the regular case, a root of the Echaracteristic polynomial of a special rectangular tensor is an E-singular value of the rectangular tensor. Moreover, the best rank-one approximation of a real partially symmetric rectangular tensor is investigated.
基金supported by National Key Basic Research Program of China(973 Program)(Grant No.2013CB834204)National Natural Science Foundation of China(Grant Nos.61171082 and 10990011)
文摘Linear recurring sequences over finite fields play an important role in coding theory and cryptography. It is known that subfield subcodes of linear codes yield some good codes. In this paper, we study linear recurring sequences and subfield subcodes. Let Mqm(f(x)) denote the set of all linear recurring sequences over Fqm with characteristic polynomial f(x) over Fqm . Denote the restriction of Mqm(f(x)) to sequences over Fq and the set after applying trace function to each sequence in Mqm(f(x)) by Mqm(f(x)) | Fq and Tr( Mqm(f(x))), respectively. It is shown that these two sets are both complete sets of linear recurring sequences over Fq with some characteristic polynomials over Fq. In this paper, we firstly determine the characteristic polynomials for these two sets. Then, using these results, we determine the generator polynomials of subfield subcodes and trace codes of cyclic codes over Fqm .
