 Home

Codex Wiki

List of universities

University of Cambridge

Course of the University of Cambridge

Mathematics course of the University of Cambridge

Past exam of the mathematics course of the University of Cambridge

2022

Paper 3

The code $\operatorname{RM}(d,0)$ is the binary repetition code of length $2^d$, while
$$
\operatorname{RM}(d,d)=\mathbb F_2^{\,2^d}
$$
is the full binary code. For $0<r<d$, the <Reed-Muller bar-product recursion> is
$$
\operatorname{RM}(d,r)
=\operatorname{RM}(d-1,r)
\mid\operatorname{RM}(d-1,r-1).
$$
Thus its rank $k(d,r)$ satisfies Pascal's recursion
$$
k(d,r)=k(d-1,r)+k(d-1,r-1),
$$
with the stated boundary values. Therefore
$$
\boxed{k(d,r)=\sum_{j=0}^r\binom dj}.
$$

Solution

Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 3 / 3K / b / i / Solution

Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 3 / 3K / b / i / Solution

 Ancestors (12)

 Discussion (0)

 Articles by others on the same topic (0)

Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 3 / 3K / b / i / Solution

 Ancestors (12)

 Discussion (0)  Subscribe (1)

 Articles by others on the same topic (0)

 Discussion (0)