Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966)
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: Bounds on the minimum code distance for nonbinary codes based on bipartite graphs |
scientific article; zbMATH DE number 6221897
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the minimum code distance for nonbinary codes based on bipartite graphs |
scientific article; zbMATH DE number 6221897 |
Statements
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (English)
0 references
1 November 2013
0 references
