Computational Hardness and Explicit Constructions of Error Correcting Codes

We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers $n$ and $k$, constructs polynomially many linear codes of block length $n$ and dimension $k$, most of which achieving the Gilbert- Varshamov bound. The success of the procedure relies on the assumption that the exponential time class of $E := DTIME[2^{O(n)}]$ is not contained in the sub-exponential space class $DSPACE[2^{o(n)}]$. The methods used in this paper are by now standard within computational complexity theory, and the main contribution of this note is observing that they are relevant to the construction of optimal codes. We attempt to make this note self contained, and describe the relevant results and proofs from the theory of pseudorandomness in some detail.


Publié dans:
Allerton 2006
Présenté à:
44th Allerton Conference on Communication, Control and Computing, Allerton House, IL, USA, September 27-September 29, 2006
Année
2006
Mots-clefs:
Note:
Invited paper
Laboratoires:




 Notice créée le 2007-03-05, modifiée le 2018-01-27

Liens externes:
Télécharger le documentURL
Télécharger le documentn/a
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)