Overlap and covering polynomials with applications to designs and self-dual codes

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 2, 2000, Pages 154-178

  Janusz, Gerald J ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Design; Extremal code; Self dual code; Weight enumerator

Indexed keywords

EID: 1842787474     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480198341766     Document Type: Article

References (6)

1. E. F. ASSMUS JR. AND H. F. MATTSON JR., New 5-designs, J. Combin. Theory, 6 (1969), pp. 122-151.
2. E. F. ASSMUS JR. AND V. PLESS, On the covering radius of extremal self-dual codes, IEEE Trans. Inform. Theory, IT-29, (1983), pp. 359-363.
3. J. H. CONWAY AND N. J. A. SLOANE, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory, 36 (1990), pp. 1319-1333.
4. C. J. COLBOURN AND J. H. DINITZ, EDS., The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996.
5. F. J. MACWILLIAMS AND N. J. A. SLOANE, Theory of Error Correcting Codes, North-Holland, Amsterdam, 1977.
6. M. OZEKI, On the notion of Jacobi polynomials for codes, Math. Proc. Cambridge Philos. Soc., 121 (1997), pp. 15-30.