Related papers: Sphere Constraint based Enumeration Methods to Ana…
The structure of a linear block code is pivotal in defining fundamental properties, particularly weight distribution, and code design. In this study, we characterize the Type II structure of polar codewords with weights less than twice the…
Weighted simplicial complexes (WSCs) are powerful tools for describing weighted cloud data or networks with weighted nodes. In this paper, we propose a novel approach to study WSCs via the concept of polarization. Polarization of a WSC…
We analyze the trade-off between the undetected error probability (i.e., the probability that the channel decoder outputs an erroneous message without detecting the error) and the total error probability in the short blocklength regime. We…
We investigate random spatially coupled low-density parity-check (SC-LDPC) code ensembles over finite fields. Under different variable-node edge-spreading rules, the random Tanner graphs of several coupled ensembles are defined by multiple…
Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applications that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive…
The minimum sum-of-squares clustering problem (MSSC) consists of partitioning $n$ observations into $k$ clusters in order to minimize the sum of squared distances from the points to the centroid of their cluster. In this paper, we propose…
In this paper, we express the Chord Length Distribution (CLD) measure associated to a given Particle Size Distribution (PSD) when particles are modeled as suspended spheroids in a reactor. Using this approach, we propose two methods to…
In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of simple product code structure is proposed based on combining two independently received soft-decision data for the same codeword. LDPC codes…
Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…
This paper deals with two main issues regarding the short polar codes: the potential of FEC-assisted decoding and optimal code concatenation strategies under various design scenarios. Code concatenation and FEC-assisted decoding are…
In this article, a new method, called FWP, is proposed for clustering longitudinal curves. In the proposed method, clusters of mean functions are identified through a weighted concave pairwise fusion method. The EM algorithm and the…
Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have…
The weight of a coset of a code is the smallest Hamming weight of any vector in the coset. For a linear code of length $n$, we call integral weight spectrum the overall numbers of weight $w$ vectors, $0\le w\le n$, in all the cosets of a…
Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the corresponding code length is limited to the power of two. In this paper, we establish a…
We consider the $[q+1,q-3,5]_q3$ generalized doubly-extended Reed-Solomon code of codimension $4$ as the code associated with the twisted cubic in the projective space $\mathrm{PG}(3,q)$. Basing on the point-plane incidence matrix of…
This paper addresses the challenge of classifying polarimetric SAR images by leveraging the peculiar characteristics of the polarimetric covariance matrix (PCM). To this end, a general framework to solve a multiple hypothesis test is…
Polar codes are newly discovered capacity-achieving codes, which have attracted lots of research efforts. Polar codes can be efficiently decoded by the low-complexity successive cancelation (SC) algorithm and the SC list (SCL) decoding…
The AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code is defined as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code.…
We present a reduced-dimension, ballistic deposition, Monte Carlo particle packing algorithm and discuss its application to the analysis of the microstructure of hard-sphere systems with broad particle size distributions. We extend our…
Similar to existing codes, puncturing and shortening are two general ways to obtain an arbitrary code length and code rate for polar codes. When some of the coded bits are punctured or shortened, it is equivalent to a situation in which the…