Searcharxiv⌕ Search

arXiv subjects

Lijuan Xing

Publications and source records attributed to Lijuan Xing.

4 recordsLinked to original sources
arXiv2025

Are There High-Density Deep States in AtomicLayer-Deposited IGZO Thin Film?

It has been well recognized that there exist high-density deep states in IGZO thin films. Many of the device characteristics of IGZO transistors, such as negative bias illumination stability (NBIS),were understood to be related to these deep states. However, in this work, it is found that deep state density (NtD) of atomic-layer-deposited (ALD) IGZO transistors can be an ultra-low value (2.3*10^12 /cm^3) by the proposed NBIS-free light assisted I-V measurements so that the deep states do not affect the I-V characteristics even in subthreshold region. This work also reveals that NBIS is not related to the photoexcitation of electrons in deep states. Our results suggest that the existence of deep states and the impact of deep states on ALD IGZO transistors may need to be revisited.

cond-mat.mtrl-sci↗
arXiv2017

Capacity-Achievability of Polar Codes and Precoded Polar Codes under List Decoding: They are Good both Practically and Theoretically

Polar codes under successive cancellation decoding proposed by Arıkan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Arıkan. The performance of the successive cancellation list decoder is encouraging in practice. In this paper, we formalize the successive cancellation list decoder in our notation and prove that polar codes under successive cancellation list decoding achieve the symmetric capacity of any given binary-input discrete memoryless channel in theory as well. We also formalize the polar codes with CRC precoding of Tal and Vardy. In fact, we propose a family of more general codes, namely, precoded polar codes and prove that precoded polar codes under successive cancellation list decoding can achieve the symmetric capacity of any given binary-input discrete memoryless channel under some conditions.

cs.IT↗
arXiv2009

Progress on Problem about Quantum Hamming Bound for Impure Quantum Codes

A famous open problem in the theory of quantum error-correcting codes is whether or not the parameters of an impure quantum code can violate the quantum Hamming bound for pure quantum codes. We partially solve this problem. We demonstrate that there exists a threshold such that an arbitrary quantum code must obey the quantum Hamming bound whenever . We list some values of for small d and binary quantum codes.

quant-ph↗