Parity check matrices and product representations of squares

@article{Naor2008ParityCM,
  title={Parity check matrices and product representations of squares},
  author={Assaf Naor and Jacques Verstra{\"e}te},
  journal={Combinatorica},
  year={2008},
  volume={28},
  pages={163-185}
}
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are linearly independent over F. We obtain near-optimal upper bounds for NF(n, k, r) in the case k > r. Namely, we show that NF(n, k, r) ¿ n r2 + cr k where c ≈ 4 3 for large k. Our method is based on a novel reduction of the problem to the extremal problem for cycles in graphs, and yields a fast algorithm for finding… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
7 Citations
35 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-7 of 7 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Cycles of even length in graphs

  • J. Bondy, M. Simonovits
  • J. Combinatorial Theory B,
  • 1974
Highly Influential
6 Excerpts

The theory of error-correcting codes. I

  • F. J. MacWilliams, N.J.A. Sloane
  • North-Holland Publishing Co., Amsterdam,
  • 1977
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…