TY - GEN
T1 - Bounds on the minimum distance of the duals of BCH codes
AU - Augot, Daniel
AU - Levy-Dit-Vehel, Françoise
PY - 1994/1/1
Y1 - 1994/1/1
N2 - We consider duals of BCH codes of length pm-1 over GF(p). A lower bound on their minimum distance is found via the adaptation of the Weil bound to cyclic codes. However, this bound is of no significance for roughly half of these codes. We partially fill this gap by giving a lower bound for an infinite class of duals of BCH codes. We also present a lower bound obtained with an algorithm due to Massey and Schaub (1988). In the case of binary codes of length 127 and 255, the results are surprisingly higher than all previously known bounds.
AB - We consider duals of BCH codes of length pm-1 over GF(p). A lower bound on their minimum distance is found via the adaptation of the Weil bound to cyclic codes. However, this bound is of no significance for roughly half of these codes. We partially fill this gap by giving a lower bound for an infinite class of duals of BCH codes. We also present a lower bound obtained with an algorithm due to Massey and Schaub (1988). In the case of binary codes of length 127 and 255, the results are surprisingly higher than all previously known bounds.
U2 - 10.1109/ISIT.1994.394928
DO - 10.1109/ISIT.1994.394928
M3 - Conference contribution
AN - SCOPUS:84894299752
SN - 0780320158
SN - 9780780320154
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 43
BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Y2 - 27 June 1994 through 1 July 1994
ER -