New explicit bounds for ordered codes and $(t,m,s)$-nets. (English)
Discrete Math. 310, No. 4, 970-975 (2010).
1
A direct approach to linear programming bounds for codes and tms-nets. (English)
Des. Codes Cryptography 42, No. 2, 127-143 (2007).
2
An asymptotic {G}ilbert-{V}arshamov bound for $(T,M,S)$-nets. (English)
Integers 5, No. 3, Paper A04, 11 p., electronic only (2005).
3
Families of nets of low and medium strength. (English)
Integers 5, No. 3, Paper A03, 13 p., electronic only (2005).
4
Hypercubic 4 and 5-designs from double-error-correcting BCH codes. (English)
Des. Codes Cryptography 28, No.3, 265-282 (2003).
5
Coding-theoretic constructions for ($t,m,s$)-nets and ordered orthogonal arrays. (English)
J. Comb. Des. 10, No. 6, 403-418 (2002).
6
A note on geometric structures of linear ordered orthogonal arrays and $(t,m,s)$-nets of low strength. (English)
Des. Codes Cryptography 26, No.1-3, 257-263 (2002).
7
Association schemes for ordered orthogonal arrays and $(T,M,S)$-nets. (English)
Can. J. Math. 51, No.2, 326-346 (1999).
8
Start
Contact
Print
General Help
