The following pages link to Henk van Tilborg (Q191912):
Displaying 50 items.
- (Q855857) (redirect page) (← links)
- Jack van Lint (1932--2004): a survey of his scientific work (Q855858) (← links)
- New constructions of anonymous membership broadcasting schemes (Q874415) (← links)
- (Q1151869) (redirect page) (← links)
- The smallest length of binary 7-dimensional linear codes with prescribed minimum distance (Q1151870) (← links)
- Fire codes revisited (Q1199640) (← links)
- A lower bound for v in a \(t-(v,k,\lambda)\) design (Q1224100) (← links)
- On the existence of a cyclic code with rate R (Q1245098) (← links)
- Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes (Q1358676) (← links)
- Cryptanalysis of `less short' RSA secret exponents (Q1360997) (← links)
- A practical protocol for advantage distillation and information reconciliation (Q1406878) (← links)
- On the security of digital signature schemes based on error-correcting codes (Q1869829) (← links)
- Bounds and constructions for key distribution schemes (Q2268257) (← links)
- Fundamentals of cryptology. A professional reference and interactive tutorial. Incl. 1 CD-ROM (Q2781764) (← links)
- Elliptic curve cryptosystems: too good to be true? (Q2889493) (← links)
- 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 (Q3037313) (← links)
- Constructions and bounds for systematic tEC/AUED codes (Q3199342) (← links)
- Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/ (Q3483231) (← links)
- A family of good uniquely decodable code pairs for the two-access binary adder channel (Q3695174) (← links)
- On the covering radius of binary, linear codes meeting the Griesmer bound (Q3705350) (← links)
- An upper bound for codes for the noisy two-access binary adder channel (Corresp.) (Q3726002) (← links)
- A class of burst error-correcting array codes (Corresp.) (Q3758715) (← links)
- On the existence of optimum cyclic burst- correcting codes (Q3762221) (← links)
- Two-dimensional burst identification codes and their use in burst correction (Q3799955) (← links)
- Multiple burst-correcting array codes (Q3816020) (← links)
- (Q3835418) (← links)
- (Q3838745) (← links)
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound (Q3866012) (← links)
- (Q3893811) (← links)
- A new class of codes meeting the Griesmer bound (Q3939716) (← links)
- (Q3992098) (← links)
- On maximum likelihood soft-decision decoding of binary linear codes (Q4034450) (← links)
- Error-correcting codes with bounded running digital sum (Q4034455) (← links)
- (Q4040312) (← links)
- (Q4113845) (← links)
- (Q4141269) (← links)
- An upper bound for codes in a two-access binary erasure channel (Corresp.) (Q4149660) (← links)
- On the inherent intractability of certain coding problems (Corresp.) (Q4156300) (← links)
- On quasi-cyclic codes with rate l m (Corresp.) (Q4158946) (← links)
- Symbol synchronization in convolutionally coded systems (Corresp.) (Q4178916) (← links)
- (Q4242021) (← links)
- (Q4242029) (← links)
- Approaching capacity by equiprobable signaling on the Gaussian channel (Q4307393) (← links)
- The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions (Q4324165) (← links)
- (Q4428379) (← links)
- A broadcast key distribution scheme based on block designs (Q4608491) (← links)
- Authentication codes: An area where coding and cryptology meet (Q4608509) (← links)
- (Q4665030) (← links)
- Some new binary, quasi-cyclic codes (Q4701176) (← links)
- On the complexity of minimum distance decoding of long linear codes (Q4701401) (← links)
