Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 1 / 11G / c / Solution

Apply part (b) repeatedly. After the first puncturing, the code has rank

k - 1

n - d

, and minimum distance at least

⌈ d /2 ⌉

. Repeating with a minimum-weight codeword at each stage gives

n \geq d + ⌈ \frac{d}{2} ⌉ + ⌈ \frac{d}{2 ^{2}} ⌉ + c d o t s + ⌈ \frac{d}{2 ^{k - 1}} ⌉,

because nested ceilings obey

⌈ \frac{⌈ d / 2 ^{j} ⌉}{2} ⌉ = ⌈ \frac{d}{2 ^{j + 1}} ⌉ .

Thus

n \geq d + 1 \leq l \leq k - 1 \sum ⌈ \frac{d}{2 ^{l}} ⌉,

which is the binary Griesmer bound.

 Ancestors (11)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version