Bounds on the minimum distance of the duals of BCH codes

DOI10.1109/18.508853zbMATH Open0866.94021OpenAlexW2158924721MaRDI QIDQ4885730FDOQ4885730

Authors: Daniel Augot, Françoise Levy-dit-Vehel 

Publication date: 25 September 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.508853

Recommendations

• On the duals of binary BCH codes
• Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
• scientific article; zbMATH DE number 493081
• Upper bounds on the dual distance of BCH\((255, k)\)

zbMATH Keywords

BCH codesdualsWeil boundHartmann-Tzeng boundrank-bound algorithm

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited In (15)

• On the spectra of the duals of binary BCH codes of designed distance delta =9
• Negacyclic BCH codes of length \(\frac{q^{2m}-1}{q+1}\) and their duals
• On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
• Upper bounds on the dual distance of BCH\((255, k)\)
• On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)
• On the duals of binary BCH codes
• Title not available (Why is that?)
• On the distance distribution of duals of BCH codes
• Title not available (Why is that?)
• An improved upper bound on the minimum distance of doubly-even self-dual codes
• On the minimum distance of the duals of 4-error correcting extended BCH codes
• On two problems of asymmetric quantum codes
• Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
• Title not available (Why is that?)
• Codes with girth 8 Tanner graph representation

This page was built for publication: Bounds on the minimum distance of the duals of BCH codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885730)