Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR01-002 | 6th December 2000 00:00

Constructions of Codes from Number Fields

RSS-Feed




TR01-002
Authors: Venkatesan Guruswami
Publication: 4th January 2001 18:20
Downloads: 1331
Keywords: 


Abstract:

We define number-theoretic error-correcting codes based on algebraic
number fields, thereby providing a generalization of Chinese Remainder
Codes akin to the generalization of Reed-Solomon codes to
Algebraic-geometric codes. Our construction is very similar to
(and in fact less general than) the one given by (Lenstra 1986), but
the parallel with the function field case is more apparent,
since we only use the non-archimedean places for the encoding.
We prove that over an alphabet size as small as 19, there even exist
asymptotically good number field codes of the type we consider.
This result is based on the existence of certain number
fields that have an infinite class field tower in which some primes of
small norm split completely.



ISSN 1433-8092 | Imprint