Skip to Main content Skip to Navigation
Conference papers

LDPC codes arising from partial and semipartial geometries

Abstract : We 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.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/inria-00614462
Contributor : Marie Trape <>
Submitted on : Thursday, August 11, 2011 - 3:14:12 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:43 AM
Long-term archiving on: : Monday, November 12, 2012 - 3:18:26 PM

File

61.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00614462, version 1

Collections

Citation

Peter Vandendriessche. LDPC codes arising from partial and semipartial geometries. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.419-428. ⟨inria-00614462⟩

Share

Metrics

Record views

222

Files downloads

217