2008 |
12 | EE | Thomas Britz,
Keisuke Shiromoto:
Designs from subcode supports of linear codes.
Des. Codes Cryptography 46(2): 175-189 (2008) |
11 | EE | Thomas Britz,
Keisuke Shiromoto:
A MacWilliams type identity for matroids.
Discrete Mathematics 308(20): 4551-4559 (2008) |
2007 |
10 | EE | Dieter Britz,
Thomas Britz,
Keisuke Shiromoto,
Henrik Kragh Sørensen:
The Higher Weight Enumerators of the Doubly-Even, Self-Dual [48, 24, 12] Code.
IEEE Transactions on Information Theory 53(7): 2567-2571 (2007) |
2005 |
9 | EE | Keisuke Shiromoto:
Second Support Weights for Binary Self-dual Codes.
WCC 2005: 1-13 |
2004 |
8 | EE | Steven T. Dougherty,
Keisuke Shiromoto:
Maximum Distance Codes in Matn, s(Zk) with a Non-Hamming Metric and Uniform Distributions.
Des. Codes Cryptography 33(1): 45-61 (2004) |
2003 |
7 | EE | Keisuke Shiromoto:
On g-th MDS Codes and Matroids.
AAECC 2003: 226-234 |
6 | EE | Keisuke Shiromoto,
Leo Storme:
A Griesmer Bound for Linear Codes Over Finite Quasi-Frobenius Rings.
Discrete Applied Mathematics 128(1): 263-274 (2003) |
2001 |
5 | EE | Hiroshi Horimoto,
Keisuke Shiromoto:
On Generalized Hamming Weights for Codes over Finite Chain Rings.
AAECC 2001: 141-150 |
4 | EE | Keisuke Shiromoto,
Leo Storme:
A Griesmer Bound for Codes over Finite Quasi-Frobenius Rings.
Electronic Notes in Discrete Mathematics 6: 337-345 (2001) |
3 | | Steven T. Dougherty,
Keisuke Shiromoto:
Maximum distance codes over rings of order 4.
IEEE Transactions on Information Theory 47(1): 400-404 (2001) |
2000 |
2 | | Steven T. Dougherty,
Keisuke Shiromoto:
MDR codes over Zk.
IEEE Transactions on Information Theory 46(1): 265-269 (2000) |
1999 |
1 | | Keisuke Shiromoto:
The Weight Enumerator of Linear Codes over GF Having Generator Matrix over GF.
Des. Codes Cryptography 16(1): 87-92 (1999) |