Skip to main navigation Skip to search Skip to main content

On the minimum weight codewords of some binary BCH codes

  • INRIA Institut National de Recherche en Informatique et en Automatique

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We give the true minimum distances of some BCH codes of length 255 and 511, which were not known. We describe the set of the minimum weight codewords of the BCH codes with designed distance 2m-2 - 1.

Original languageEnglish
Title of host publicationProceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages7
Number of pages1
ISBN (Electronic)0780300564
DOIs
Publication statusPublished - 1 Jan 1991
Event1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary
Duration: 24 Jun 199128 Jun 1991

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/TerritoryHungary
CityBudapest
Period24/06/9128/06/91

Fingerprint

Dive into the research topics of 'On the minimum weight codewords of some binary BCH codes'. Together they form a unique fingerprint.

Cite this