| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7558356 (Why is no real title available?)
| 2022-07-18 | Paper |
On t-error correcting/all unidirectional error detecting codes
IEEE Transactions on Computers | 2018-09-14 | Paper |
A broadcast key distribution scheme based on block designs
Cryptography and Coding | 2018-03-21 | Paper |
Authentication codes: an area where coding and cryptology meet
Cryptography and Coding | 2018-03-21 | Paper |
Elliptic curve cryptosystems: too good to be true?
Nieuw Archief voor Wiskunde. Vijfde Serie | 2012-06-07 | Paper |
Bounds and constructions for key distribution schemes
Advances in Mathematics of Communications | 2010-03-10 | Paper |
New constructions of anonymous membership broadcasting schemes
Advances in Mathematics of Communications | 2007-04-05 | Paper |
Jack van Lint (1932--2004): a survey of his scientific work
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
scientific article; zbMATH DE number 2154505 (Why is no real title available?)
| 2005-04-09 | Paper |
scientific article; zbMATH DE number 1980980 (Why is no real title available?)
| 2003-09-15 | Paper |
A practical protocol for advantage distillation and information reconciliation
Designs, Codes and Cryptography | 2003-09-07 | Paper |
On the security of digital signature schemes based on error-correcting codes
Designs, Codes and Cryptography | 2003-04-28 | Paper |
Fundamentals of cryptology. A professional reference and interactive tutorial. Incl. 1 CD-ROM
The Kluwer International Series in Engineering and Computer Science | 2002-04-10 | Paper |
scientific article; zbMATH DE number 1284435 (Why is no real title available?)
| 2002-01-31 | Paper |
scientific article; zbMATH DE number 1284427 (Why is no real title available?)
| 2001-09-04 | Paper |
Two ``dual families of nearly-linear codes over \(\mathbb Z_p, p\) odd
Applicable Algebra in Engineering, Communication and Computing | 2001-07-22 | Paper |
Some new binary, quasi-cyclic codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
On the complexity of minimum distance decoding of long linear codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
scientific article; zbMATH DE number 1189045 (Why is no real title available?)
| 1999-03-04 | Paper |
Cryptanalysis of `less short' RSA secret exponents
Applicable Algebra in Engineering, Communication and Computing | 1998-03-10 | Paper |
Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
Designs, Codes and Cryptography | 1997-12-18 | Paper |
scientific article; zbMATH DE number 922676 (Why is no real title available?)
| 1997-02-26 | Paper |
scientific article; zbMATH DE number 927290 (Why is no real title available?)
| 1997-02-25 | Paper |
scientific article; zbMATH DE number 820512 (Why is no real title available?)
| 1996-04-22 | Paper |
The Leech lattice, the octacode, and decoding algorithms
IEEE Transactions on Information Theory | 1996-04-15 | Paper |
scientific article; zbMATH DE number 844881 (Why is no real title available?)
| 1996-02-14 | Paper |
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
Approaching capacity by equiprobable signaling on the Gaussian channel
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
scientific article; zbMATH DE number 193512 (Why is no real title available?)
| 1993-06-05 | Paper |
On maximum likelihood soft-decision decoding of binary linear codes
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
Error-correcting codes with bounded running digital sum
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
Fire codes revisited
Discrete Mathematics | 1993-01-16 | Paper |
scientific article; zbMATH DE number 38974 (Why is no real title available?)
| 1992-06-28 | Paper |
Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
Constructions and bounds for systematic tEC/AUED codes
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
Multiple burst-correcting array codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4112536 (Why is no real title available?)
| 1989-01-01 | Paper |
On error-correcting balanced codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Two-dimensional burst identification codes and their use in burst correction
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
On the existence of optimum cyclic burst- correcting codes
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
A class of burst error-correcting array codes (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
An upper bound for codes for the noisy two-access binary adder channel (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
On the covering radius of binary, linear codes meeting the Griesmer bound
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
A family of good uniquely decodable code pairs for the two-access binary adder channel
IEEE Transactions on Information Theory | 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
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
Discrete Mathematics | 1981-01-01 | Paper |
A new class of codes meeting the Griesmer bound
IEEE Transactions on Information Theory | 1981-01-01 | Paper |
On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
Information and Control | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3700717 (Why is no real title available?)
| 1980-01-01 | Paper |
Symbol synchronization in convolutionally coded systems (Corresp.)
IEEE Transactions on Information Theory | 1979-01-01 | Paper |
On the inherent intractability of certain coding problems (Corresp.)
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
On quasi-cyclic codes with rate l m (Corresp.)
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
On the existence of a cyclic code with rate R
Discrete Mathematics | 1978-01-01 | Paper |
An upper bound for codes in a two-access binary erasure channel (Corresp.)
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
A lower bound for v in a \(t-(v,k,\lambda)\) design
Discrete Mathematics | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3537696 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3568717 (Why is no real title available?)
| 1976-01-01 | Paper |
