1 |
R. Hill, A First Course in Coding Theory, Oxford Applied Mathematics and Computing Science Series. The Clarendon Press, Oxford University Press, New York, 1986
|
2 |
S. T. Dougherty, T. A. Gulliver, and J. N. C. Wong, Self-dual codes over , Des. Codes Cryptogr. 41 (2006), no. 3, 235-249
DOI
|
3 |
S. T. Dougherty and T. A. Szczepanski, Latin k-hypercubes, submitted
|
4 |
K. Shiromoto and L. Storrne, A Griesmer Bound for Linear Codes over Finite QuasiFrobenius Rings, Discrete Appl, Math. 128 (2003), no. 1,263-274
DOI
ScienceOn
|
5 |
J. M. P. Balmaceda, A. L. Rowena, and F. R. Nemenzo, Mass formula for self-dual codes over , Discrete Math. (to appear)
|
6 |
T. Abualrub and R. Oehmke, On the generators of cyclic codes of length , IEEE Trans. Inform. Theory 49 (2003), no. 9, 2126-2133
DOI
ScienceOn
|
7 |
S. T. Dougherty and Y. H. Park, Codes over the p-adic integers, Des. Codes Cryptogr. 39 (2006), no. 1, 65-80
DOI
|
8 |
S. T. Dougherty and Y. H. Park, On modular cyclic codes, Finite Fields Appl. 13 (2007), no. 1, 31-57
DOI
ScienceOn
|
9 |
S. T. Dougherty and S. Ling, Cyclic codes over of even length, Des. Codes Cryptogr. 39 (2006), no. 2, 127-153
DOI
|
10 |
S. T. Dougherty, S. Y. Kim, and Y. H. Park, Lifted codes and their weight enumerators, Discrete Math. 305 (2005), no. 1-3, 123-135
DOI
ScienceOn
|
11 |
T. Blackford, Cyclic codes over of oddly even length, Discrete Appl. Math. 128 (2003), no. 1, 27-46
DOI
ScienceOn
|
12 |
A. R. Calderbank and N. J. A. Sloane, Modular and p-adic cyclic codes, Des. Codes Cryptogr. 6 (1995), no. 1, 21-35
DOI
|
13 |
S. T. Dougherty and K. Shiromoto, Maximum distance codes over rings of order 4, IEEE Trans. Inform. Theory 47 (2001), no. 1, 400-404
DOI
ScienceOn
|
14 |
J. H. Conway and N. J. A. Sloane, Self-dual codes over the integers modulo 4, J. Combin, Theory Ser. A 62 (1993), no. 1, 30-45
DOI
|
15 |
S. T. Dougherty, M. Harada, and P. Sole, Self-dual codes over rings and the Chinese remainder theorem, Hokkaido Math. J. 28 (1999), no. 2, 253-283
DOI
|
16 |
S. T. Dougherty and K. Shiromoto, MDR codes over , IEEE Trans. Inform. Theory 46 (2000), no. 1, 265-269
DOI
ScienceOn
|
17 |
J. Fields, P. Gaborit, J. S. Leon, and V. Pless, All self-dual codes of length 15 or less are known, IEEE Trans. Inform. Theory 44 (1998), no. 1, 311-322
DOI
ScienceOn
|
18 |
M. Greferath, G. McGuire, and M. O'Sullivan, On Plotkin-optimal codes over finite F'robenius rings, J. Algebra Appl. 5 (2006), no. 6, 799-815
DOI
ScienceOn
|
19 |
T. A. Gulliver and J. N. C. Wong, Classification of Optimal Linear Rate 1/2 Codes of Length 8, submitted
|
20 |
Y. H. Park, Modular Independence and Generator Matrices for Codes over , submitted
DOI
|
21 |
V. Pless, J. S. Leon, and J. Fields, All codes of type II and length 16 are known, J. Combin. Theory Ser. A 78 (1997), no. 1,32-50
DOI
ScienceOn
|
22 |
J. Wood, Duality for modules over finite rings and applications to coding theory, Amer. J. Math. 121 (1999), no. 3, 555-575
DOI
|
23 |
G. H. Norton and A. Salagean, On the Hamming distance of linear codes over a finite chain ring, IEEE Trans. Inform. Theory 46 (2000), no. 3, 1060-1067
DOI
ScienceOn
|
24 |
W. C. Huffman and V. S. Pless, Fundamentals of Error-correcting Codes, Fundamentals of error-correcting codes. Cambridge University Press, Cambridge, 2003
|
25 |
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes, NorthHolland, Amsterdam, 1977
|