Skip to main content
Log in

On Sparse Parity Check Matrices

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We consider the extremal problem to determine the maximal number \(N(m,k,r)\) of columns of a 0-1 matrix with\(m\) rows and at most \(r\) ones in each column such that each \(k\) columns are linearly independent modulo \(2\). For fixed integers \(k \geqslant 1\) and \(r \geqslant 1\), we shall prove the probabilistic lower bound \(N(m,k,r)\) = \(\Omega (m^{kr/2(k - 1)} )\); for \(k\) a power of \(2\), we prove the upper bound \( N(m,k,r) = O(m^{\left\lceil {kr/(k - 1)} \right\rceil /2} ) \) which matches the lower bound for infinitely many values of \(r\). We give some explicit constructions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aigner, M., “Kombinatorik, Vol. I,” Springer Verlag, Berlin, 1975.

    Google Scholar 

  2. Alon, N., Goldreich, O., Håstad, J. and Peralta, R., “Simple Constructions of Almost k-wise Independent Random Variables,” Random Structures & Algorithms 3, 1992, pp. 289–304. Addendum: Random Structures & Algorithms 4, 1993, pp. 119–120.

    Google Scholar 

  3. Alon, N. and Spencer, J., “The Probabilistic Method,” Wiley & Sons, New York, 1992.

    Google Scholar 

  4. Benson, C. T., “Minimal Regular Graphs of Girth Eight and Twelve,” Canadian Journal of Mathematics 18, 1966, pp. 1091–1094.

    Google Scholar 

  5. Bondy, A. and Simonovits, M., “Cycles of Even Length in Graphs,” Journal of Combinatorial Theory Ser. B 16, 1974, pp. 97–105.

    Google Scholar 

  6. Brown, W.G., “On Graphs that do not Contain a Thomsen Graph,” Canadian Mathematical Bulletin 9, 1966, pp. 281–289.

    Google Scholar 

  7. Calkin, N., “Dependent Sets of Constant Weight Binary Vectors,” preprint, 1995.

  8. Erdős, P., “On Sequences of Integers no One of which Divides the Product of Two Others and some Related Problems,” Izvestiya Nauchno-Issl. Inst. Mat. i Meh. Tomsk 2, 1938, pp. 74–82. Mitteilungen des Forschungsinstitutes für Math. und Mechanik, Tomsk, in Zentralblatt 20, p. 5.

    Google Scholar 

  9. Erdős, P., “Graph Theory and Probability,” Canadian Journal on Mathematics 11, 1959, pp. 34–38.

    Google Scholar 

  10. Erdös, P., Rényi, A., and Sós, V. T., “On a Problem of Graph Theory,” Studia Scientiarum Mathematicarum Hungarica 1, 1966, pp. 215–235.

    Google Scholar 

  11. Frankl, P. and Fűredi, Z., “Union-Free Families of Sets and Equations over Fields,” Journal of Number Theory 23, 1986, pp. 210–218.

    Google Scholar 

  12. Fűredi, Z., “Turán Type Problems,” Surveys in Combinatorics, London Math. Soc. LMS 166, Cambridge University Press, 1991, pp. 253–300.

  13. Lazebnik, F., Ustimenko, V. A. and Woldar, A. J., “A New Series of Dense Graphs of High Girth,” Bulletin (New Series) of the American Mathematical Society 32, 1995, pp. 73–79.

  14. Lefmann, H., Phelps, K. T. and Rödl, V., “Extremal Problems for Triple Systems,” Journal of Combinatorial Designs 1, 1993, pp. 379–394.

    Google Scholar 

  15. Lubotzky, A., Phillips, R. and Sarnak, P., “Ramanujan Graphs,” Combinatorica 8, 1988, pp. 261–277.

    Google Scholar 

  16. Margulis, G. A., “Explicit Constructions of Graphs Without Short Cycles and Low Density Codes,” Combinatorica 2, 1982, pp. 71–78.

    Google Scholar 

  17. Margulis, G. A., “Explicit Group Theoretical Construction of Combinatorial Schemes and Their Application to the Design of Expanders and Concentrators,” J. Probl. Inform. Transmission 24, 1988, pp. 39–46.

    Google Scholar 

  18. Singer, J., “A Theorem in Finite Projective Geometry and Some Applications to Number Theory,” Transactions of the American Mathematical Society 43, 1938, pp. 377–385.

    Google Scholar 

  19. Singleton, R., “On Minimal Graphs of Maximum Even Girth”, Journal of Combinatorial Theory 1, 1966, pp. 306–332.

    Google Scholar 

  20. Sipser, M. and Spielman, D. A., “Expander Codes,” Proc. 35th Ann. Symposium on Foundations of Computer Science FOCS, 1994, pp. 566–576.

  21. Sós, V. T., Erdős, P. and Brown, W. G., “On the Existence of Triangulated Spheres in 3-Graphs, and Related Problems,” Periodica Mathematica Hungarica 3, 1973, pp. 221–228.

    Google Scholar 

  22. Spielman, D. A., “Linear-time Encodable and Decodable Error-correcting Codes,” Proc. 27th Ann. ACM Symposium on the Theory of Computing STOC, 1995, pp. 388–397.

  23. Spielman, D. A., “Computationally Efficient Error-Correcting Codes and Holographic Proofs,” PhD thesis, MIT, 1995.

  24. Wenger, R., “Extremal Graphs with no C 4's, C 6's or C 10's,” Journal of Combinatorial Theory Ser. B 52, 1991, pp. 113–116.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lefmann, H., Pudlák, P. & Savicky, P. On Sparse Parity Check Matrices. Designs, Codes and Cryptography 12, 107–130 (1997). https://doi.org/10.1023/A:1008233013327

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008233013327

Navigation