Jörn Quistorff

According to our database1, Jörn Quistorff authored at least 10 papers between 2003 and 2009.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Lower bounds on covering codes via partition matrices.
J. Comb. Theory A, 2009

2007
On mixed codes with covering radius 1 and minimum distance 2: (extended abstract).
Electron. Notes Discret. Math., 2007

On Rosenbloom and Tsfasman's generalization of the Hamming space.
Discret. Math., 2007

On Mixed Codes with Covering Radius 1 and Minimum Distance 2.
Electron. J. Comb., 2007

2006
New upper bounds on Lee codes.
Discret. Appl. Math., 2006

A Survey on Packing and Covering Problems in the Hamming Permutation Space.
Electron. J. Comb., 2006

2005
New Results on Codes with Covering Radius 1 and Minimum Distance 2.
Des. Codes Cryptogr., 2005

2004
A new nonexistence result for sharply multiply transitive permutation sets.
Discret. Math., 2004

Slight improvements of the Singleton bound.
Discret. Math., 2004

2003
Some Remarks on the Plotkin Bound.
Electron. J. Comb., 2003


  Loading...