The following pages link to L. M. G. M. Tolhuizen (Q588411):
Displayed 50 items.
- (Q805669) (redirect page) (← links)
- Hecke operators and the weight distributions of certain codes (Q805670) (← links)
- Artin-Schreier curves and codes (Q805671) (← links)
- Generic erasure correcting sets: bounds and constructions (Q855874) (← links)
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) (Q1177865) (← links)
- Smoothness and factoring polynomials over finite fields (Q1178194) (← links)
- Legendre sums and codes related to QR codes (Q1183331) (← links)
- On even codes (Q1185087) (← links)
- Enumeration results for the codewords having no inner periods in Reed- Solomon codes (Q1191673) (← links)
- On spherical codes generating the kissing number in dimensions 8 and 24 (Q1199603) (← links)
- On the weight enumerator of product codes (Q1199642) (← links)
- On strong Dickson pseudoprimes (Q1201336) (← links)
- Optimal normal bases (Q1203948) (← links)
- On the dimension of Goppa codes (Q1205124) (← links)
- The number of MDS [7,3] codes on finite fields of characteristic 2 (Q1205126) (← links)
- On the existence of cyclic and pseudo-cyclic MDS codes (Q1268376) (← links)
- On codes with the identifiable parent property (Q1268617) (← links)
- Codes, bent functions and permutations suitable for DES-like cryptosystems (Q1273534) (← links)
- Two new decoding algorithms for Reed-Solomon codes (Q1311609) (← links)
- Weight class distributions of de Bruijn sequences (Q1318841) (← links)
- Equidistant arithmetic codes and character sums (Q1323876) (← links)
- Self-dual codes which are principal ideals of the group algebra \(\mathbb{F}_ 2[\{\mathbb{F}_{2^ m},+\}]\) (Q1361703) (← links)
- Almost affine codes (Q1389155) (← links)
- On the structure of linear and cyclic codes over a finite chain ring (Q1573766) (← links)
- (Q1591631) (redirect page) (← links)
- On perfect ternary constant weight codes (Q1591632) (← links)
- The theory of cyclic codes and a generalization to additive codes (Q1598872) (← links)
- On the roots of the substitution Dickson polynomials (Q1607858) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters (Q1802186) (← links)
- New codes via the lengthening of BCH codes with UEP codes (Q1808843) (← links)
- On groups of complex integers used as QAM signals (Q1818957) (← links)
- Check character systems over groups and orthogonal Latin squares (Q1912704) (← links)
- On the weight hierarchy of the semiprimitive codes (Q1917493) (← links)
- Self-orthogonal greedy codes (Q1924174) (← links)
- A note on greedy codes (Q1924245) (← links)
- On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums (Q1963151) (← links)
- Asymptotical properties of linear codes (Q1970696) (← links)
- Note on MDS codes over the integers modulo \(p^m\) (Q1977500) (← links)
- Group codes on certain algebraic curves with many rational points (Q2276928) (← links)
- Round5: compact and fast post-quantum public-key encryption (Q2302127) (← links)
- XOR-based visual cryptography schemes (Q2572985) (← links)
- Comment on "Error rate performance of the projection code" (Q2714767) (← links)
- The <i>MMO</i> problem (Q3452393) (← links)
- On the minimum distance of combinatorial codes (Q3489939) (← links)
- Quaternary Unequal Error Protection Codes (Q3540934) (← links)
- Common coordinates in consecutive addresses (Q3546635) (← links)
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size (Q3548292) (← links)
- New binary linear block codes (Corresp.) (Q3773827) (← links)
- A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code (Q3798598) (← links)