Codes by Danev and Olsson
Let b ≥ 4 denote a prime power. In [1] it is shown that the narrow sense BCH code with length b(b−1) + 1 and defining interval [0, 1] over Fb is has minimum distance 6, i.e., the resulting code is a
[b(b – 1) + 1, b(b – 1) – 6, 6] - code
over Fb.
See Also
[2, Theorem 13.18]
References
| [1] | Danyo Danev and Jonas Olsson. On a sequence of cyclic codes with minimum distance six. IEEE Transactions on Information Theory, 46(2):673–674, March 2000. doi:10.1109/18.825840 MR1748995 (2001a:94041) |
| [2] | Jürgen Bierbrauer. Introduction to Coding Theory. Discrete Mathematics and its Applications. Chapman & Hall/CRC, Boca Raton, London, New York, Washington D.C., 2004. MR2079734 (2005f:94001) |
Copyright
Copyright © 2004, 2005, 2006, 2007, 2008, 2009, 2010 by Rudolf Schürer and Wolfgang Ch. Schmid.
Cite this as: Rudolf Schürer and Wolfgang Ch. Schmid. “Codes by Danev and Olsson.”
From MinT—the database of optimal net, code, OA, and OOA parameters.
Version: 2024-09-05.
http://mint.sbg.ac.at/desc_CDanevOlsson.html