New lower bounds for binary constant-dimension subspace codes (Q4643732)
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 6875516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New lower bounds for binary constant-dimension subspace codes |
scientific article; zbMATH DE number 6875516 |
Statements
New Lower Bounds for Binary Constant-Dimension Subspace Codes (English)
0 references
28 May 2018
0 references
constant-dimension codes
0 references
integer linear programming
0 references
packing
0 references
random network coding
0 references
maximum weight clique problem
0 references
0 references
0 references
0.8420472741127014
0 references
0.8225354552268982
0 references
0.8147777318954468
0 references
0.8115040063858032
0 references
