The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255

Wambach, Georg (1993) The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255.
Technical Report , 7 p.

Abstract

Using equivalent codes it is shown that the BCH-bound of the following narrow-sense BCH-codes already yields the true minimum distance: [255,87,53], [255,107,45], [255,115,43], [255,123,39], [255,131,37], [255,147,29], [255,163,25], [255,179,21]. For the remaining two narrow-sense BCH-codes of length 255 in the book of F.J. MacWilliams and N.J.A. Sloane [The theory of error-correcting codes (1977)] page 261, figure 9.1, whose true minimum distance is still unknown, upper bounds for the minimum distance are given which differ by at most two from the corresponding BCH-bounds.


Actions:
Download: [img] Postscript
Download (138kB) | Preview
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr93-144
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 19 Dec 2011 09:45
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/144