A deterministic algorithm for the distance and weight distribution of binary nonlinear codes (Q1993387)
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: A deterministic algorithm for the distance and weight distribution of binary nonlinear codes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic algorithm for the distance and weight distribution of binary nonlinear codes |
scientific article |
Statements
A deterministic algorithm for the distance and weight distribution of binary nonlinear codes (English)
0 references
5 November 2018
0 references
Summary: Given a binary nonlinear code, we provide a deterministic algorithm to compute its weight and distance distribution, and in particular, its minimum weight and its minimum distance, which takes advantage of fast Fourier techniques. This algorithm's performance is similar to that of best-known algorithms for the average case, while it is especially efficient for codes with low information rate. We provide complexity estimates for several cases of interest.
0 references
distance distribution
0 references
minimum distance
0 references
weight distribution
0 references
minimum weight
0 references
nonlinear code
0 references
0.8234875202178955
0 references
0.8119360208511353
0 references
0.7616682052612305
0 references
0.756147027015686
0 references
