Abstract
AbstractNew constructions for moderate-density parity-check (MDPC) codes using finite geometry are proposed. We design a parity-check matrix for the main family of binary codes as the concatenation of two matrices: the incidence matrix between points and lines of the Desarguesian projective plane and the incidence matrix between points and ovals of a projective bundle. A projective bundle is a special collection of ovals which pairwise meet in a unique point. We determine the minimum distance and the dimension of these codes, and we show that they have a natural quasi-cyclic structure. We consider alternative constructions based on an incidence matrix of a Desarguesian projective plane and compare their error-correction performance with regards to a modification of Gallager’s bit-flipping decoding algorithm. In this setting, our codes have the best possible error-correction performance after one round of bit-flipping decoding given the parameters of the code’s parity-check matrix.
Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference36 articles.
1. Adriaensen S., Denaux L.: Small weight codewords of projective geometric codes. J. Comb. Theory Ser. A, 180:Paper No. 105395, 34 (2021).
2. Assmus E.F. Jr., Key J.D.: Designs and Their Codes, vol. 103. Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge (1992).
3. Bagchi B., Inamdar S.P.: Projective geometric codes. J. Comb. Theory Ser. A 99(1), 128–142 (2002).
4. Baker R.D., Brown J.M.N., Ebert G.L., Fisher J.C.: Projective bundles. Bull. Belg. Math. Soc.-Simon Stevin 1(3), 329–336 (1994).
5. Bariffi J.: A Finite Geometry Construction for MDPC-Codes. Master’s thesis, University of Zurich. https://www.math.uzh.ch/index.php?id=pmastertheses &key1=604 (2020).