The following pages link to Henk D. L. Hollmann (Q171747):
Displaying 48 items.
- Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields (Q468704) (← links)
- (Q802566) (redirect page) (← links)
- Pseudocyclic 3-class association schemes on 28 points (Q802567) (← links)
- Jack van Lint (1932--2004): a survey of his scientific work (Q855858) (← links)
- Generic erasure correcting sets: bounds and constructions (Q855874) (← links)
- New Kloosterman sum identities and equalities over finite fields (Q938778) (← links)
- (Q1199435) (redirect page) (← links)
- Nonblocking self-routing switching networks (Q1199436) (← links)
- On codes with the identifiable parent property (Q1268617) (← links)
- Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets (Q1296754) (← links)
- Proof of a conjecture of de Caen and van Dam (Q1348746) (← links)
- Universal sequences (Q1360981) (← links)
- Tiling Hamming space with few spheres (Q1374207) (← links)
- Kloosterman sum identities over \(\mathbb F_{2^{m}}\). (Q1428529) (← links)
- On codes with covering radius 1 and minimum distance 2 (Q1866450) (← links)
- Some basic results on finite linear recurring sequence subgroups (Q2031643) (← links)
- Pseudocyclic association schemes arising from the actions of PGL\((2,2^{m})\) and P\(\Gamma\)L\((2,2^{m}\)) (Q2500614) (← links)
- Association schemes from the action of \(\text{PGL}(2,q)\) fixing a nonsingular conic in \(\text{PG}(2,q)\) (Q2504999) (← links)
- A class of permutation polynomials of \(\mathbb F_{2^m}\) related to Dickson polynomials (Q2567157) (← links)
- XOR-based visual cryptography schemes (Q2572985) (← links)
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I (Q2677315) (← links)
- On some batch code properties of the simplex code (Q2701478) (← links)
- (Q2712116) (← links)
- A New Repair Strategy for the Hadamard Minimum Storage Regenerating Codes for Distributed Storage Systems (Q2977207) (← links)
- (Q3027027) (← links)
- Bounded-delay-encodable, block-decodable codes for constrained systems (Q3129480) (← links)
- The general solution of write equalization for RLL (d,k) codes (Q3356228) (← links)
- Design of test sequences for VLSI self-testing using LFSR (Q3484763) (← 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)
- Cryptanalysis of a Generic Class of White-Box Implementations (Q3644218) (← links)
- (Q3731664) (← links)
- Factorisation of $x^N - q$ over Q (Q3731713) (← links)
- A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes (Q4307351) (← links)
- A block-decodable (1,8) runlength-limited rate 8/12 code (Q4324206) (← links)
- On an approximate eigenvector associated with a modulation code (Q4371921) (← links)
- (Q4372461) (← links)
- (Q4474270) (← links)
- (Q4793308) (← links)
- On the construction of bounded-delay encodable codes for constrained systems (Q4859760) (← links)
- Constructions and properties of block codes for partial-response channels (Q4880328) (← links)
- Proofs of Two Conjectures on Ternary Weakly Regular Bent Functions (Q4974077) (← links)
- The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle (Q5224103) (← links)
- Entropy of a bit-shift channel (Q5307919) (← links)
- Critical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields: an extended abstract (Q5419949) (← links)
- Maximal arcs in projective three-spaces and double-error-correcting cyclic codes (Q5929840) (← links)
- A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences (Q5941619) (← links)
- A four-class association scheme (Q5952338) (← links)
