10 papers
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…
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…
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…
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…
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…