TwoTicks

Life is like a sparse reward problem in Reinforcement Learning (RL).

Don’t Follow Your Dreams, Follow Your Tools PhD Though the title says “Selecting PhD students”, the advice is more general and can be broadly applied to being a good researcher.

Boyd These are some timestamps from Boyd.

Choose one, leave one \[\binom{n}{k}= \binom{n-1}{k-1} + \binom{n-1}{k}\] This could be thought of as choosing one item and leaving one item while choosing \(k\) items from \(n\) items.

This is an ongoing project, consisting of my views on research shaped through help of others.

Links to VLabs Review of Block Codes Binary-input Memoryless Channels Maximum Likelihood Decoding of Linear Codes on Binary-Input Memoryless Channels Reed-Muller Codes - Polynomial View Encoding Majority Logic Decoding of Reed-Muller Codes

using AbstractAlgebra F = GF(2) A = rand([0, 1], 5, 5) B = matrix(F, A) # Convert to GF(2) matrix rref(B)

Introduction \(\mathrm {RM}(r, m)\) is a binary linear block code \((n, k, d)\) of length \(2^m\).

Encoding Reliability sequence function encode(message, N) K = length(message) # message length and N-K is frozen bits length n = log2(N); # number of stages QN = Q[Q.

Hammming Code - (7, 4) I will use the Galois Field library to implement the Hamming Code.