On transitive uniform partitions of \(F^n\) into binary Hamming codes (Q2323137): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Perfect Codes and Tilings: Problems and Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3544770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of \(\mathbb F^n\) into non-parallel Hamming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Partition of the Hypercube into Maximally Nonparallel Hamming Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Parity Function and Its Use in the Construction of Perfect Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hypercube coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On transitive partitions of an \(n\)-cube into codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115222 / rank
 
Normal rank

Revision as of 07:44, 20 July 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
    0 references

    Identifiers