1![Asymptotics of the minimal distance of quadratic residue codes Jos´ e Felipe Voloch The binary quadratic residue codes are defined as follows. Given a prime p ≡ Asymptotics of the minimal distance of quadratic residue codes Jos´ e Felipe Voloch The binary quadratic residue codes are defined as follows. Given a prime p ≡](https://www.pdfsearch.io/img/a3fc726c58edb7267041d1cebffe8e2b.jpg) | Add to Reading ListSource URL: www.ma.utexas.edu- Date: 2005-01-10 16:07:54
|
---|
2![Double Circulant Quadratic Residue Codes ∗ Tor Helleseth † Double Circulant Quadratic Residue Codes ∗ Tor Helleseth †](https://www.pdfsearch.io/img/f6ac2b3b8692e7af413b755c2c41dbe2.jpg) | Add to Reading ListSource URL: www.ma.utexas.edu- Date: 2004-10-22 18:26:33
|
---|
3![ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over](https://www.pdfsearch.io/img/c31d99e4d56a743473ae2ac75d82108d.jpg) | Add to Reading ListSource URL: www2.math.kyushu-u.ac.jpLanguage: English - Date: 2016-06-23 04:10:37
|
---|
4![ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti](https://www.pdfsearch.io/img/a2344bc10e6e49a90218b829eb3bfbf9.jpg) | Add to Reading ListSource URL: www.crypto.ethz.chLanguage: English - Date: 2015-02-25 05:09:48
|
---|
5![SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of](https://www.pdfsearch.io/img/7dc121e9c81405f2324aec29df809b4a.jpg) | Add to Reading ListSource URL: www.mat.uniroma2.itLanguage: English - Date: 2007-11-23 17:17:47
|
---|
6![ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over](https://www.pdfsearch.io/img/628d816c776229a919d42904a49b9661.jpg) | Add to Reading ListSource URL: www2.math.kyushu-u.ac.jpLanguage: English - Date: 2016-06-23 04:17:05
|
---|
7![Annales Univ. Sci. Budapest., Sect. Comp–27 PRIMALITY PROOFS WITH ELLIPTIC CURVES: HEURISTICS AND ANALYSIS Wieb Bosma, Eric Cator (Nijmegen, The Netherlands) Annales Univ. Sci. Budapest., Sect. Comp–27 PRIMALITY PROOFS WITH ELLIPTIC CURVES: HEURISTICS AND ANALYSIS Wieb Bosma, Eric Cator (Nijmegen, The Netherlands)](https://www.pdfsearch.io/img/81b69709688d46276210856ecf360581.jpg) | Add to Reading ListSource URL: www.math.ru.nlLanguage: English - Date: 2016-04-18 16:20:05
|
---|
8![ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti](https://www.pdfsearch.io/img/897a67256763f54f1d9f4a34eb4c4c3d.jpg) | Add to Reading ListSource URL: www.crypto.ethz.chLanguage: English - Date: 2015-02-25 05:09:48
|
---|
9![Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes, Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes,](https://www.pdfsearch.io/img/f70f347e1cca3fdf4379953f4a3d728e.jpg) | Add to Reading ListSource URL: www.ma.utexas.eduLanguage: English - Date: 2004-10-22 18:26:34
|
---|
10![Automorphism groups of extremal self-dual binary linear codes Martino Borello Università degli Studi di Milano-Bicocca The 11 Automorphism groups of extremal self-dual binary linear codes Martino Borello Università degli Studi di Milano-Bicocca The 11](https://www.pdfsearch.io/img/01c587ea58c774820b2a4dbddb7c809e.jpg) | Add to Reading ListSource URL: www.math.uni-magdeburg.deLanguage: English - Date: 2013-08-06 10:53:07
|
---|