A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube (Q672019): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:21, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube |
scientific article |
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
