Upper Bounds on the Dual Distance of BCH(255, k) |
| |
Authors: | Massimiliano Sala |
| |
Institution: | (1) Department of Mathematics, University of Pisa, Italy |
| |
Abstract: | To obtain upper bounds on the distance of a binary linear code, many probabilistic algorithms have been proposed. The author presents a general variation to these algorithms, specific for cyclic codes, which is shown to be an improvement. As an example, the author optimizes Brouwer's algorithm to find the best upper bounds on the dual distance of BCH255,k,d]. |
| |
Keywords: | BCH codes upper bound shortened code dual distance |
本文献已被 SpringerLink 等数据库收录! |
|