Upper Bounds on the Dual Distance of BCH(255, k)

Authors:
Massimiliano Sala
Affiliations:
Department of Mathematics, University of Pisa, Italy sala@dm.unipi.it
Venue:
Designs, Codes and Cryptography
Year:
2003

Citing 9
Cited 0

An approximation to the weight distribution of binary linear codes

IEEE Transactions on Information Theory
An updated table of minimum-distance bounds for binary linear codes

IEEE Transactions on Information Theory
On Upper Bounds for Minimum Distance and Covering Radiusof Non-binary Codes

Designs, Codes and Cryptography
A method for finding codewords of small weight

Proceedings of the 3rd International Colloquium on Coding Theory and Applications
Bounds on the minimum distance of the duals of BCH codes

IEEE Transactions on Information Theory
The weight distributions of extended binary primitive BCH codes of length 128

IEEE Transactions on Information Theory
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

IEEE Transactions on Information Theory
On the distance distribution of duals of BCH codes

IEEE Transactions on Information Theory
A linear programming estimate of the weight distribution of BCH (255,k)

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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 BCH[255,k,d].