Idempotents and the BCH bound
Abstract
Using a characterization of the idempotents of a narrow- sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Our results are compiled in a table.
Origin : Publisher files allowed on an open archive
Loading...