Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3 (Q4929280)
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: Optimal tight equi-difference conflict-avoiding codes of length n = 2ᵏ 1 and weight 3 |
scientific article; zbMATH DE number 6175539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3 |
scientific article; zbMATH DE number 6175539 |
Statements
Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length <i>n</i> = 2<sup><i>k</i></sup> ± 1 and Weight 3 (English)
0 references
13 June 2013
0 references
conflict-avoiding codes
0 references
equi-difference
0 references
optimal codes
0 references
0 references
0 references
0.9454805850982666
0 references
0.9121410250663756
0 references
0.9111159443855286
0 references
0.9070279002189636
0 references
0.9032667875289916
0 references
