default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristine Bachoc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j21]Christine Bachoc
, Thomas Bellitto, Philippe Moustrou, Arnaud Pêcher:
On the Density of Sets Avoiding Parallelohedron Distance 1. Discret. Comput. Geom. 62(3): 497-524 (2019)- 2018
- [j20]Christine Bachoc, Oriol Serra, Gilles Zémor:
Revisiting Kneser's Theorem for Field Extensions. Comb. 38(4): 759-777 (2018) - 2017
- [i8]Christine Bachoc, Anna Gundert, Alberto Passuello:
The Theta Number of Simplicial Complexes. CoRR abs/1704.01836 (2017) - 2015
- [j19]Christine Bachoc, Alberto Passuello, Alain Thiéry:
The Density of Sets Avoiding Distance 1 in Euclidean Space. Discret. Comput. Geom. 53(4): 783-808 (2015) - [j18]Christine Bachoc, Martin Ehler:
Signal Reconstruction From the Magnitude of Subspace Components. IEEE Trans. Inf. Theory 61(7): 4015-4027 (2015) - [i7]Christine Bachoc, Oriol Serra, Gilles Zémor:
An analogue of Vosper's Theorem for Extension Fields. CoRR abs/1501.00602 (2015) - 2013
- [j17]Christine Bachoc, Alberto Passuello, Frank Vallentin:
Bounds for projective codes from semidefinite programming. Adv. Math. Commun. 7(2): 127-145 (2013) - [j16]Christine Bachoc, Arnaud Pêcher, Alain Thiéry:
On the theta number of powers of cycle graphs. Comb. 33(3): 297-317 (2013) - [j15]Christine Bachoc, Máté Matolcsi, Imre Z. Ruzsa:
Squares and Difference Sets in Finite Fields. Integers 13: A77 (2013) - 2012
- [i6]Christine Bachoc, Martin Ehler:
Tight p-fusion frames. CoRR abs/1201.1798 (2012) - [i5]Christine Bachoc, Frank Vallentin, Alberto Passuello:
Bounds for projective codes from semidefinite programming. CoRR abs/1205.6406 (2012) - 2011
- [j14]Christine Bachoc, Venkat Chandar, Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
On Bounded Weight Codes. IEEE Trans. Inf. Theory 57(10): 6780-6787 (2011) - 2010
- [j13]Christine Bachoc, Gilles Zémor:
Bounds for binary codes relative to pseudo-distances of k points. Adv. Math. Commun. 4(4): 547-565 (2010) - [c4]Christine Bachoc:
Applications of semidefinite programming to coding theory. ITW 2010: 1-5 - [i4]Christine Bachoc, Gilles Zémor:
Bounds for binary codes relative to pseudo-distances of k points. CoRR abs/1002.3024 (2010) - [i3]Christine Bachoc:
Applications of semidefinite programming to coding theory. CoRR abs/1009.1512 (2010) - [i2]Christine Bachoc, Venkat Chandar, Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
On Bounded Weight Codes. CoRR abs/1009.3657 (2010)
2000 – 2009
- 2009
- [j12]Christine Bachoc, Frank Vallentin:
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps. Eur. J. Comb. 30(3): 625-637 (2009) - [j11]Christine Bachoc, Frank Vallentin:
Optimality and uniqueness of the (4, 10, 1/6) spherical code. J. Comb. Theory A 116(1): 195-204 (2009) - [i1]Christine Bachoc:
Semidefinite programming, harmonic analysis and coding theory. CoRR abs/0909.4767 (2009) - 2008
- [j10]Christine Bachoc, Yael Ben-Haim, Simon Litsyn:
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds. IEEE Trans. Inf. Theory 54(3): 1024-1035 (2008) - 2007
- [c3]Christine Bachoc, Yael Ben-Haim, Simon Litsyn:
Bounds for Codes in the Grassmann Manifold. ISIT 2007: 1796-1800 - [c2]Christine Bachoc, Frank Vallentin:
Semidefinite programming bounds for spherical codes. ISIT 2007: 1801-1805 - 2006
- [j9]Christine Bachoc:
Linear programming bounds for codes in grassmannian spaces. IEEE Trans. Inf. Theory 52(5): 2111-2125 (2006) - 2004
- [j8]Christine Bachoc, Eiichi Bannai, Renaud Coulangeon:
Codes and designs in Grassmannian spaces. Discret. Math. 277(1-3): 15-28 (2004) - [j7]Christine Bachoc, Philippe Gaborit:
Designs and self-dual codes with long shadows. J. Comb. Theory A 105(1): 15-34 (2004) - 2001
- [j6]Christine Bachoc, Philippe Gaborit:
On Extremal Additive I4 Codes of Length 10 to 18. Electron. Notes Discret. Math. 6: 55-64 (2001)
1990 – 1999
- 1999
- [j5]Christine Bachoc:
On Harmonic Weight Enumerators of Binary Codes. Des. Codes Cryptogr. 18(1/3): 11-28 (1999) - [c1]Christine Bachoc:
Harmonic weight enumerators of nonbinary codes and MacWilliams identities. Codes and Association Schemes 1999: 1-23 - 1997
- [j4]Christine Bachoc, Gabriele Nebe:
Classification of Two Genera of 32-Dimensional Lattices of Rank 8 over the Hurwitz Order. Exp. Math. 6(2): 151-162 (1997) - [j3]Christine Bachoc:
Applications of Coding Theory to the Construction of Modular Lattices. J. Comb. Theory A 78(1): 92-119 (1997) - [j2]Alexis Bonnecaze, Patrick Solé, Christine Bachoc, Bernard Mourrain:
Type II codes over Z4. IEEE Trans. Inf. Theory 43(3): 969-976 (1997) - 1992
- [j1]Christine Bachoc, Christian Batut:
Etude Algorithmique de Réseaux Construits avec la Forme Trace. Exp. Math. 1(3): 183-190 (1992)
Coauthor Index
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-06-10 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
