Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 94B60 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 94B65 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6221897 / rank | |||
Normal rank | |||
Revision as of 10:34, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the minimum code distance for nonbinary codes based on bipartite graphs |
scientific article |
Statements
Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (English)
0 references
1 November 2013
0 references
