A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube (Q672019): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximating the minimum maximal independence number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A survey of the theory of hypercube graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4001770 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3996427 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES / rank | |||
Normal rank | |||
Revision as of 10:14, 27 May 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
