Parity-check Codes from Disjunct Matrices
Abstract: The matrix representations of linear codes have been well-studied for use as disjunct matrices. However, no connection has previously been made between the properties of disjunct matrices and the parity-check codes obtained from them. This paper makes this connection for the first time. We provide some fundamental results on parity-check codes from general disjunct matrices (in particular, a minimum distance bound). We then consider three specific constructions of disjunct matrices and provide parameters of their corresponding parity-check codes including rate, distance, girth, and density. We show that, by choosing the correct parameters, the codes we construct have the best possible error-correction performance after one round of bit-flipping decoding with regard to a modified version of Gallager's bit-flipping decoding algorithm.
- A. Beemer, K. Haymaker and C. A. Kelley, Absorbing sets of codes from finite geometries, Cryptography and Communications, 11 (2019), 1115–1131.
- C. J. Colbourn, CRC Handbook of Combinatorial Designs, CRC press, Florida, 2007.
- C. Di, D. Proietti, I. E. Telatar, T. J. Richardson and R. L. Urbanke, Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Transactions on Information Theory, 48 (2002), 1570–1579.
- L. Dolecek, On absorbing sets of structured sparse graph codes, in 2010 Information Theory and Applications Workshop, 2010, 1–5.
- R. Dorfman, The detection of defective members of large populations, The Annals of Mathematical Statistics, 14 (1943), 436–440.
- D. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, vol. 3, World Scientific, Singapore, 1993.
- D. Du and F. K. Hwang, Combinatorial Group Testing and its Applications, vol. 12, World Scientific, Singapore, 2000.
- A. Dyachkov and V. Rykov, Bounds on the length of disjunctive codes, Problems of Control & Information Theory, 11 (1982), 7–13.
- H.-L. Fu and F. K. Hwang, A novel use of t𝑡titalic_t-packings to construct d𝑑ditalic_d-disjunct matrices, Discrete Applied Mathematics, 154 (2006), 1759–1762.
- R. Gallager, Low-density parity-check codes, Sc. D. Thesis, Massachussetts Institute of Technology, Cambridge, MA, USA.
- R. Gallager, Low-density parity-check codes, IRE Transactions on Information Theory, 8 (1962), 21–28.
- V. Guruswami, A. Rudra and M. Sudan, Essential Coding Theory, Creative Commons License, California, 2019, https://cse.buffalo.edu/faculty/atri/courses/coding-theory/book/.
- W. C. Huffman and V. Pless, Fundamentals of Error-correcting Codes, Cambridge University Press, New York, 2010.
- H. A. Inan, P. Kairouz, M. Wootters and A. Özgür, On the optimality of the Kautz-Singleton construction in probabilistic group testing, IEEE Transactions on Information Theory, 65 (2019), 5592–5603.
- S. Johnson, Low-density parity-check codes from combinatorial designs, Ph.D. Dissertation, The University of Newcastle, Callaghan, NSW, Australia.
- W. Kautz and R. Singleton, Nonrandom binary superimposed codes, IEEE Transactions on Information Theory, 10 (1964), 363–377.
- A. J. Macula, A simple construction of d𝑑ditalic_d-disjunct matrices with certain constant weights, Discrete Mathematics, 162 (1996), 311–312.
- E. McMillon, A. Beemer and C. A. Kelley, Extremal absorbing sets in low-density parity-check codes, Advances in Mathematics of Communications, 17.
- R. Misoczki, J.-P. Tillich, N. Sendrier and P. S. Barreto, MDPC-McEliece: New McEliece variants from moderate density parity-check codes, in 2013 IEEE International Symposium on Information Theory, 2013, 2069–2073.
- S. Ouzan and Y. Be’ery, Moderate-density parity-check codes, arXiv preprint arXiv:0911.3262.
- N. Shental, S. Levy, V. Wuvshet, S. Skorniakov, B. Shalem, A. Ottolenghi, Y. Greenshpan, R. Steinberg, A. Edri, R. Gillis et al., Efficient high-throughput SARS-CoV-2 testing to detect asymptomatic carriers, Science Advances, 6 (2020), eabc5961.
- R. Tanner, A recursive approach to low complexity codes, IEEE Transactions on Information Theory, 27 (1981), 533–547.
- J.-P. Tillich, The decoding failure probability of MDPC codes, in 2018 IEEE International Symposium on Information Theory, IEEE, 2018, 941–945.
- N. Wiberg, Codes and decoding on general graphs, Ph.D. Dissertation, Linkoping University, Linkoping, Sweden.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.