Linear codes and character sums

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Let V be an rn-dimensional linear subspace of Z2n. Suppose the smallest Hamming weight of non-zero vectors in V is d. (In coding-theoretic terminology, V is a linear code of length n, rate r and distance d.) We settle two extremal problems on such spaces. First, we prove a (weak form) of a conjecture by Kalai and Linial and show that the fraction of vectors in V with weight d is exponentially small. Specifically, in the interesting case of a small r, this fraction does not exceed 2-Ω(r2/log(1/r)+1n). We also answer a question of Ben-Or and show that if r > 1/2, then for every k, at most Cr · |V|/√n vectors of V have weight k. Our work draws on a simple connection between extremal properties of linear subspaces of Z2n and the distribution of values in short sums of Z2n-characters.

Original languageAmerican English
Pages (from-to)497-522
Number of pages26
Issue number4
StatePublished - 2002

Bibliographical note

Funding Information:
* Supported in part by grants from th e Israeli Academy of Sciences and th e Binational Science Foundation Israel-USA. † Th is work was done wh ile th e auth or was a student in th e Hebrew University of Jerusalem, Israel.


Dive into the research topics of 'Linear codes and character sums'. Together they form a unique fingerprint.

Cite this