On some polynomials related to weight enumerators of linear codes

SIAM Journal on Discrete Mathematics

Volumn 15, Issue 2, 2002, Pages 155-164

  Barg, Alexander ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

All terminal reliability; Greene's theorem; Linear code; Linear matroid; Potts model; Rank polynomial; Tutte polynomial; Weight enumerator

Indexed keywords

BOUNDARY CONDITIONS; CODES (SYMBOLS); FUNCTIONS; MATHEMATICAL MODELS; PROBABILITY; THEOREM PROVING; VECTORS;

LINEAR CODES; LINEAR MATROID; POTTS MODEL; RANK POLYNOMIAL; TUTTE POLYNOMIAL; WEIGHT ENUMERATORS;

POLYNOMIALS;

EID: 0036487458     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199364148     Document Type: Article

References (24)

1. A. Ashikhmin, A. Barg, and S. Litsyn, Estimates of the distance distribution of codes and designs, IEEE Trans. Inform. Theory, 47 (2001), pp. 1050-1061.
2. A. Ashikhmin, A. Barg, and S. Litsyn, Estimates of the distance distribution of nonbinary codes, with applications, in Codes and Association Schemes, A. Barg and S. Litsyn, eds., AMS, Providence, RI, 2001, pp. 287-303.
3. A. Barg, The matroid of supports of a linear code, Appl. Algebra Engrg. Commun. Comput., 8 (1997), pp. 165-172.
4. A. Barg and A. Ashikhmin, Binomial moments of the distance distribution and the probability of undetected error, Des. Codes Cryptogr., 16 (1999), pp. 103-116.
5. N. L. Biggs, Interaction Models, London Math. Soc. Lecture Note Ser. 30, Cambridge University Press, Cambridge, UK, 1977.
6. T. H. Brylawski and J. G. Oxley, The Tutte polynomial and its applications, in Matroid Applications, Encyclopedia Math. Appl. 40, N. White, ed., Cambridge University Press, Cambridge, UK, 1992, pp. 123-225.
7. C. J. Colbourn, and D. D. Harms, Bounding all-terminal reliability in computer networks, Networks, 18 (1988), pp. 1-12.
8. C. Greene, Weight enumeration and the geometry of linear codes, Stud. Appl. Math., 55 (1976), pp. 119-128.
9. S. L. Hakimi and J. G. Bredeson, Graph theoretic error-correcting codes, IEEE Trans. Inform. Theory, 14 (1968), pp. 584-591.
10. T. Helleseth, T. Klove, and V. I. Levenshtein, On the information function of an error-correcting code, IEEE Trans. Inform. Theory, 43 (1997), pp. 549-557.
11. F. Jaeger, Tutte polynomial and link polynomials, Proc. Amer. Math. Soc., 103 (1988), pp. 647-654.
12. T. Klove and V. I. Korzhik, Error Detecting Codes, Kluwer Academic Publishers, Boston, 1995.
13. V. I. Korzhik, Bounds on the probability of undetected error and optimum group codes in a channel with feedback, Radiotechnika, 20 (1965), pp. 27-33 (in Russian). English translation in Telecommun. Radio Eng., 20 (1, pt.2) (1965), pp. 87-92.
14. V. I. Levenshtein, Bounds on the probability of undetected error, Problemy Peredachi Informatsii, 13 (1977), pp. 3-18.
15. V. I. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces, IEEE Trans. Inform. Theory, 41 (1995), pp. 1303-1321.
16. F. J. MacWilliams, A theorem in the distribution of weights in a systematic code, Bell System Tech. J., 42 (1963), pp. 79-94.
17. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, 3rd ed., North-Holland, Amsterdam, 1991.
18. K. Nomura, Spin models and Bose-Mesner algebra, European J. Combin., 20 (1999), pp. 691-700.
19. V. Pless and W. C. Huffman, eds., Handbook of Coding Theory, Vol. 1, 2, Elsevier Science, Amsterdam, 1998.
20. V. Reiner, An interpretation for the Tutte polynomial, European J. Combin., 20 (1999), pp. 149-161.
21. J. Simonis, The effective length of subcodes, Appl. Algebra Engrg. Commun. Comput., 5 (1994), pp. 371-377.
22. J. Simonis and A. Ashikhmin, Almost affine codes, Des. Codes Cryptogr., 14 (1998), pp. 179-197.
23. D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.
24. D. J. A. Welsh, Complexity: Knots, Colourings and Counting, London Math. Soc. Lecture Notes Ser. 186, Cambridge University Press, Cambridge, UK, 1993.