The following pages link to Jörn Quistorff (Q213799):
Displaying 24 items.
- A new nonexistence result for sharply multiply transitive permutation sets. (Q704296) (← links)
- Lower bounds on covering codes via partition matrices (Q1003655) (← links)
- On a generalization of both affine planes and MDS-codes with applications to experiment planning (Q1365037) (← links)
- Algebraic representation of affine MDS-codes and mutually orthogonal Latin squares (Q1385226) (← links)
- Some remarks on the Plotkin bound (Q1408546) (← links)
- On full partial quasigroups of finite order and local cardinal maximum codes (Q1567467) (← links)
- New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002) (← links)
- Slight improvements of the Singleton bound (Q1887651) (← links)
- On Rosenbloom and Tsfasman's generalization of the Hamming space (Q2455578) (← links)
- New upper bounds on Lee codes (Q2492226) (← links)
- A survey on packing and covering problems in the Hamming permutation space (Q2501003) (← links)
- Problems of isomorphy concerning the algebraic representation of affine MDS-codes. (Q2718781) (← links)
- Combinatorial problems in the Enomoto-Katona space (Q3076868) (← links)
- (Q3626214) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- (Q4836745) (← links)
- On generalized surjective codes (Q4913510) (← links)
- New upper bounds on Enomoto Katona’s coding type problem (Q5313922) (← links)
- (Q5480691) (← links)
- (Q5881880) (← links)
- On mixed codes with covering radius 1 and minimum distance 2 (Q5900065) (← links)
- On mixed codes with covering radius 1 and minimum distance 2 (Q5901517) (← links)
- On codes with given minimum distance and covering radius (Q5948433) (← links)
- (Q6483300) (← links)
