scientific article; zbMATH DE number 1009715
\textit{J. H. van Lint} and \textit{R. M. Wilson} [IEEE Trans. Inf. Theory IT-32, No. 1, 23-40 (1986; Zbl 0616.94012)] introduced the shift bound for cyclic codes and showed that it gives a good lower bound for the minimum distance. The shift bound improves the BCH and Hartmann-Tzeng bounds. A slightly different definition of the shift bound was given by \textit{M. van Eupen} and \textit{J. H. van Lint} in [IEEE Trans. Inf. Theory 39, No. 2, 409-422 (1993; Zbl 0777.94016)]. The author generalizes this definition to define the shift bound for an arbitrary linear code, and also obtains shift bounds for generalized (higher) weights. It is shown that the shift bound for Reed-Muller codes equals the true minimum distance. For certain algebraic-geometric codes, it is shown that the shift bound improves the bound of \textit{G.-L. Feng} and \textit{T. R. N. Rao} [IEEE Trans. Inf. Theory 40, No. 4, 1003-1012 (1994; Zbl 0814.94027)]. The author also shows how to use the method of majority coset decoding to correct any number of errors up to half the shift bound. For the entire collection see [Zbl 0859.00020].
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- A generalized floor bound for the minimum distance of geometric Goppa codes
- scientific article; zbMATH DE number 3974889
- Weighted Reed-Muller codes and algebraic-geometric codes
- Minimum distance bounds for cyclic codes and Deligne's theorem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336975)
