3 citations · 6 across the 5 of their papers we have counts for
5 papers
On the Growth Rate of the Weight Distribution of Irregular Doubly-Generalized LDPC Codes
Mark F. Flanagan, Enrico Paolini, Marco Chiani +1
In this paper, an expression for the asymptotic growth rate of the number of small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC) codes is derived. The expr…
Linear-Programming Receivers
Mark F. Flanagan
It is shown that any communication system which admits a sum-product (SP) receiver also admits a corresponding linear-programming (LP) receiver. The two receivers have a relationsh…
Lower Bounds on the Minimum Pseudodistance for Linear Codes with -ary PSK Modulation over AWGN
Vitaly Skachek, Mark F. Flanagan
We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum "pseudodistance") for coded modulation systems using linear codes with -ary phase-…
Linear-programming Decoding of Non-binary Linear Codes
Mark F. Flanagan, Vitaly Skachek, Eimear Byrne +1
We develop a framework for linear-programming (LP) decoding of non-binary linear codes over rings. We prove that the resulting LP decoder has the `maximum likelihood certificate' p…
Combinatorial Gray codes for classes of pattern avoiding permutations
W. M. B. Dukes, Mark F. Flanagan, Toufik Mansour +1
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhausti…