| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5090209 | 2022-07-18 | Paper |
| On t-error correcting/all unidirectional error detecting codes | 2018-09-14 | Paper |
| A broadcast key distribution scheme based on block designs | 2018-03-21 | Paper |
| Authentication codes: An area where coding and cryptology meet | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2889493 | 2012-06-07 | Paper |
| Bounds and constructions for key distribution schemes | 2010-03-10 | Paper |
| New constructions of anonymous membership broadcasting schemes | 2007-04-05 | Paper |
| Jack van Lint (1932--2004): a survey of his scientific work | 2006-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665030 | 2005-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428379 | 2003-09-15 | Paper |
| A practical protocol for advantage distillation and information reconciliation | 2003-09-07 | Paper |
| On the security of digital signature schemes based on error-correcting codes | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2781764 | 2002-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242029 | 2002-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242021 | 2001-09-04 | Paper |
| Two ``dual families of nearly-linear codes over \(\mathbb Z_p, p\) odd | 2001-07-22 | Paper |
| Some new binary, quasi-cyclic codes | 1999-11-21 | Paper |
| On the complexity of minimum distance decoding of long linear codes | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838745 | 1999-03-04 | Paper |
| Cryptanalysis of `less short' RSA secret exponents | 1998-03-10 | Paper |
| Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes | 1997-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4893204 | 1997-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892494 | 1997-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4857258 | 1996-04-22 | Paper |
| The Leech lattice, the octacode, and decoding algorithms | 1996-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865482 | 1996-02-14 | Paper |
| The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions | 1995-03-01 | Paper |
| Approaching capacity by equiprobable signaling on the Gaussian channel | 1994-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4040312 | 1993-06-05 | Paper |
| On maximum likelihood soft-decision decoding of binary linear codes | 1993-05-16 | Paper |
| Error-correcting codes with bounded running digital sum | 1993-05-16 | Paper |
| Fire codes revisited | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3992098 | 1992-06-28 | Paper |
| Constructions and bounds for systematic tEC/AUED codes | 1990-01-01 | Paper |
| Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/ | 1990-01-01 | Paper |
| Multiple burst-correcting array codes | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835418 | 1989-01-01 | Paper |
| On error-correcting balanced codes | 1989-01-01 | Paper |
| Two-dimensional burst identification codes and their use in burst correction | 1988-01-01 | Paper |
| An upper bound for codes for the noisy two-access binary adder channel (Corresp.) | 1986-01-01 | Paper |
| A class of burst error-correcting array codes (Corresp.) | 1986-01-01 | Paper |
| On the existence of optimum cyclic burst- correcting codes | 1986-01-01 | Paper |
| A family of good uniquely decodable code pairs for the two-access binary adder channel | 1985-01-01 | Paper |
| On the covering radius of binary, linear codes meeting the Griesmer bound | 1985-01-01 | Paper |
| Upper bounds on<tex>|C_2|</tex>for a uniquely decodable code pair<tex>(C_1, C_2)</tex>for a two-access binary adder channel | 1983-01-01 | Paper |
| The smallest length of binary 7-dimensional linear codes with prescribed minimum distance | 1981-01-01 | Paper |
| A new class of codes meeting the Griesmer bound | 1981-01-01 | Paper |
| On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3893811 | 1980-01-01 | Paper |
| Symbol synchronization in convolutionally coded systems (Corresp.) | 1979-01-01 | Paper |
| On the existence of a cyclic code with rate R | 1978-01-01 | Paper |
| An upper bound for codes in a two-access binary erasure channel (Corresp.) | 1978-01-01 | Paper |
| On the inherent intractability of certain coding problems (Corresp.) | 1978-01-01 | Paper |
| On quasi-cyclic codes with rate l m (Corresp.) | 1978-01-01 | Paper |
| A lower bound for v in a \(t-(v,k,\lambda)\) design | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4113845 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141269 | 1976-01-01 | Paper |
