The following pages link to Ian F. Blake (Q677137):
Displaying 50 items.
- (Q340166) (redirect page) (← links)
- A note on diagonal and Hermitian hypersurfaces (Q340167) (← links)
- Lower bounds over codes correcting bursts with a given Lee weight or intensity (Q581362) (← links)
- (Q587022) (redirect page) (← links)
- (Q593579) (redirect page) (← links)
- Specific irreducible polynomials with linearly independent roots over finite fields (Q677139) (← links)
- Composed products and module polynomials over finite fields (Q686146) (← links)
- A transform property of Kloosterman sums (Q708340) (← links)
- VSH and multiplicative modular relations between small primes with polynomial exponents (Q742508) (← links)
- Sequence acquisition using bit estimation techniques (Q801872) (← links)
- Random matrices and codes for the erasure channel (Q848850) (← links)
- On primitive polynomials over finite fields (Q908964) (← links)
- On arithmetical algorithms over finite fields (Q910432) (← links)
- Factoring polynomials using fewer random bits (Q912919) (← links)
- Factorization of symmetric circulant matrices in finite fields (Q921087) (← links)
- Low complexity normal bases (Q923627) (← links)
- Construction of extended Steiner systems for information retrieval (Q928357) (← links)
- Graphs with integral spectrum (Q958042) (← links)
- A note on window \(\tau\)-NAF algorithm (Q1041820) (← links)
- On the cosets of the simplex code (Q1072523) (← links)
- Important algebraic calculations for \(n\)-variables polynomial codes (Q1073772) (← links)
- Automorphisms of principal nilpotent self-dual codes in certain modular algebras (Q1073774) (← links)
- An improvement of the Griesmer bound for some small minimum distances (Q1083427) (← links)
- A new approach to the covering radius of codes (Q1086543) (← links)
- Elliptic codes over fields of characteristic 2 (Q1088745) (← links)
- Doubly even extremal codes of length 64 (Q1092006) (← links)
- WOM-codes construits à partir des codes de Hamming (Q1092007) (← links)
- An improvement of Griesmer bound for some classes of distances (Q1095108) (← links)
- Characterization and synthesis of self-complementary normal bases in finite fields (Q1096676) (← links)
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre (Q1109009) (← links)
- Optimal normal bases in \(GF(p^ n)\) (Q1112879) (← links)
- On extendable planes, M.D.S. codes and hyperovals in PG(2,q), \(q=2^ t\) (Q1113875) (← links)
- Detector relative efficiency analysis in non-Gaussian noise (Q1119536) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- Algebraic-geometric codes and asymptotic problems (Q1180622) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- A combinatorial problem for vector spaces over finite fields (Q1185082) (← links)
- On a convolution of linear recurring sequences over finite fields (Q1188278) (← links)
- A note on cyclic groups, finite fields, and the discrete logarithm problem (Q1196516) (← links)
- A note on discrete logarithms in finite fields (Q1196517) (← links)
- Hermitian codes as generalized Reed-Solomon codes (Q1200300) (← links)
- On a complete decoding scheme for binary radical codes (Q1202442) (← links)
- Limited semaphore codes (Q1204129) (← links)
- The generating groups of geometrically uniform spherical signal sets (Q1205128) (← links)
- Uniformly synchronous limited codes (Q1206775) (← links)
- On the power polynomial \(x^ d\) over Galois rings (Q1209550) (← links)
- The computational efficacy of finite-field arithmetic (Q1210295) (← links)
- An infinite class of generalized Room squares (Q1221768) (← links)
- (Q1225622) (redirect page) (← links)