2015/02/24 by Alexey Frolov, Frolov, Alexey
Computer Science · Engineering · #Error Correcting Code Techniques #Cooperative Communication and Network Coding #Advanced Wireless Communication Techniques
paper · pdf · doi:10.48550/arxiv.1502.06874
In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound for LDPC codes over GF(q) and to the upper bound for non-binary codes is done. The new bound is shown to lie under the Gilbert-Varshamov bound at high rates.