On transitive uniform partitions of \(F^n\) into binary Hamming codes (Q2323137): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.33048/semi.2019.16.058 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.33048/SEMI.2019.16.058 / rank | |||
Normal rank | |||
Latest revision as of 00:20, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On transitive uniform partitions of \(F^n\) into binary Hamming codes |
scientific article |
Statements
On transitive uniform partitions of \(F^n\) into binary Hamming codes (English)
0 references
30 August 2019
0 references
Hamming code
0 references
partition
0 references
uniform partition into Hamming codes
0 references
transitive partition
0 references
2-transitive partition
0 references
Reed-Muller code
0 references
dual code
0 references
