Lattices that admit logarithmic worst-case to average-case connection factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Algorithms for ray class groups and Hilbert class fields
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 754.84 |
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.