The definitions of quasimeromorphic mappings from Cn to P1n, where P1 C U {∞}, P1n= P1×P1× ×P1(n-times) are introduced. From an inequality of the value distribution of quasimeromorphic functions of s...The definitions of quasimeromorphic mappings from Cn to P1n, where P1 C U {∞}, P1n= P1×P1× ×P1(n-times) are introduced. From an inequality of the value distribution of quasimeromorphic functions of single variable, it follows that a normal criterion for the family of quasimeromorphic functions of several complex variables. Futhermore, a normal criterion for the family of quasimeromorphic mappings from Cn to P1n has been obtained.展开更多
Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) error correcting codes are widely used in digital technology. An important problem in the implementation of RS and BCH decoding is the fast finding of the error p...Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) error correcting codes are widely used in digital technology. An important problem in the implementation of RS and BCH decoding is the fast finding of the error positions (the roots of error locator polynomials). Several fast root-finding algorithms for polynomials over finite fields have been proposed. In this paper we give a generalization of the Goertzel algorithm. Our algorithm is suitable for the parallel hardware implementation and the time of multiplications used is restricted by a constant.展开更多
文摘The definitions of quasimeromorphic mappings from Cn to P1n, where P1 C U {∞}, P1n= P1×P1× ×P1(n-times) are introduced. From an inequality of the value distribution of quasimeromorphic functions of single variable, it follows that a normal criterion for the family of quasimeromorphic functions of several complex variables. Futhermore, a normal criterion for the family of quasimeromorphic mappings from Cn to P1n has been obtained.
基金This work was partially supported by the National Natural Science Foundation of China (Grant Nos. 60433050, 90607005)
文摘Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) error correcting codes are widely used in digital technology. An important problem in the implementation of RS and BCH decoding is the fast finding of the error positions (the roots of error locator polynomials). Several fast root-finding algorithms for polynomials over finite fields have been proposed. In this paper we give a generalization of the Goertzel algorithm. Our algorithm is suitable for the parallel hardware implementation and the time of multiplications used is restricted by a constant.
