Upper bounds on the dual distance of BCH\((255, k)\) (Q1412246)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper bounds on the dual distance of BCH\((255, k)\) |
scientific article; zbMATH DE number 2001971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the dual distance of BCH\((255, k)\) |
scientific article; zbMATH DE number 2001971 |
Statements
Upper bounds on the dual distance of BCH\((255, k)\) (English)
0 references
10 November 2003
0 references
The problem of upper bounds for cyclic codes are presented. Especially the upper bounds of the dual distance code of a BCH code, which is a cyclic code whose distance has been intensively studied, are investigated. The author also presents a general variation for some probabilistic algorithms, specific for cyclic codes, which are shown to be an improvement.
0 references
