Henk D. L. Hollmann

Martin Puskin

Ago-Erik Riet

CoRR, 2024

A Binary Linear Functional-Repair Regenerating Code on 72 Coding Spaces Related to PG(2, 8).

[BibT_eX]

[DOI]

Junming Ke

Ago-Erik Riet

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

On some batch code properties of the simplex code.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., May, 2023

Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes I.

[BibT_eX]

[DOI]

Finite Fields Their Appl., February, 2023

2022

Optimal Possibly Nonlinear 3-PIR Codes of Small Size.

[BibT_eX]

[DOI]

Urmas Luhaäär

Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Some basic results on finite linear recurring sequence subgroups.

[BibT_eX]

[DOI]

Medet Zhanbulatuly

Finite Fields Their Appl., 2021

2019

The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle.

[BibT_eX]

[DOI]

Tao Feng

IEEE Trans. Inf. Theory, 2019

2018

A Multi-layer Recursive Residue Number System.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

2014

On the minimum storage overhead of distributed storage codes with a given repair locality.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Locally repairable codes with multiple repair alternatives.

[BibT_eX]

[DOI]

Lluis Pamies-Juarez

Frédérique E. Oggier

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

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

[BibT_eX]

[DOI]

Wencin Poh

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Storage codes - Coding rate and repair locality.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computing, Networking and Communications, 2013

2009

Proofs of two conjectures on ternary weakly regular bent functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

2008

Cryptanalysis of White-Box Implementations.

[BibT_eX]

[DOI]

Wil Michiels

Paul Gorissen

IACR Cryptol. ePrint Arch., 2008

New Kloosterman sum identities and equalities over finite fields.

[BibT_eX]

[DOI]

Xiwang Cao

Finite Fields Their Appl., 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

Cryptanalysis of a Generic Class of White-Box Implementations.

[BibT_eX]

[DOI]

Wil Michiels

Paul Gorissen

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

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

[BibT_eX]

[DOI]

CoRR, 2007

2006

Pseudocyclic association schemes arising from the actions of PGL(2, 2m) and PGammaL(2, 2m).

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Generic erasure correcting sets: Bounds and constructions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Jack van Lint (1932-2004): A survey of his scientific work.

[BibT_eX]

[DOI]

Henk C. A. van Tilborg

J. Comb. Theory A, 2006

Generating parity check equations for bounded-distance iterative erasure decoding.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

A class of permutation polynomials of F2m related to Dickson polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2005

Optimal Interconnect ATPG Under a Ground-Bounce Constraint.

[BibT_eX]

[DOI]

Erik Jan Marinissen

Bart Vermeulen

J. Electron. Test., 2005

XOR-based Visual Cryptography Schemes.

[BibT_eX]

[DOI]

Pim Tuyls

Jack H. van Lint

Des. Codes Cryptogr., 2005

2004

Kloosterman sum identities over F2m.

[BibT_eX]

[DOI]

Discret. Math., 2004

On the entropy rate of a hidden Markov model.

[BibT_eX]

[DOI]

Sebastian Egner

Vladimir B. Balakirsky

Ludo Tolhuizen

Stan Baggen

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Common coordinates in consecutive addresses.

[BibT_eX]

[DOI]

Ning Cai

IEEE Trans. Inf. Theory, 2003

Minimizing Pattern Count for Interconnect Test under a Ground Bounce Constraint.

[BibT_eX]

[DOI]

IEEE Des. Test Comput., 2003

2002

A polarisation based Visual Crypto System and its Secret Sharing Schemes.

[BibT_eX]

[DOI]

Pim Tuyls

IACR Cryptol. ePrint Arch., 2002

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes.

[BibT_eX]

[DOI]

Pim Tuyls

IACR Cryptol. ePrint Arch., 2002

Proof of a Conjecture of De Caen and Van Dam.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

2001

Maximal Arcs in Projective Three-Spaces and Double-Error-Correcting Cyclic Codes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

A Four-Class Association Scheme.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2001

1999

Gauss Sums, Jacobi Sums, and p-Ranks of Cyclic Difference Sets.

[BibT_eX]

[DOI]

Ronald Evans

Christian Krattenthaler

J. Comb. Theory A, 1999

Static component interconnect test technology (SCITT) a new technology for assembly testing.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE International Test Conference 1999, 1999

1998

On Codes with the Identifiable Parent Property.

[BibT_eX]

[DOI]

Jack H. van Lint

Jean-Paul M. G. Linnartz

J. Comb. Theory A, 1998

1997

On an approximate eigenvector associated with a modulation code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Antiwhistle codes.

[BibT_eX]

[DOI]

Jan W. M. Bergmans

Johannes O. Voorman

IEEE Trans. Commun., 1997

Tiling Hamming Space with Few Spheres.

[BibT_eX]

[DOI]

János Körner

Simon Litsyn

J. Comb. Theory A, 1997

Protection of software algorithms executed on secure modules.

[BibT_eX]

[DOI]

Jean-Paul M. G. Linnartz

Constant P. M. J. Baggen

Future Gener. Comput. Syst., 1997

Universal Sequences.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1997

1996

Bounded-delay-encodable, block-decodable codes for constrained systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Protection of Software Algorithms Executed on Secure Microprocessors.

[BibT_eX]

Jean-Paul M. G. Linnartz

C. P. M. J. Baggen

Proceedings of the Second Smart Card Research and Advanced Application Conference, 1996

1995

On the realizability of biorthogonal, m-dimensional two-band filter banks.

[BibT_eX]

[DOI]

Antonius A. C. M. Kalker

IEEE Trans. Signal Process., 1995

Constructions and properties of block codes for partial-response channels.

[BibT_eX]

[DOI]

Kees A. Schouhamer Immink

IEEE Trans. Inf. Theory, 1995

On the construction of bounded-delay encodable codes for constrained systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1994

A block-decodable (1, 8) runlength-limited rate 8/12 code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

1993

A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes.

[BibT_eX]

[DOI]

Kees A. Schouhamer Immink

IEEE Trans. Inf. Theory, 1993

1992

Prefix-Synchronized Run-Length-Limited Sequences.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1992

Nonblocking Self-Routing Switching Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Schouhamer Immink. Performance of efficient balanced codes.

[BibT_eX]

[DOI]

Kees A. Schouhamer Immink

IEEE Trans. Inf. Theory, 1991

The general solution of write equalization for RLL (d, k) codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Elements of Maximum Order in a Matrix Group (Lih-Yuan Deng).

[BibT_eX]

[DOI]

SIAM Rev., 1991

1990

Design of test sequences for VLSI self-testing using LFSR.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

1985

Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data.

[BibT_eX]

[DOI]

Pierre Duhamel

Proceedings of the IEEE International Conference on Acoustics, 1985

1984

Pseudocyclic 3-class association schemes on 28 points.

[BibT_eX]

[DOI]