Christine Bachoc

Orcid: 0000-0001-8234-316X

According to our database1, Christine Bachoc authored at least 29 papers between 1992 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
On the Density of Sets Avoiding Parallelohedron Distance 1.
Discret. Comput. Geom., 2019

2018
Revisiting Kneser's Theorem for Field Extensions.
Comb., 2018

2017
The Theta Number of Simplicial Complexes.
CoRR, 2017

2015
Signal Reconstruction From the Magnitude of Subspace Components.
IEEE Trans. Inf. Theory, 2015

The Density of Sets Avoiding Distance 1 in Euclidean Space.
Discret. Comput. Geom., 2015

An analogue of Vosper's Theorem for Extension Fields.
CoRR, 2015

2013
Squares and Difference Sets in Finite Fields.
Integers, 2013

On the theta number of powers of cycle graphs.
Comb., 2013

Bounds for projective codes from semidefinite programming.
Adv. Math. Commun., 2013

2012
Tight p-fusion frames
CoRR, 2012

2011
On Bounded Weight Codes.
IEEE Trans. Inf. Theory, 2011

2010
Bounds for binary codes relative to pseudo-distances of k points.
Adv. Math. Commun., 2010

Applications of semidefinite programming to coding theory.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
Optimality and uniqueness of the (4, 10, 1/6) spherical code.
J. Comb. Theory A, 2009

Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps.
Eur. J. Comb., 2009

Semidefinite programming, harmonic analysis and coding theory
CoRR, 2009

2008
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds.
IEEE Trans. Inf. Theory, 2008

2007
Semidefinite programming bounds for spherical codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Bounds for Codes in the Grassmann Manifold.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Linear programming bounds for codes in grassmannian spaces.
IEEE Trans. Inf. Theory, 2006

2004
Designs and self-dual codes with long shadows.
J. Comb. Theory A, 2004

Codes and designs in Grassmannian spaces.
Discret. Math., 2004

2001
On Extremal Additive <i>I</i><sub>4</sub> Codes of Length 10 to 18.
Electron. Notes Discret. Math., 2001

1999
On Harmonic Weight Enumerators of Binary Codes.
Des. Codes Cryptogr., 1999

Harmonic weight enumerators of nonbinary codes and MacWilliams identities.
Proceedings of the Codes and Association Schemes, 1999

1997
Type II codes over Z<sub>4</sub>.
IEEE Trans. Inf. Theory, 1997

Applications of Coding Theory to the Construction of Modular Lattices.
J. Comb. Theory A, 1997

Classification of Two Genera of 32-Dimensional Lattices of Rank 8 over the Hurwitz Order.
Exp. Math., 1997

1992
Etude Algorithmique de Réseaux Construits avec la Forme Trace.
Exp. Math., 1992


  Loading...