![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Gilles Lachaud
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [i1]Yves Aubry, Wouter Castryck, Sudhir R. Ghorpade, Gilles Lachaud, Michael E. O'Sullivan, Samrith Ram:
Hypersurfaces in weighted projective spaces over finite fields with applications to coding theory. CoRR abs/1706.03050 (2017)
1990 – 1999
- 1995
- [j7]Gilles Lachaud, Michael A. Tsfasman, Jørn Justesen, Victor K.-W. Wei:
Introduction to the special issue on algebraic geometry codes. IEEE Trans. Inf. Theory 41(6): 1545-1547 (1995) - 1994
- [j6]Gilles Lachaud, Jacques Stern:
Polynomial-time construction of codes II. Spherical codes and the kissing number of spheres. IEEE Trans. Inf. Theory 40(4): 1140-1146 (1994) - 1993
- [c4]Gilles Lachaud:
Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions. AAECC 1993: 231-243 - 1992
- [j5]Gilles Lachaud, Jacques Stern:
Polynomial-Time Construction of Codes I: Linear Codes with Almost Equal Weights. Appl. Algebra Eng. Commun. Comput. 3: 151-161 (1992) - [j4]Gilles Lachaud:
Artin-Schreier Curves, Exponential Sums, and Coding Theory. Theor. Comput. Sci. 94(2): 295-310 (1992) - 1991
- [c3]Gilles Lachaud, Jacques Stern:
Polynomial-Time Construction of Spherical Codes. AAECC 1991: 218-223 - 1990
- [j3]Gilles Lachaud:
Distribution of the weights of the dual of the melas code. Discret. Math. 79(1): 103-106 (1990) - [j2]Gilles Lachaud:
The parameters of projective Reed-Müller codes. Discret. Math. 81(2): 217-221 (1990) - [j1]Gilles Lachaud, Jacques Wolfmann:
The weights of the orthogonals of the extended quadratic binary Goppa codes. IEEE Trans. Inf. Theory 36(3): 686-692 (1990)
1980 – 1989
- 1988
- [c2]Gilles Lachaud:
Exponential sums and the Carlitz-Uchiyama bound. Coding Theory and Applications 1988: 63-75 - 1986
- [c1]Gilles Lachaud:
Projective Reed - Muller Codes. Coding Theory and Applications 1986: 125-129
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint