Extending and LengtheningBCHCodes

Authors:
Jürgen Bierbrauer;Yves Edel
Affiliations:
Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan, 49931, f1jbierbra@mtu.eduf1;Mathematisches Institut der Universität, Im Neuenheimer Feld 288, 69120, Heidelberg, Germany
Venue:
Finite Fields and Their Applications
Year:
1997

Citing 7
Cited 3

New code parameters from Reed-Solomon subfield codes

IEEE Transactions on Information Theory
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes

IEEE Transactions on Information Theory
On subfield subcodes of modified Reed-Solomon codes (Corresp.)

IEEE Transactions on Information Theory
A method for extending binary linear codes (Corresp.)

IEEE Transactions on Information Theory
Studying the locator polynomials of minimum weight codewords of BCH codes

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

IEEE Transactions on Information Theory
New binary codes

IEEE Transactions on Information Theory

Dense Sphere Packings from New Codes

Journal of Algebraic Combinatorics: An International Journal
Algorithms for computing parameters of graph-based extensions of BCH codes

Journal of Discrete Algorithms
New Codes via the Lengthening of BCH Codes with UEP Codes

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a simplified and self-contained treatment of the theory ofBCHcodes. This allows us to make use of various recursive construction techniques and obtain a large number of linear codes with new parameters.