https://hal.inria.fr/inria-00614462Vandendriessche, PeterPeterVandendriesscheDepartment of Mathematics - UGENT - Universiteit Gent = Ghent University [Belgium]LDPC codes arising from partial and semipartial geometriesHAL CCSD2011LDPC codesboundsfi nite geometry codesminimum distancepartial and semipartial geometries[INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR][INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT][MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT]Trape, Marie2011-08-11 15:14:122021-11-03 14:56:472011-08-11 15:26:43enConference papersapplication/pdf1We study several high-rate LDPC codes derived from partial and semipartial geometries.We study in particular the minimum distance of several known infi nite classes of these partial and semipartial and we improve the known bounds on this minimum distance in the binary and non-binary case. In some cases, we can determine the exact minimum distance.