A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube (Q672019)
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: Publication:672019 |
scientific article; zbMATH DE number 984727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube |
scientific article; zbMATH DE number 984727 |
Statements
A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube (English)
0 references
27 February 1997
0 references
combinatorial problems
0 references
distance-three codes
0 references
\(n\)-cube
0 references
Latin squares
0 references
independent domination number
0 references
0.7718126773834229
0 references
0.7630044221878052
0 references
0.7524797916412354
0 references
0.748378336429596
0 references
0.7462361454963684
0 references
