In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length ...In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.展开更多
The diversity provided by disjoint paths can increase the survivability of communication networks. This paper considers the allocation of network error correction flow on a network that consists of disjoint paths from...The diversity provided by disjoint paths can increase the survivability of communication networks. This paper considers the allocation of network error correction flow on a network that consists of disjoint paths from the source node to the destination node. Specifically, we propose an algorithm of allocating the path-flows to support the given rate with minimum cost. Our analysis shows that the asymptotic time complexity of this algorithm is linearithmic, and this algorithm is optimal in general展开更多
It is well known that erasure coding can be used in storage systems to efficiently store data while protecting against failures. Conventionally, the design of erasure codes has focused on the tradeoff between redundan...It is well known that erasure coding can be used in storage systems to efficiently store data while protecting against failures. Conventionally, the design of erasure codes has focused on the tradeoff between redundancy and reliability. Under this criterion, an maximum distance separable（MDS） code has optimal redundancy. In this paper, we address a new class of MDS array codes for tolerating triple node failures by extending the row di- agonal parity（RDP） code, named the RDDP（row double diagonal parity） code. The RDDP code takes advantages of good perform- ances of the RDP code with balanced I/0. A specific triple-erasure decoding algorithm to reduce decoding complexity is depicted by geometric graph, and it is easily implemented by software and hardware. The theoretical analysis shows that the comprehensive properties of the RDDP code are optimal, such as encoding and decoding efficiency, update efficiency and I/0 balance performance.展开更多
This paper considers the design of a low-complexity and high-performance precoder for multiple-input multiple-output(MIMO)systems.The precoder is designed by combining both nonlinear and non-iterative processing strat...This paper considers the design of a low-complexity and high-performance precoder for multiple-input multiple-output(MIMO)systems.The precoder is designed by combining both nonlinear and non-iterative processing strategies.The proposed nonlin-ear precoding techniques employ a nonlinear constellation precoding technique based on maximum distance sepa-rable codes at the transmitter.We propose to reduce the computational complexity in iterative-based precoding algorithms by using less complex non-iterative singular value decomposition-based joint precoder and decoder pair design.The maximum likelihood detection for the lin-ear MIMO channel is considered.The simulation results showed that the proposed nonlinear and non-iterative precoding schemes outperform the conventional linear MIMO precoder design,even when a reduced-complexity suboptimal strategy is adopted,considering the bit error rate performance.展开更多
文摘In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.
基金supported by the National Key Basic Research and Development (973) Program of China (No. 2013CB329002)the National High-Tech Research and Development (863) Program of China (No. 2014AA01A703)+3 种基金the National Science and Technology Major Project (No. 2013ZX03004007)the Program for New Century Excellent Talents in University (No. NCET13-0321)the International Science and Technology Cooperation Program (No. 2012DFG12010)the Tsinghua Research Funding (No. 2010THZ03-2)
文摘The diversity provided by disjoint paths can increase the survivability of communication networks. This paper considers the allocation of network error correction flow on a network that consists of disjoint paths from the source node to the destination node. Specifically, we propose an algorithm of allocating the path-flows to support the given rate with minimum cost. Our analysis shows that the asymptotic time complexity of this algorithm is linearithmic, and this algorithm is optimal in general
基金Supported by the National Natural Science Foundation of China(60873216)the Key Project of Sichuan Provincial Department of Education(12ZA223)
文摘It is well known that erasure coding can be used in storage systems to efficiently store data while protecting against failures. Conventionally, the design of erasure codes has focused on the tradeoff between redundancy and reliability. Under this criterion, an maximum distance separable（MDS） code has optimal redundancy. In this paper, we address a new class of MDS array codes for tolerating triple node failures by extending the row di- agonal parity（RDP） code, named the RDDP（row double diagonal parity） code. The RDDP code takes advantages of good perform- ances of the RDP code with balanced I/0. A specific triple-erasure decoding algorithm to reduce decoding complexity is depicted by geometric graph, and it is easily implemented by software and hardware. The theoretical analysis shows that the comprehensive properties of the RDDP code are optimal, such as encoding and decoding efficiency, update efficiency and I/0 balance performance.
文摘This paper considers the design of a low-complexity and high-performance precoder for multiple-input multiple-output(MIMO)systems.The precoder is designed by combining both nonlinear and non-iterative processing strategies.The proposed nonlin-ear precoding techniques employ a nonlinear constellation precoding technique based on maximum distance sepa-rable codes at the transmitter.We propose to reduce the computational complexity in iterative-based precoding algorithms by using less complex non-iterative singular value decomposition-based joint precoder and decoder pair design.The maximum likelihood detection for the lin-ear MIMO channel is considered.The simulation results showed that the proposed nonlinear and non-iterative precoding schemes outperform the conventional linear MIMO precoder design,even when a reduced-complexity suboptimal strategy is adopted,considering the bit error rate performance.
