How to compute the minimum distance for cyclic AN-codes over an arbitrary base I. Elementary methods (Q3901440)
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: How to compute the minimum distance for cyclic AN-codes over an arbitrary base I. Elementary methods |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to compute the minimum distance for cyclic AN-codes over an arbitrary base I. Elementary methods |
scientific article |
Statements
How to compute the minimum distance for cyclic AN-codes over an arbitrary base I. Elementary methods (English)
0 references
1980
0 references