The following pages link to Herman J. Tiersma (Q592369):
Displaying 50 items.
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem (Q452827) (← links)
- Structural properties and enumeration of 1-generator generalized quasi-cyclic codes (Q540476) (← links)
- Geometric permutations (Q545497) (← links)
- A family of error-correcting codes (Q579221) (← links)
- (Q585734) (redirect page) (← links)
- Generalized Stirling permutations, families of increasing trees and urn models (Q616442) (← links)
- A selection of divisible lexicographic codes (Q622801) (← links)
- Double circulant codes over \(\mathbb{Z}_ 4\) and even unimodular lattices (Q679085) (← links)
- A note on negacyclic self-dual codes over \(\mathbb Z_{2^{a}}\) (Q713144) (← links)
- The weight distributions of a class of cyclic codes (Q714458) (← links)
- Coding for channels with localized errors: The non-binary cases (Q752664) (← links)
- Some remarks on strong Fibonacci pseudoprimes (Q802641) (← links)
- An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field (Q802667) (← links)
- A short proof for explicit formulas for discrete logarithms in finite fields (Q802668) (← links)
- Additive functions and their application to uncertain information (Q805641) (← links)
- On the asymptotic number of inequivalent binary self-dual codes (Q878956) (← links)
- Distribution of the weights of the dual of the Melas code (Q912829) (← links)
- A kind of good elliptic curve used to set up cryptosystem (Q913772) (← links)
- Spinor groups and algebraic coding theory (Q916798) (← links)
- An intersection problem for codes (Q922561) (← links)
- A bijective proof of Jackson's formula for the number of factorizations of a cycle (Q941309) (← links)
- Counting descent pairs with prescribed tops and bottoms (Q942164) (← links)
- On the matricial version of Fermat-Euler congruences (Q1000312) (← links)
- On some number-theoretic conjectures of V. Arnold (Q1000342) (← links)
- Staircase rook polynomials and Cayley's game of mousetrap (Q1003606) (← links)
- Classifying lattice walks restricted to the quarter plane (Q1003654) (← links)
- The unbalance of set systems (Q1014818) (← links)
- Extended Euler congruence (Q1035297) (← links)
- Reconstructing the ternary Golay code (Q1085137) (← links)
- Analysis and design of stream ciphers (Q1089307) (← links)
- Note sur la notion d'équivalence entre deux codes linéaires (Q1095866) (← links)
- Linear codes associated with geometric structures (Q1101064) (← links)
- A note on Gray code and odd-even merge (Q1102754) (← links)
- Dual fail-safe separating systems (Q1103588) (← links)
- Some bounds for the distribution numbers of an association scheme (Q1103621) (← links)
- Some distribution numbers of the hypercubic association scheme (Q1103622) (← links)
- Some distribution numbers of the triangular association scheme (Q1103623) (← links)
- The use and usefulness of numeration systems (Q1119959) (← links)
- On nonlinear feedback shift registers with short periods (Q1121244) (← links)
- An aperiodic set of 13 Wang tiles (Q1126300) (← links)
- Artin-Schreier curves, exponential sums, and the Carlitz-Uchiyama bound for geometric codes (Q1176398) (← links)
- Covering \(t\)-element sets by partitions (Q1180794) (← links)
- Polynomial description of binary linear codes and related properties (Q1181004) (← links)
- Generalized flags in finite abelian \(p\)-groups (Q1182310) (← links)
- Brick tabloids and the connection matrices between bases of symmetric functions (Q1182312) (← links)
- Generalized Cayley graphs (Q1193449) (← links)
- Generalized Davenport-Schinzel sequences with linear upper bound (Q1201254) (← links)
- Trace- and norm-compatible extensions of finite fields (Q1205131) (← links)
- Kanonische Codes auf einigen Überdeckungskurven (Q1210041) (← links)
- Optimal and suboptimal quadriphase sequences derived from maximal length sequences over \(\mathbb{Z}_4\) (Q1264314) (← links)
