Constructions of quasi-cyclic measurement matrices based on array codes
Recently, Dimakis, Smarandache, and Vontobel indicated that the parity-check matrices of
good LDPC codes can be used as provably good measurement matrices for compressed …
good LDPC codes can be used as provably good measurement matrices for compressed …
Invertible bloom lookup tables with listing guarantees
The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data structure for set
representation that supports a listing operation as the recovery of the elements in the …
representation that supports a listing operation as the recovery of the elements in the …
On the minimum/stopping distance of array low-density parity-check codes
E Rosnes, MA Ambroze… - IEEE transactions on …, 2014 - ieeexplore.ieee.org
In this paper, we study the minimum/stopping distance of array low-density parity-check
(LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q …
(LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q …
More on the stopping and minimum distances of array codes
M Esmaeili, MH Tadayon… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
For q an odd prime and 1≤ m≤ q, two specific binary qm× q 2 parity-check matrices
denoted by HP (m, q) and HI (m, q) are considered. The corresponding binary codes, CP (m …
denoted by HP (m, q) and HI (m, q) are considered. The corresponding binary codes, CP (m …
Quasi-cyclic representation and vector representation of RS-LDPC codes
H Liu, Q Huang, G Deng, J Chen - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
RS-LDPC codes, constructed based on the codewords of Reed-Solomon (RS) codes with
two information symbols, are an important class of LDPC codes. In this paper, we present …
two information symbols, are an important class of LDPC codes. In this paper, we present …
On the spark of binary LDPC measurement matrices from complete protographs
H Liu, H Zhang, L Ma - IEEE Signal Processing Letters, 2017 - ieeexplore.ieee.org
The spark is an important property that provides recovery guarantees of a measurement
matrix in compressed sensing. In this letter, we focus on a specific class of measurement …
matrix in compressed sensing. In this letter, we focus on a specific class of measurement …
Invertible Bloom Lookup Tables with Listing Guarantees
The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data structure for set
representation that supports a listing operation as the recovery of the elements in the …
representation that supports a listing operation as the recovery of the elements in the …
Characterization and efficient search of non-elementary trapping sets of LDPC codes with applications to stopping sets
Y Hashemi, AH Banihashemi - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
In this paper, we propose a characterization for nonelementary trapping sets (NETSs) of low-
density parity-check (LDPC) codes. The characterization is based on viewing an NETS as a …
density parity-check (LDPC) codes. The characterization is based on viewing an NETS as a …
Using the Chinese remainder theorem for the grouping of RFID tags
YS Su, OK Tonguz - IEEE transactions on communications, 2013 - ieeexplore.ieee.org
In this paper, we propose a novel scheme for the design of grouping of radio-frequency
identification (RFID) tags, based on the Chinese remainder theorem (CRT). Grouping allows …
identification (RFID) tags, based on the Chinese remainder theorem (CRT). Grouping allows …
On the number of minimum stopping sets and minimum codewords of array LDPC codes
H Liu, L Ma, J Chen - IEEE communications letters, 2010 - ieeexplore.ieee.org
For an odd prime q and an integer m≤ q, a binary mq× q 2 quasi-cyclic parity-check matrix
H (m, q) can be constructed for a class of array LDPC code C (m, q). In this letter, the closed …
H (m, q) can be constructed for a class of array LDPC code C (m, q). In this letter, the closed …