23 citations · 125 across the 57 of their papers we have counts for
59 papers
Polar Complexity: A New Descriptive Complexity with Applications to Source and Joint Source-Channel Coding
Xinyuanmeng Yao, Xiao Ma
This paper first presents a new approach to evaluating the descriptive complexity of finite-length binary sequences. Specifically, we investigate the sequence-wise recovery behavio…
Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding
Xinyuanmeng Yao, Xiao Ma
In this paper, we introduce a binary balanced tree (BBT) channel transformation that extends Arıkan's channel transformation to arbitrary block lengths. We prove that the proposed…
Guessing Decoding of Short Blocklength Codes
Qianfan Wang, Jifan Liang, Peihong Yuan +3
Future beyond-5G and 6G systems demand ultra-reliable, low-latency communication with short blocklengths, motivating the development of universal decoding algorithms. Guessing deco…
On the Weight Distribution of Concatenated Code Ensemble Based on the Plotkin Construction
Xiao Ma
In this note, we reveal a relation between the weight distribution of a concatenated code ensemble based on the Plotkin construction and those of its component codes. The relation…
Coding Theorem for Generalized Reed-Solomon Codes
Xiangping Zheng, Xiao Ma
In this paper, we prove that the sub-field images of generalized Reed-Solomon (RS) codes can achieve the symmetric capacity of p-ary memoryless channels. Unlike the totally random…
A Short Proof of Coding Theorems for Reed-Muller Codes Under a Mild Assumption
Xiao Ma
In this paper, by treating Reed-Muller (RM) codes as a special class of low-density parity-check (LDPC) codes and assuming that sub-blocks of the parity-check matrix are randomly i…
Systematic Bernoulli Generator Matrix Codes
Yixin Wang, Fanhui Meng, Xiao Ma
This paper is concerned with the systematic Bernoulli generator matrix~(BGM) codes, which have been proved to be capacity-achieving over binary-input output-symmetric~(BIOS) channe…
Confined Orthogonal Matching Pursuit for Sparse Random Combinatorial Matrices
Xinwei Zhao, Jinming Wen, Hongqi Yang +1
Orthogonal matching pursuit~(OMP) is a commonly used greedy algorithm for recovering sparse signals from compressed measurements. In this paper, we introduce a variant of the OMP a…
A High-Performance List Decoding Algorithm for Surface Codes with Erroneous Syndrome
Jifan Liang, Qianfan Wang, Lvzhou Li +1
Quantum error-correcting codes (QECCs) are necessary for fault-tolerant quantum computation. Surface codes are a class of topological QECCs that have attracted significant attentio…
A Universal List Decoding Algorithm with Application to Decoding of Polar Codes
Xiangping Zheng, Xiao Ma
This paper is concerned with a guessing codeword decoding (GCD) of linear block codes. Compared with the guessing noise decoding (GND), which is only efficient for high-rate codes,…
Low-Complexity PSCL Decoding of Polar Codes
Xinyuanmeng Yao, Xiao Ma
Successive cancellation list (SCL) decoding enables polar codes and their generalizations to deliver satisfactory performance in finite-length scenarios but it comes with high late…
Coding Theorems for Repetition and Superposition Codes over Binary-Input Output-Symmetric Channels
Yixin Wang, Xiao Ma
This paper is concerned with a class of low density generator matrix codes (LDGM), called repetition and superposition (RaS) codes, which have been proved to be capacity-achieving…
Random Staircase Generator Matrix Codes: Performance Analysis and Construction
Qianfan Wang, Yiwen Wang, Yixin Wang +2
In this paper, we propose a class of codes, referred to as random staircase generator matrix codes (SGMCs), which have staircase-like generator matrices. In the infinite-length reg…
Guessing What, Noise or Codeword?
Xiao Ma
In this paper, we distinguish two guessing algorithms for decoding binary linear codes. One is the guessing noise decoding (GND) algorithm, and the other is the guessing codeword d…
A Random Coding Approach to Performance Analysis of the Ordered Statistic Decoding with Local Constraints
Jifan Liang, Xiao Ma
This paper is concerned with the ordered statistic decoding with local constraints (LC-OSD) of binary linear block codes, which is a near maximum-likelihood decoding algorithm. Com…
Partially Constrained GRAND of Linear Block Codes
Yixin Wang, Jifan Liang, Xiao Ma
This paper is concerned with a search-number-reduced guessing random additive noise decoding (GRAND) algorithm for linear block codes, called partially constrained GRAND (PC-GRAND)…
A Balanced Tree Approach to Construction of Length-Compatible Polar Codes
Xinyuanmeng Yao, Xiao Ma
From the perspective of tree, we design a length-flexible coding scheme. For an arbitrary code length, we first construct a balanced binary tree (BBT) where the root node represent…
Transmission of Bernoulli Sources Using Convolutional LDGM Codes
Yixin Wang, Tingting Zhu, Xiao Ma
We propose in this paper to exploit convolutional low density generator matrix (LDGM) codes for transmission of Bernoulli sources over binary-input output-symmetric (BIOS) channels…
Sleep, Sense or Transmit: Energy-Age Tradeoff for Status Update with Two-Thresholds Optimal Policy
Jie Gong, Jianhang Zhu, Xiang Chen +1
Age-of-Information (AoI), or simply age, which measures the data freshness, is essential for real-time Internet-of-Things (IoT) applications. On the other hand, energy saving is ur…
Twisted-Pair Superposition Transmission
Suihua Cai, Xiao Ma
We propose in this paper a new coding scheme called twisted-pair superposition transmission (TPST). The encoding is to "mix together" a pair of basic codes by superposition, while…
Transmitting Extra Bits by Rotating Signal Constellations
Jiachen Sun, Hao Liu, Xiao Ma
In this letter, we propose a novel LDPC coding scheme to transmit extra bits aided by rotated signal constellations without any additional cost in transmission power or bandwidth.…
Binary Representaion for Non-binary LDPC Code with Decoder Design
Yang Yu, Wen Chen, Jun Li +2
The equivalent binary parity check matrices for the binary images of the cycle-free non-binary LDPC codes have numerous bit-level cycles. In this paper, we show how to transform th…
Analysis on Computation-Intensive Status Update in Mobile Edge Computing
Qiaobin Kuang, Jie Gong, Xiang Chen +1
In status update scenarios, the freshness of information is measured in terms of age-of-information (AoI), which essentially reflects the timeliness for real-time applications to t…
Systematic Convolutional Low Density Generator Matrix Code
Suihua Cai, Wenchao Lin, Xinyuanmeng Yao +2
In this paper, we propose a systematic low density generator matrix (LDGM) code ensemble, which is defined by the Bernoulli process. We prove that, under maximum likelihood (ML) de…