ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
Binomial and monotonic behavior of the probability of undetected error and the 2-r-bound
WSEAS TRANSACTIONS on COMMUNICATIONS
WSEAS TRANSACTIONS on COMMUNICATIONS
The minimum distance of the dual of a CRC
CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
| Hi-index | 754.84 |
Using a variant of the linear programming method we derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n. Asymptotically, for n growing, it gives d/n⩽0.166315···+o(1), thus improving on the Mallows-Odlyzko-Sloane bound of 1/6. To establish this, we prove that in any doubly even-self-dual code the distance distribution is asymptotically upper-bounded by the corresponding normalized binomial distribution in a certain interval