For the decoding of a binary linear block code of minimal Hamming distance <i>d</i> over additive white Gaussian noise (AWGN) channels, a soft-decision decoder achieves bounded-distance (BD) decoding if its squared error-correction radius is equal to <i>d</i>. A Chase-like algorithm outputs the best (most likely) codeword in a list of candidates generated… (More)
Suffering from the low performance, conventional emulational device model is the bottle-neck of the whole virtual machine system. Utilizing memory virtualizating technology, a novel virtual device acceleration solution with high performance is presented and implemented by the video device accelerating solution on Xen, which is an open-source project. A test… (More)
Note that network coding allows immediate nodes to mix information from different data flows. On the basis of this observation, we prove that under suitable conditions, communicators can communicate with perfect secrecy over wiretap networks. Our method of secure communication over wiretap networks without keys is fundamentally distinct from cryptographic… (More)
For the construction of some quasi-cyclic low-density parity-check codes, it is desired to find all the shortest balanced cycles in a base matrix. In this paper, we give some necessary and sufficient conditions for the existence of balanced cycles. Furthermore, we show that any of the shortest balanced cycles in a base matrix consists of the points of a… (More)
It is recently of interest to design Chase-like algorithms to achieve BD decoding with as least trials as possible. In this paper, we show that Chase-like algorithms can achieve bounded-distance decoding with only O(radic(d ln d)) trials, where d is the minimal Hamming distance of the code.