Jörn Quistorff

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

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2009

Lower bounds on covering codes via partition matrices.

Wolfgang Haas, Jan-Christoph Schlage-Puchta, Jörn Quistorff

J. Comb. Theory A, 2009

2007

On mixed codes with covering radius 1 and minimum distance 2: (extended abstract).

Wolfgang Haas, Jörn Quistorff

Electron. Notes Discret. Math., 2007

On Rosenbloom and Tsfasman's generalization of the Hamming space.

Jörn Quistorff

Discret. Math., 2007

On Mixed Codes with Covering Radius 1 and Minimum Distance 2.

Wolfgang Haas, Jörn Quistorff

Electron. J. Comb., 2007

2006

New upper bounds on Lee codes.

Jörn Quistorff

Discret. Appl. Math., 2006

A Survey on Packing and Covering Problems in the Hamming Permutation Space.

Jörn Quistorff

Electron. J. Comb., 2006

2005

New Results on Codes with Covering Radius 1 and Minimum Distance 2.

Patric R. J. Östergård, Jörn Quistorff, Alfred Wassermann

Des. Codes Cryptogr., 2005

2004

A new nonexistence result for sharply multiply transitive permutation sets.

Jörn Quistorff

Discret. Math., 2004

Slight improvements of the Singleton bound.

Jörn Quistorff

Discret. Math., 2004

2003

Some Remarks on the Plotkin Bound.

Jörn Quistorff

Electron. J. Comb., 2003