Searcharxiv⌕ Search

arXiv subjects

Liuquan Yao

Publications and source records attributed to Liuquan Yao.

10 recordsLinked to original sources
arXiv2026

Perturbation Power Selection for First-Error Delay Maximization in Enhanced SC Decoding

In this paper, we analyze the effect of perturbation power in delaying the first error position, i.e., the first information bit incorrectly decoded by the successive cancellation (SC) decoding. It is conducted over the finite-length perturbation-enhanced SC (PE-SC) decoding paradigm. We show that the FEP delaying probability exhibits a non-monotonic dependence on the perturbation power \(σ_{p}^{2}\). Based on this property, an efficient perturbation power selection algorithm that maximizes the delay probability is proposed to enhance the perturbation efficiency. It results in a more efficient perturbation power selection in finite-length PE-SC decoding.

cs.IT↗
arXiv2026

Reliability-Dependent Scaling Laws of Deterministic Identification over Binary Symmetric Channels

In this paper, we study the asymptotic behavior of deterministic identification (DID) over binary symmetric channels (BSCs) under vanishing error constraints. By introducing a minimum error parameter, we characterize how different error-decay regimes affect the achievable DID rate. General achievability and converse bounds are derived, with explicit asymptotic characterizations in the large-deviation, moderate-deviation, and central-limit regimes. The achievability analysis combines coding-theoretic constructions with probabilistic concentration techniques, while the converse links statistical distinguishability to the minimum-distance structure of DID codes via total variation and Hamming-type bounds. Our results show that the asymptotic behavior of DID over BSCs is governed by a Hamming-shell concentration geometry of channel outputs, offering insights into the finite-blocklength behavior of deterministic identification over discrete-output channels.

cs.IT↗
arXiv2025

Erlang Model for Multi-type Data Flow

With the development of information technology, requirements for data flow have become diverse. When multi-type data flow (MDF) is used, games, videos, calls, etc. are all requirements. There may be a constant switch between these requirements, and also multiple requirements at the same time. Therefore, the demands of users change over time, which makes traditional teletraffic analysis not directly applicable. This paper proposes probabilistic models for the requirement of MDF, and analyzes in three states: non-tolerance, tolerance and delay. When the requirement random variables are co-distributed with respect to time, we prove the practicability of the Erlang Multirate Loss Model (EMLM) from a mathematical perspective by discretizing time and error analysis. An algorithm of pre-allocating resources is given to guild the construction of base resources.

cs.NI↗
arXiv2025

Performance Analysis of Perturbation-enhanced SC decoders

In this paper, we analyze the delay probability of the first error position in perturbation-enhanced Successive cancellation (SC) decoding for polar codes. Our findings reveal that, asymptotically, an SC decoder's performance does not degrade after one perturbation, and it improves with a probability of $\frac{1}{2}$. This analysis explains the sustained performance gains of perturbation-enhanced SC decoding as code length increases.

cs.IT↗
arXiv2024

Partial Orders in Rate-Matched Polar Codes

In this paper, we establish the partial order (POs) for both the binary erasure channel (BEC) and the binary memoryless symmetric channel (BMSC) under any block rate-matched polar codes. Firstly, we define the POs in the sense of rate-matched polar codes as a sequential block version. Furthermore, we demonstrate the persistence of POs after block rate matching in the BEC. Finally, leveraging the existing POs in the BEC, we obtain more POs in the BMSC under block rate matching. Simulations show that the PW sequence constructed from β-expansion can be improved by the tool of POs. Actually, any fixed reliable sequence in the mother polar codes can be improved by POs for rate matching.

cs.IT↗
arXiv2024

New Upper bounds for KL-divergence Based on Integral Norms

In this paper, some new upper bounds for Kullback-Leibler divergence(KL-divergence) based on $L^1, L^2$ and $L^\infty$ norms of density functions are discussed. Our findings unveil that the convergence in KL-divergence sense sandwiches between the convergence of density functions in terms of $L^1$ and $L^2$ norms. Furthermore, we endeavor to apply our newly derived upper bounds to the analysis of the rate theorem of the entropic conditional central limit theorem.

math.PR↗
arXiv2024

Achievability Bounds on Unequal Error Protection Codes

Unequal error protection (UEP) codes can facilitate the transmission of messages with different protection levels. In this paper, we study the achievability bounds on UEP by the generalization of Gilbert-Varshamov (GV) bound. For the first time, we show that under certain conditions, UEP enhances the code rate comparing with time-sharing (TS) strategies asymptotically.

cs.IT↗
arXiv2024

New Partial Orders of Polar Codes for BMSC

In this paper, we define partial orders (POs) of polar codes based on the Bhattacharyya parameter and the bit-error probability, respectively. These POs are applicable to arbitrary binary memoryless symmetric channel (BMSC). Leveraging the extremal inequalities of polarization transformation, we derive new POs for BMSC based on the corresponding POs observed in the Binary Erasure Channel (BEC). %Additionally, we discover more special POs in the Binary Symmetric Channel (BSC). We provide examples that demonstrate the inability of existing POs to deduce these novel POs. Furthermore, we establish upper bounds for the expansion parameter $β$ if the polar codes constructed by $β$-expansion method obey these POs.

cs.IT↗
arXiv2024

Achieving the Fundamental Limit of Lossless Analog Compression via Polarization

In this paper, we study the lossless analog compression for i.i.d. nonsingular signals via the polarization-based framework. We prove that for nonsingular source, the error probability of maximum a posteriori (MAP) estimation polarizes under the Hadamard transform, which extends the polarization phenomenon to analog domain. Building on this insight, we propose partial Hadamard compression and develop the corresponding analog successive cancellation (SC) decoder. The proposed scheme consists of deterministic measurement matrices and non-iterative reconstruction algorithm, providing benefits in both space and computational complexity. Using the polarization of error probability, we prove that our approach achieves the information-theoretical limit for lossless analog compression developed by Wu and Verdu.

cs.IT↗