article · IEEE Transactions on Information Theory · 1986
On the minimum distance of cyclic codes
Cited by 179Open access
Abstract
The main result is a new lower bound for the minimum distance of cyclic codes that includes earlier bounds (i.e., BCH bound, HT bound, Roos bound). This bound is related to a second method for bounding the minimum distance of a cyclic code, which we call shifting. This method can be even stronger than the first one. For all binary cyclic codes of length< 63(with two exceptions), we show that our methods yield the true minimum distance. The two exceptions at the end of our list are a code and its even-weight subcode. We treat several examples of cyclic codes of length\geq 63.
Cite this paper
van Lint, J., & Wilson, R. (1986). On the minimum distance of cyclic codes. IEEE Transactions on Information Theory, 32(1), 23–40. https://doi.org/10.1109/tit.1986.1057134
van Lint, JH, and R. Wilson. “On the minimum distance of cyclic codes.” IEEE Transactions on Information Theory, vol. 32, no. 1, 1986, pp. 23–40, https://doi.org/10.1109/tit.1986.1057134.
van Lint, JH, and R. Wilson. 1986. “On the minimum distance of cyclic codes.” IEEE Transactions on Information Theory 32 (1): 23–40. https://doi.org/10.1109/tit.1986.1057134.
van Lint, J. and Wilson, R. (1986) ‘On the minimum distance of cyclic codes’, IEEE Transactions on Information Theory, 32(1), pp. 23–40. Available at: https://doi.org/10.1109/tit.1986.1057134.
@article{vanlint1986minimum,
title = {{On the minimum distance of cyclic codes}},
author = {van Lint, JH and Wilson, R.},
journal = {IEEE Transactions on Information Theory},
volume = {32},
number = {1},
pages = {23--40},
year = {1986},
doi = {10.1109/tit.1986.1057134}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.