A new upper bound on the minimal distance of self-dual codes
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (6) , 1319-1333
- https://doi.org/10.1109/18.59931
Abstract
No abstract availableThis publication has 50 references indexed in Scilit:
- Self-orthogonal designsContemporary Mathematics, 1990
- Self-orthogonal designs and extremal doubly even codesJournal of Combinatorial Theory, Series A, 1989
- A method for constructing inequivalent self-dual codes with applications to length 56IEEE Transactions on Information Theory, 1987
- Duadic CodesIEEE Transactions on Information Theory, 1984
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- Upper bounds for modular forms, lattices, and codesJournal of Algebra, 1975
- An upper bound for self-dual codesInformation and Control, 1973
- Good self dual codes existDiscrete Mathematics, 1972
- Generalizations of Gleason's theorem on weight enumerators of self-dual codesIEEE Transactions on Information Theory, 1972
- Orthogonal circulant matrices over finite fields, and how to find themJournal of Combinatorial Theory, Series A, 1971