Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:56, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient representation of binary nonlinear codes: constructions and minimum distance computation |
scientific article |
Statements
Efficient representation of binary nonlinear codes: constructions and minimum distance computation (English)
0 references
25 June 2015
0 references
nonlinear code
0 references
kernel
0 references
minimum distance
0 references
minimum weight
0 references
decoding
0 references
algorithms
0 references
