Henk D. L. Hollmann

According to our database1, Henk D. L. Hollmann authored at least 58 papers between 1984 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
A Multi-layer Recursive Residue Number System.
CoRR, 2018

A Multi-layer Recursive Residue Number System.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2015
A New Repair Strategy for the Hadamard Minimum Storage Regenerating Codes for Distributed Storage Systems.
IEEE Trans. Information Theory, 2015

2014
On the minimum storage overhead of distributed storage codes with a given repair locality.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Locally Repairable Codes with Multiple Repair Alternatives
CoRR, 2013

Storage codes -- coding rate and repair locality
CoRR, 2013

Characterizations and construction methods for linear functional-repair storage codes.
CoRR, 2013

Locally repairable codes with multiple repair alternatives.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Characterizations and construction methods for linear functional-repair storage codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Storage codes - Coding rate and repair locality.
Proceedings of the International Conference on Computing, Networking and Communications, 2013

2009
Proofs of two conjectures on ternary weakly regular bent functions.
IEEE Trans. Information Theory, 2009

2008
Cryptanalysis of White-Box Implementations.
IACR Cryptology ePrint Archive, 2008

New Kloosterman sum identities and equalities over finite fields.
Finite Fields and Their Applications, 2008

Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes
CoRR, 2008

Cryptanalysis of a Generic Class of White-Box Implementations.
Proceedings of the Selected Areas in Cryptography, 15th International Workshop, SAC 2008, 2008

Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size.
IEEE Trans. Information Theory, 2007

Optimal codes for correcting a single (wrap-around) burst of errors
CoRR, 2007

2006
Pseudocyclic association schemes arising from the actions of PGL(2, 2m) and PGammaL(2, 2m).
J. Comb. Theory, Ser. A, 2006

Generic erasure correcting sets: Bounds and constructions.
J. Comb. Theory, Ser. A, 2006

Jack van Lint (1932-2004): A survey of his scientific work.
J. Comb. Theory, Ser. A, 2006

Generating parity check equations for bounded-distance iterative erasure decoding
CoRR, 2006

2005
A class of permutation polynomials of F2m related to Dickson polynomials.
Finite Fields and Their Applications, 2005

Optimal Interconnect ATPG Under a Ground-Bounce Constraint.
J. Electronic Testing, 2005

XOR-based Visual Cryptography Schemes.
Des. Codes Cryptography, 2005

On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size
CoRR, 2005

2004
Kloosterman sum identities over F2m.
Discrete Mathematics, 2004

2003
Common coordinates in consecutive addresses.
IEEE Trans. Information Theory, 2003

Minimizing Pattern Count for Interconnect Test under a Ground Bounce Constraint.
IEEE Design & Test of Computers, 2003

Optimal Interconnect ATPG Under a Ground-Bounce Constraint.
Proceedings of the Proceedings 2003 International Test Conference (ITC 2003), Breaking Test Interface Bottlenecks, 28 September, 2003

2002
A polarisation based Visual Crypto System and its Secret Sharing Schemes.
IACR Cryptology ePrint Archive, 2002

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes.
IACR Cryptology ePrint Archive, 2002

Proof of a Conjecture of De Caen and Van Dam.
Eur. J. Comb., 2002

2001
Maximal Arcs in Projective Three-Spaces and Double-Error-Correcting Cyclic Codes.
J. Comb. Theory, Ser. A, 2001

A Four-Class Association Scheme.
J. Comb. Theory, Ser. A, 2001

A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding.
Proceedings of the Applied Algebra, 2001

1999
Gauss Sums, Jacobi Sums, and p-Ranks of Cyclic Difference Sets.
J. Comb. Theory, Ser. A, 1999

Static component interconnect test technology (SCITT) a new technology for assembly testing.
Proceedings of the Proceedings IEEE International Test Conference 1999, 1999

1998
On Codes with the Identifiable Parent Property.
J. Comb. Theory, Ser. A, 1998

1997
On an approximate eigenvector associated with a modulation code.
IEEE Trans. Information Theory, 1997

Antiwhistle codes.
IEEE Trans. Communications, 1997

Tiling Hamming Space with Few Spheres.
J. Comb. Theory, Ser. A, 1997

Protection of software algorithms executed on secure modules.
Future Generation Comp. Syst., 1997

Universal Sequences.
Appl. Algebra Eng. Commun. Comput., 1997

1996
Bounded-delay-encodable, block-decodable codes for constrained systems.
IEEE Trans. Information Theory, 1996

Protection of Software Algorithms Executed on Secure Microprocessors.
Proceedings of the Second Smart Card Research and Advanced Application Conference, 1996

1995
On the realizability of biorthogonal, m-dimensional two-band filter banks.
IEEE Trans. Signal Processing, 1995

Constructions and properties of block codes for partial-response channels.
IEEE Trans. Information Theory, 1995

On the construction of bounded-delay encodable codes for constrained systems.
IEEE Trans. Information Theory, 1995

1994
A block-decodable (1, 8) runlength-limited rate 8/12 code.
IEEE Trans. Information Theory, 1994

1993
A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes.
IEEE Trans. Information Theory, 1993

1992
Prefix-Synchronized Run-Length-Limited Sequences.
IEEE Journal on Selected Areas in Communications, 1992

Nonblocking Self-Routing Switching Networks.
Discrete Applied Mathematics, 1992

1991
Schouhamer Immink. Performance of efficient balanced codes.
IEEE Trans. Information Theory, 1991

The general solution of write equalization for RLL (d, k) codes.
IEEE Trans. Information Theory, 1991

Elements of Maximum Order in a Matrix Group (Lih-Yuan Deng).
SIAM Review, 1991

1990
Design of test sequences for VLSI self-testing using LFSR.
IEEE Trans. Information Theory, 1990

1984
Pseudocyclic 3-class association schemes on 28 points.
Discrete Mathematics, 1984


  Loading...