Error-correction capability of binary linear codes

Authors:
T. Helleseth;T. Klove;V. I. Levenshtein
Affiliations:
Dept. of Informatics, Univ. of Bergen, Norway;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 3

Correctable errors of weight half the minimum distance plus one for the first-order Reed-muller codes

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On correctable errors of binary linear codes

IEEE Transactions on Information Theory
Distribution of Boolean functions according to the second-order nonlinearity

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields

Quantified Score

Hi-index	754.90

Visualization

Abstract

The monotone structure of correctable and uncorrectable errors given by the complete decoding for a binary linear code is investigated. New bounds on the error-correction capability of linear codes beyond half the minimum distance are presented, both for the best codes and for arbitrary codes under some restrictions on their parameters. It is proved that some known codes of low rate are as good as the best codes in an asymptotic sense.