Skip to main content

Sparse Parity-Check Matrices over Finite Fields

Extended Abstract

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2697))

Included in the following conference series:

Abstract

For fixed positive integers k, q, r with q a prime power and large m, we investigate matrices with m rows and a maximum number N q(m, k, r) of columns, such that each column contains at most r nonzero entries from the finite field GF(q) and each k columns are linearly independent over GF(q). For even k we prove the lower bounds N q(m, k, r) = Ω(m kr/(2(k−1))), and N q(m, k, r) = Ω(m (k−1)r/(2(k−2))) for odd k ≥ 3. For k = 2i and gcd(k−1, r) = k−1 we obtain N q(m, k, r) = Θ(m kr/(2(k−1))), while for any even k ≥ 4 and gcd(k − 1, r) = 1 we have N q(m, k, r) = Ω(m kr/(2(k−1)) · (logm)1/(k−1)). For char (GF(q)) > 2 we prove that N q(m,4,r) = Θ(m ⌈4r/3⌉/2), while for q = 2l we only have N q(m 4, r) = O(m ⌈4r/3⌉/2). We can find matrices, fulfilling these lower bounds, in polynomial time. Our results extend and complement earlier results from 4,14, where the case q = 2 was considered.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Ajtai, J. Kómlos, J. Pintz, J. Spencer and E. Szemerédi, Extremal uncrowded hypergraphs, J. Comb. Theory A 32, 1982, 321–335.

    Article  MATH  Google Scholar 

  2. N. Alon, O. Goldreich, J. Håstad and R. Peralta, Simple constructions of almost k-wise independent random variables, Rand. Struct. & Algorithms 3, 1992, 289–304, and 4, 1993, 119–120.

    Article  MATH  Google Scholar 

  3. C. T. Benson, Minimal regular graphs of girth eight and twelve, Canad. J. Mathematics 18, 1966, 1091–1094.

    MATH  MathSciNet  Google Scholar 

  4. C. Bertram-Kretzberg, T. Hofmeister and H. Lefmann, Sparse 0–1-matrices and forbidden hypergraphs, Comb., Prob. and Computing 8, 1999, 417–427.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Bertram-Kretzberg and H. Lefmann, The algorithmic aspects of uncrowded hypergraphs, SIAM J. Computing 29, 1999, 201–230.

    Article  MATH  MathSciNet  Google Scholar 

  6. C. Bertram-Kretzberg and H. Lefmann, MOD p -tests, almost independence and small probability spaces, Rand. Struct. & Algorithms 16, 2000, 293–313.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Bondy and M. Simonovits, Cycles of even length in graphs, J. Comb. Theory Ser. B 16, 1974, 97–105.

    Article  MATH  MathSciNet  Google Scholar 

  8. W. G. Brown, On graphs that do not contain a Thomsen graph, Canad. Math. Bulletin 9, 1966, 281–289.

    MATH  Google Scholar 

  9. P. Erdös, A. Rényi and V. T. Sós, On a problem of graph theory, Stud. Sci. Math. Hungarica 1, 1966, 213–235.

    Google Scholar 

  10. A. Fundia, Derandomizing Chebychev’s inequality to find independent sets in uncrowded hypergraphs, Rand. Struct. & Algorithms 8, 1996, 131–147.

    Article  MATH  MathSciNet  Google Scholar 

  11. P. Frankl and Z. Füredi, Union-free families of sets and equations over fields, J. Numb. Theory 23, 1986, 210–218.

    Article  MATH  Google Scholar 

  12. H. Karloff and Y. Mansour, On construction of k-wise independent random variables, Proc. 26th STOC, 1994, 564–573.

    Google Scholar 

  13. F. Lazebnik, V. A. Ustimenko and A. J. Woldar, A new series of dense graphs of high girth, Bull. (New Series) of the AMS 32, 1995, 73–79.

    Article  MATH  MathSciNet  Google Scholar 

  14. H. Lefmann, P. Pudlák and P. Savický, On sparse parity-check matrices, Designs, Codes and Cryptography 12, 1997, 107–130.

    Article  MATH  Google Scholar 

  15. A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica 8, 1988, 261–277.

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Luby, M. Mitzenmacher, A. Shokrollahi and D. Spielman, Analysis of low-density codes and improved designs using irregular graphs, Proc. 30th STOC, 1998, 249–258.

    Google Scholar 

  17. G. A. Margulis, Explicit group theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators, J. Probl. Inform. Transm. 24, 1988, 39–46.

    MATH  MathSciNet  Google Scholar 

  18. R. Wenger, Extremal graphs with no C 4’s, C 6’s or C 10’s, J. Comb. Theory Ser. B 52, 1991, 113–116.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lefmann, H. (2003). Sparse Parity-Check Matrices over Finite Fields. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45071-8_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40534-4

  • Online ISBN: 978-3-540-45071-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics