Abstract
In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between support weight enumerators and coset weight distributions of a code that can be used to compute partial information about one set of these code invariants from the other. The support weight enumerators and complete coset weight distributions of several even, isodual codes of length up to 22 are computed as well. It is observed that there exist inequivalent codes with the same support weight enumerators, inequivalent codes with the same complete coset weight distribution and inequivalent codes with the same support eight enumerators and complete coset weight distribution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Assmuss V. Pless (1983) ArticleTitleOn the covering radius of extremal self-dual codes IEEE Transactions on Information Theory 29 IssueID3 359–363
C. Bachoc (1999) ArticleTitleOn harmonic weight enumerators of binary codes Designs, Codes and Cryptography 18 IssueID1–3 11–28
H. Chen J. Coffey (2001) ArticleTitleTrellis structure and higher weights of extremal self-dual codes Designs, Codes, and Cryptography 24 IssueID1 15–36
S. Dodunekov N. Manev (1985) ArticleTitleAn improvement of the Griesmer bound for some small minimum distances Discrete Applied Mathmatics 12 103–114
S. Dougherty, A. Gulliver and M. Oura, Higher weights and graded rings for binary self-dual codes, in submission.
R. Eriksson, A property of coset weight distributions, Proceedings of the Sixth International Workshop on Algebraic and Combinatorial Coding Theory, Pskov, Russia (1998) pp. 112–115.
J. E. Fields P. Gaborit W. C. Huffman V. Pless (1999) ArticleTitleOn the classification of extremal even formally self-dual codes Designs, Codes and Cryptography 18 IssueID1–3 125–148
J. Fields P. Gaborit W. Huffman V. Pless (2001) ArticleTitleOn the classification of extremal even formally self-dual codes of lengths 20 and 22 Discrete Applied Mathmatics 111 75–86
G. D. Forney SuffixJr. (1994) ArticleTitleDimension/length profiles and trellis complexity of linear block codes IEEE Transactions on Infomation Theory IT-40 IssueID6 1741–1752
A. Gulliver M. Harada (1997) ArticleTitleClassification of extremal double circulant formally self-dual even codes Designs, Codes and Cryptography 11 25–35
T. Helleseth T. Kløve J. Mykkeltveit (1977) ArticleTitleThe weight distribution of irreducible cyclic codes with block length n1((ql-1)/N) Discrete Mathmatics 18 179–211
D. Hoffman (1993) ArticleTitleLinear codes and weights Australian Journal of Combinatorics 7 37–45
David Jaffe’s database of optimal binary codes: bigbox.unl.edu/codeform.
G. Kabatianski, On the second generalized Hamming weight, Proceedings of the Algebraic and Combinatorial Coding Theory Workshop, Voneshta Voda, Bulgaria (1992) pp. 98–100.
T. Kasami T. Takata T. Fujiwara S. Lin (1993) ArticleTitleOn the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes IEEE Transaction on Information Theory 39 242–245
T. Kløve (1992) ArticleTitleSupport weight distribution of linear codes Discrete Mathmatics 106/107 311–316
H. Koch (1989) ArticleTitleOn self-dual, doubly–even codes of length 32 Journal of Combinatorial Theory, A 51 IssueID1 63–76
F. J. MacWilliams N. J. A. Sloane (1977) The Theory of Error-Correcting Codes North-Holland Publishing Company New York
O. Milenkovic, J. Coffey and K. Compton, On the generalized Hamming weight enumerators of the doubly–even [32,16,8] self-dual codes, submitted to IEEE Transaction on Information Theory.
O. Moreno J. Pedersen D. Polemi (1998) ArticleTitleImproved Serre bound for elementary Abelian extensions of F q (x) and the generalized Hamming weights of duals of BCH codes IEEE Transaction on Information Theory} 44 IssueID3 1292–1293
V. Pless (1975) ArticleTitleOn the classification and enumeration of self-dual codes Journal of Combinatorial Theory} {A} 18 313–335
V. Pless (1972) ArticleTitleA classification of self-orthogonal codes over GF(2)’‘ Discrete Mathmatics 3 209–246
E. M. Rains N. J. Sloane (1998) self-dual codes V. Pless W. Huffman (Eds) Handbook of Coding Theory, Vol. 1 North Holland Publishing Company Amsterdam
C. Shim H. Chung (1995) ArticleTitleOn the second generalized Hamming weight of the dual code of a double-error correcting binary BCH code’‘ IEEE Transaction on Information Theory 41 IssueID3 805–808
J. Simonis (1992) ArticleTitleThe [18,9,6] code is unique Discrete Mathematics 106/107 439–448
J. Simonis (1994) ArticleTitleThe effective length of subcodes Applicable Algebra in Engineering, Communication, and Computing 5 IssueID3 371–377
H. Stichtenoth C. Voss (1994) ArticleTitleGeneralized Hamming weights of trace codes IEEE Transaction on Information Theory 40 IssueID2 554–558
M. Tsfasman S. Vladut (1995) ArticleTitleGeometric approach to higher weights IEEE Transaction on Information Theory 41 IssueID6 1042–1073
G. Geer Particlevan der M. Vlugt Particlevan der (1995) ArticleTitleGeneralized Hamming weights of BCH(3) revisited IEEE Transaction on Information Theory 41 IssueID1 300–301
V. Wei (1991) ArticleTitleGeneralized Hamming weights for linear codes IEEE Transaction on Information Theory 37 IssueID5 1412–1418
Author information
Authors and Affiliations
Additional information
Communicated by:T. Helleseth
AMS Classification: 11T71, 68P30
Parts of the results in this paper were presented at the 2001 International Symposium on Information Theory, Washington, and at the 2002 International Symposium on Information Theory, Lauzanne.
Rights and permissions
About this article
Cite this article
Milenkovic, O. Support Weight Enumerators and Coset Weight Distributions of Isodual Codes. Des Codes Crypt 35, 81–109 (2005). https://doi.org/10.1007/s10623-003-6152-1
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-003-6152-1