The following pages link to (Q3946078):
Displaying 50 items.
- Error thresholds in a mutation-selection model with Hopfield-type fitness (Q263723) (← links)
- Binary search with errors and variable cost queries (Q293463) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes (Q380446) (← links)
- Explicit factorization of \(x^n-1\in \mathbb {F}_q[x]\) (Q499673) (← links)
- Complete solving of explicit evaluation of Gauss sums in the index 2 case (Q625842) (← links)
- Inhomogeneous quantum codes. I: Additive case (Q625860) (← links)
- A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
- Codes based on complete graphs (Q677169) (← links)
- A note on matrix rigidity (Q684412) (← links)
- A general case of formal duality between binary nonlinear codes (Q686446) (← links)
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (Q686527) (← links)
- Greedy codes (Q690025) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- Chinese remainder codes (Q719954) (← links)
- Some results on the differential functions over finite fields (Q742510) (← links)
- On the asymptotic behaviour of Lee-codes (Q793695) (← links)
- Covering radius and dual distance (Q811480) (← links)
- A note on the decoding complexity of error-correcting codes (Q845843) (← links)
- Quadratic-residue codes and cyclotomic fields (Q850772) (← links)
- Jack van Lint (1932--2004): a survey of his scientific work (Q855858) (← links)
- Affine blocking sets, three-dimensional codes and the Griesmer bound (Q879336) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- Linear tree codes and the problem of explicit constructions (Q898793) (← links)
- On automorphisms of geometric Goppa codes (Q911547) (← links)
- Perfect codes with distinct protective radii (Q911556) (← links)
- Completely regular codes and completely transitive codes (Q911558) (← links)
- Switching reconstruction and diophantine equations (Q914705) (← links)
- Extremal doubly-even codes of length 64 derived from symmetric designs (Q918505) (← links)
- The minimum weight of the Grassmann codes C(k,n) (Q918511) (← links)
- On the exact evaluation of certain instances of the Potts partition function by quantum computers (Q926258) (← links)
- Two-weight cyclic codes constructed as the direct sum of two one-weight cyclic codes (Q938773) (← links)
- Tight embeddings of partial quadrilateral packings (Q965225) (← links)
- Periodic multisequences with large error linear complexity (Q1009057) (← links)
- Commutative association schemes (Q1039424) (← links)
- Information sets in quadratic-residue codes (Q1055389) (← links)
- A characterization of designs related to the Witt system S(5,8,24) (Q1057274) (← links)
- Construction techniques for some thin sets in duals of compact abelian groups (Q1071991) (← links)
- On character sums and codes (Q1075358) (← links)
- Cyclic projective planes and binary, extended cyclic self-dual codes (Q1083688) (← links)
- Lattices with theta functions for G(\(\sqrt{2})\) and linear codes (Q1086608) (← links)
- A note on the computation of the bit error rate for binary block codes (Q1101413) (← links)
- Quasi-symmetric designs and self-dual codes (Q1101455) (← links)
- Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture (Q1104328) (← links)
- A characterization of designs related to dodecads in the Witt system S(5,8,24) (Q1104926) (← links)
- Self-dual Goppa codes (Q1109011) (← links)
- Which extended Goppa codes are cyclic? (Q1118570) (← links)
- On self-dual, doubly even codes of length 32 (Q1120541) (← links)
- Fast correlation attacks on certain stream ciphers (Q1121241) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
