The Erdo¨s-Ko-Rado theorem for vector spaces
Journal of Combinatorial Theory Series A
On the Nonexistence of Perfect Codes in the JohnsonScheme
SIAM Journal on Discrete Mathematics
The complete intersection theorem for systems of finite sets
European Journal of Combinatorics
Tiling hamming space with few spheres
Journal of Combinatorial Theory Series A
Regular Article: The Diametric Theorem in Hamming Spaces驴Optimal Anticodes
Advances in Applied Mathematics
Codes and anticodes in the Grassman graph
Journal of Combinatorial Theory Series A
Discrete Applied Mathematics
Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
Mathematical Methods in Computer Science
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams
IEEE Transactions on Information Theory
Correcting charge-constrained errors in the rank-modulation scheme
IEEE Transactions on Information Theory
Constant-rank codes and their connection to constant-dimension codes
IEEE Transactions on Information Theory
Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes
IEEE Transactions on Information Theory
Optimal permutation anticodes with the infinity norm via permanents of (0,1)-matrices
Journal of Combinatorial Theory Series A
Generalized anticodes in hamming spaces
General Theory of Information Transfer and Combinatorics
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
A new approach towards the Golomb-Welch conjecture
European Journal of Combinatorics
Designs, Codes and Cryptography
| Hi-index | 0.24 |
In 1987, Teirlinckproved that if t and v are two integerssuch that v \equiv t \pmod {(t+1)!^{(2t+1)}} andv \geqslant t+1 0, then there exists a t-(v,t+1,(t+1)!^{(2t+1)})design. ...