Hamming distances from a function to all codewords of a generalized Reed-Muller code of order one (Q1683976): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fast decoding of non-binary first order Reed-Muller codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3411976 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The weights of the orthogonals of the extended quadratic binary Goppa codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4038759 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Covering Radius of First-Order Generalized Reed–Muller Codes / rank | |||
Normal rank | |||
Latest revision as of 19:22, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamming distances from a function to all codewords of a generalized Reed-Muller code of order one |
scientific article |
Statements
Hamming distances from a function to all codewords of a generalized Reed-Muller code of order one (English)
0 references
4 December 2017
0 references
Reed-Muller code
0 references
Hamming distance
0 references
arrangement of hyperplanes
0 references
