23 citations · 125 across the 57 of their papers we have counts for
6 papers · 1 filter
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…