In this paper, we focus on shortblock nonbinary LDPC(NB-LDPC) codes based on cyclic codes. Based on Tanner graphs' isomorphism, we present an efficient search algorithm for finding non-isomorphic binary cyclic LDP...In this paper, we focus on shortblock nonbinary LDPC(NB-LDPC) codes based on cyclic codes. Based on Tanner graphs' isomorphism, we present an efficient search algorithm for finding non-isomorphic binary cyclic LDPC codes. Notice that the parity-check matrix H of the resulting code is square and not of full rank, and its row weight and column weight are the same. By replacing the ones in the same column of H with a nonzero element of fi nite fi elds GF(q), a class of NB-LDPC codes over GF(q) is obtained. Numerical results show that the constructed codes perform well over the AWGN channel and have fast decoding convergence. Therefore, the proposed NB-LDPC codes provide a promising coding scheme for low-latency and high-reliability communications.展开更多
An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing （CS-NCES） is proposed in this paper. Along with considering the correlations of data spatial and temporal, the a...An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing （CS-NCES） is proposed in this paper. Along with considering the correlations of data spatial and temporal, the algorithm utilizes the similarities between the encoding matrix of network coding and the measurement matrix of compressed sensing. The source node firstly encodes the data, then compresses the coding data by cot-npressed sensing over finite fields. Compared with the network coding scheme, simulation results show that CS-NCES reduces the energy consumption about 25.30/0-34.50/0 and improves the efficiency of data reconstruction about 1.56%- 5.98%. The proposed algorithm can not only enhance the usability of network coding in wireless sensor networks, but also improve the network performance.展开更多
The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficie...The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficients of spring and mass of the system can be obtained and the rigidity and mass matrices of an initially designed structure can be reconstructed through solving linear algebra equations. By using implicit function theorem, the conditions of existence and uniqueness of the solution are also deduced. The theory and method can be used for inverse vibration design of complex structure system.展开更多
A novel unknown input reduced-order observer (UIRO) design scheme is presented. It is proved that unknown input appearing in measurement can be eliminated by a simple algebraic transformation. Then, a new UIRO design ...A novel unknown input reduced-order observer (UIRO) design scheme is presented. It is proved that unknown input appearing in measurement can be eliminated by a simple algebraic transformation. Then, a new UIRO design scheme is proposed via a transformation under no unknown input existing in measurement. Compared with other known results, the condition is weaker than others. So it was further reasonable. The design procedure proposed is simple and straightforward enough to be applied. An example is given to show its efficiency in fault diagnosis.展开更多
Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every lin...Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.展开更多
An excellent introduction to the topic of poset matroids is due to M, Barnabei, G, Nicoletti and L. Pezzoli. In this paper, we extensively study the closure operators of poset matroids and obtain the closure axioms fo...An excellent introduction to the topic of poset matroids is due to M, Barnabei, G, Nicoletti and L. Pezzoli. In this paper, we extensively study the closure operators of poset matroids and obtain the closure axioms for poset matroids; thereby we can characterize poset matroids in terms of the closure axioms. Some corresponding properties of combinatorial schemes are also obtained.展开更多
A novel lower-complexity construction scheme of quasi-cyclic low-density parity-check(QC-LDPC) codes for optical transmission systems is proposed based on the structure of the parity-check matrix for the Richardson-Ur...A novel lower-complexity construction scheme of quasi-cyclic low-density parity-check(QC-LDPC) codes for optical transmission systems is proposed based on the structure of the parity-check matrix for the Richardson-Urbanke(RU) algorithm. Furthermore, a novel irregular QC-LDPC(4 288, 4 020) code with high code-rate of 0.937 is constructed by this novel construction scheme. The simulation analyses show that the net coding gain(NCG) of the novel irregular QC-LDPC(4 288,4 020) code is respectively 2.08 d B, 1.25 d B and 0.29 d B more than those of the classic RS(255, 239) code, the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code at the bit error rate(BER) of 10^(-6). The irregular QC-LDPC(4 288, 4 020) code has the lower encoding/decoding complexity compared with the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code. The proposed novel QC-LDPC(4 288, 4 020) code can be more suitable for the increasing development requirements of high-speed optical transmission systems.展开更多
基金supported in part by National Natural Science Foundation of China under Grants 61372074,91438101,61103143,U1504601,and U1404622Key Scientific and Technological Project of Henan under Grants 162102310589 and 172102310124
文摘In this paper, we focus on shortblock nonbinary LDPC(NB-LDPC) codes based on cyclic codes. Based on Tanner graphs' isomorphism, we present an efficient search algorithm for finding non-isomorphic binary cyclic LDPC codes. Notice that the parity-check matrix H of the resulting code is square and not of full rank, and its row weight and column weight are the same. By replacing the ones in the same column of H with a nonzero element of fi nite fi elds GF(q), a class of NB-LDPC codes over GF(q) is obtained. Numerical results show that the constructed codes perform well over the AWGN channel and have fast decoding convergence. Therefore, the proposed NB-LDPC codes provide a promising coding scheme for low-latency and high-reliability communications.
文摘An energy-saving algorithm for wireless sensor networks based on network coding and compressed sensing （CS-NCES） is proposed in this paper. Along with considering the correlations of data spatial and temporal, the algorithm utilizes the similarities between the encoding matrix of network coding and the measurement matrix of compressed sensing. The source node firstly encodes the data, then compresses the coding data by cot-npressed sensing over finite fields. Compared with the network coding scheme, simulation results show that CS-NCES reduces the energy consumption about 25.30/0-34.50/0 and improves the efficiency of data reconstruction about 1.56%- 5.98%. The proposed algorithm can not only enhance the usability of network coding in wireless sensor networks, but also improve the network performance.
基金Science Developing Plan of Beijing Educational Committee, Beijing Natural Science Fund (No. 3022003), and NationalNatural Science Fund of China(No.50375002)
文摘The inverse design method of a dynamic system with linear parameters has been studied. For some specified eigenvalues and eigenvectors, the design parameter vector which is often composed of whole or part of coefficients of spring and mass of the system can be obtained and the rigidity and mass matrices of an initially designed structure can be reconstructed through solving linear algebra equations. By using implicit function theorem, the conditions of existence and uniqueness of the solution are also deduced. The theory and method can be used for inverse vibration design of complex structure system.
文摘A novel unknown input reduced-order observer (UIRO) design scheme is presented. It is proved that unknown input appearing in measurement can be eliminated by a simple algebraic transformation. Then, a new UIRO design scheme is proposed via a transformation under no unknown input existing in measurement. Compared with other known results, the condition is weaker than others. So it was further reasonable. The design procedure proposed is simple and straightforward enough to be applied. An example is given to show its efficiency in fault diagnosis.
文摘Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.
基金This research is supported partially by Education Ministry of China (No. 02139) by National Science Foundation of China(No. 10471038).
文摘An excellent introduction to the topic of poset matroids is due to M, Barnabei, G, Nicoletti and L. Pezzoli. In this paper, we extensively study the closure operators of poset matroids and obtain the closure axioms for poset matroids; thereby we can characterize poset matroids in terms of the closure axioms. Some corresponding properties of combinatorial schemes are also obtained.
基金supported by the National Natural Science Foundation of China(Nos.61472464 and 61471075)the Program for Innovation Team Building at Institutions of Higher Education in Chongqing(No.J2013-46)+1 种基金the Natural Science Foundation of Chongqing Science and Technology Commission(Nos.cstc2015jcyjA 0554 and cstc2013jcyjA 40017)the Program for Postgraduate Science Research and Innovation of Chongqing University of Posts and Telecommunications(Chongqing Municipal Education Commission)(No.CYS14144)
文摘A novel lower-complexity construction scheme of quasi-cyclic low-density parity-check(QC-LDPC) codes for optical transmission systems is proposed based on the structure of the parity-check matrix for the Richardson-Urbanke(RU) algorithm. Furthermore, a novel irregular QC-LDPC(4 288, 4 020) code with high code-rate of 0.937 is constructed by this novel construction scheme. The simulation analyses show that the net coding gain(NCG) of the novel irregular QC-LDPC(4 288,4 020) code is respectively 2.08 d B, 1.25 d B and 0.29 d B more than those of the classic RS(255, 239) code, the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code at the bit error rate(BER) of 10^(-6). The irregular QC-LDPC(4 288, 4 020) code has the lower encoding/decoding complexity compared with the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code. The proposed novel QC-LDPC(4 288, 4 020) code can be more suitable for the increasing development requirements of high-speed optical transmission systems.
