|
|
|
|
LEADER |
00000cam a2200000Mu 4500 |
001 |
EBOOKCENTRAL_ocn993770025 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr |n|---||||| |
008 |
170715s2017 riu o 000 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d OCLCQ
|d YDX
|d OCLCQ
|d LOA
|d OCLCO
|d OCLCF
|d K6U
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 993763716
|
020 |
|
|
|a 9781470437459
|
020 |
|
|
|a 1470437457
|
020 |
|
|
|z 9781470428105
|
020 |
|
|
|z 1470428105
|
029 |
1 |
|
|a AU@
|b 000069466657
|
035 |
|
|
|a (OCoLC)993770025
|z (OCoLC)993763716
|
050 |
|
4 |
|a QA268.I57 2015
|
082 |
0 |
4 |
|a 510
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Bassa, Alp.
|
245 |
1 |
0 |
|a Arithmetic, Geometry, Cryptography and Coding Theory.
|
260 |
|
|
|a Providence :
|b American Mathematical Society,
|c 2017.
|
300 |
|
|
|a 1 online resource (210 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Contemporary Mathematics ;
|v v. 686
|
588 |
0 |
|
|a Print version record.
|
505 |
0 |
|
|a Cover; Title page; Contents; Preface; The exact limit of some cubic towers; 1. Introduction; 2. Various Cubic Towers; 3. The Exact Genus and Exact Limit of Tower \GG; 4. Conclusion; Acknowledgment; References; Error-correction capability of Reed-Muller codes; 1. Introduction; 2. Presentation; 3. The results; 4. Proof of Theorem 3.1. Decoding a large number of errors; 5. The error correction capability function; 6. Note; References; Optimal and maximal singular curves; 1. Introduction; 2. Hallouin-Perret's approach; 3. Number of closed points of degree 2; 4. Genera spectrum of maximal curves.
|
504 |
|
|
|a ReferencesA infinite class of Kasami functions that are not APN infinitely often; 1. Introduction; 2. Preliminaries; 3. Another proof of a theorem of Janwa-Wilson; 4. Hyperplane sections; 5. Polynomials of Kasami Degree; Acknowledgements; References; Covariant algebra of the binary nonic and the binary decimic; 1. Introduction; 2. Mathematical framework; 3. Gordan's algorithm; 4. Improvements of Gordan's algorithm; 5. Computational aspects; 6. Results; Acknowledgement; References; Appendix A.A minimal basis for \cov{\Sn{9}}; Appendix B.A minimal basis for \cov{\Sn?}
|
505 |
8 |
|
|a On some bounds for symmetric tensor rank of multiplication in finite fields1. Introduction; 2. New upper bounds for the symmetric bilinear complexity; 3. Note on some unproven bounds; Acknowledgment; References; Codes from Jacobian surfaces; 1. Introduction; 2. Curves on abelian surfaces over finite fields; 3. Codes from Jacobian surfaces; 4. Some numerical results; Acknowledgments; References; A new proof of a Thomae-like formulafor non hyperelliptic genus 3 curves; 1. Introduction; 2. Review on Aronhold sets, fundamental systems and Riemann-Jacobi formula; 3. Proofs of Weber's formula.
|
505 |
8 |
|
|a AcknowledgmentReferences; Remarks on the Tsfasman-Boguslavsky Conjecture and higher weights of projective Reed-Muller codes; 1. Introduction; 2. Preliminaries; 3. TBC for Systems of Three Polynomial Equations; 4. Projective Reed-Muller codes and their higher weights; 5. A Counterexample to the TBC; Acknowledgment; References; Secret sharing schemes with strong multiplication and a large number of players from toric varieties; 1. Introduction; 2. Preliminaries; 3. Linear secret sharing schemes with multiplication on tori.
|
505 |
8 |
|
|a 4. Toric surfaces and linear secret sharing schemes with strong multiplicationReferences; Field extensions and index calculus on algebraic curves; 1. Introduction; 2. Index calculus and the divisor class group; 3. Known index calculus methods; 4. The general case; 5. Conclusion; References; Back Cover.
|
520 |
|
|
|a This volume contains the proceedings of the 15th International Conference on Arithmetic, Geometry, Cryptography, and Coding Theory (AGCT), held at the Centre International de Rencontres Mathématiques in Marseille, France, from May 18-22, 2015. Since the first meeting almost 30 years ago, the biennial AGCT meetings have been one of the main events bringing together researchers interested in explicit aspects of arithmetic geometry and applications to coding theory and cryptography. This volume contains original research articles reflecting recent developments in the field.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Coding theory
|v Congresses.
|
650 |
|
0 |
|a Geometry, Algebraic
|v Congresses.
|
650 |
|
0 |
|a Cryptography
|v Congresses.
|
650 |
|
0 |
|a Number theory
|v Congresses.
|
650 |
|
4 |
|a Information and communication, circuits
|x Theory of error-correcting codes and error-detecting codes
|x Geometric methods (including applications of algebraic geometry)
|
650 |
|
6 |
|a Géométrie algébrique
|v Congrès.
|
650 |
|
6 |
|a Cryptographie
|v Congrès.
|
650 |
|
6 |
|a Théorie des nombres
|v Congrès.
|
650 |
|
7 |
|a Coding theory
|2 fast
|
650 |
|
7 |
|a Cryptography
|2 fast
|
650 |
|
7 |
|a Geometry, Algebraic
|2 fast
|
650 |
|
7 |
|a Number theory
|2 fast
|
655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|
700 |
1 |
|
|a Couvreur, Alain.
|
700 |
1 |
|
|a Kohel, David.
|
758 |
|
|
|i has work:
|a Arithmetic, geometry, cryptography and coding theory (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCFTjhmgYpF89hcqXW9p49C
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Print version:
|a Bassa, Alp.
|t Arithmetic, Geometry, Cryptography and Coding Theory.
|d Providence : American Mathematical Society, ©2017
|z 9781470428105
|
830 |
|
0 |
|a Contemporary Mathematics.
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=4908299
|z Texto completo
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL4908299
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 14683171
|
994 |
|
|
|a 92
|b IZTAP
|