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 the normal view instead:
scientific article; zbMATH DE number 6221897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8165440559387207
0 references
0.8153069615364075
0 references
0.8040580153465271
0 references
0.7872126698493958
0 references
0.7831193804740906
0 references
