The following pages link to Tim Blackmore (Q231499):
Displayed 8 items.
- On trellis structures for Reed-Muller codes (Q1971064) (← links)
- Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound (Q2784499) (← links)
- (Q4217882) (← links)
- (Q4500975) (← links)
- On a family of Abelian codes and their state complexities (Q4544478) (← links)
- Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1 (Q4701314) (← links)
- Matrix-product codes over \(\mathbb{F}_q\) (Q5956428) (← links)
- Lower bounds on the state complexity of geometric Goppa codes (Q5959836) (← links)