| Publication | Date of Publication | Type |
|---|
| On evaluating anonymity of onion routing | 2024-10-14 | Paper |
| Dynamic security aspects of onion routing | 2024-08-30 | Paper |
Secrecy gain of formally unimodular lattices from codes over the integers modulo 4
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Formally unimodular packings for the Gaussian wiretap channel
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Solving non-linear Boolean equation systems by variable elimination
Applicable Algebra in Engineering, Communication and Computing | 2021-06-11 | Paper |
| scientific article; zbMATH DE number 6900654 (Why is no real title available?) | 2018-07-09 | Paper |
Generalizations of the Griesmer bound
Lecture Notes in Computer Science | 2018-04-26 | Paper |
An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Coding for Inductively Coupled Channels
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
A coding-based approach to robust shortest-path routing
Coding Theory and Applications | 2016-01-07 | Paper |
| scientific article; zbMATH DE number 5831459 (Why is no real title available?) | 2011-01-03 | Paper |
Preface to the special issue on the occasion of the 65th birthday of Torleiv Kløve on October 17, 2008
Designs, Codes and Cryptography | 2009-03-31 | Paper |
Sphere-Packing Bounds for Convolutional Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| scientific article; zbMATH DE number 5454072 (Why is no real title available?) | 2008-12-21 | Paper |
Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Communication on Inductively Coupled Channels: Overview and Challenges
Coding Theory and Applications | 2008-11-25 | Paper |
Cryptography and Coding
Lecture Notes in Computer Science | 2007-11-28 | Paper |
On maximum length convolutional codes under a trellis complexity constraint
Journal of Complexity | 2004-08-06 | Paper |
On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels
Discrete Mathematics | 2002-01-08 | Paper |
There is no ternary [28, 6, 16 code]
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 1461526 (Why is no real title available?) | 2000-06-20 | Paper |
| scientific article; zbMATH DE number 1397978 (Why is no real title available?) | 2000-02-03 | Paper |
Difference set codes: codes with squared Euclidean distance of six for partial response channels
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
| scientific article; zbMATH DE number 1188987 (Why is no real title available?) | 1998-11-26 | Paper |
On the [162,8,80 codes]
IEEE Transactions on Information Theory | 1998-06-08 | Paper |
Cosets of convolutional codes with least possible maximum zero- and one-run lengths
IEEE Transactions on Information Theory | 1998-01-01 | Paper |
Two-step trellis decoding of partial unit memory convolutional codes
IEEE Transactions on Information Theory | 1997-08-26 | Paper |
On the trellis complexity of certain binary linear block codes
IEEE Transactions on Information Theory | 1995-12-17 | Paper |
Bounds on the minimum support weights
IEEE Transactions on Information Theory | 1995-07-12 | Paper |
Improved coding techniques for preceded partial-response channels
IEEE Transactions on Information Theory | 1995-06-11 | Paper |
A new class of nonbinary codes meeting the Griesmer bound
Discrete Applied Mathematics | 1994-02-22 | Paper |
| scientific article; zbMATH DE number 398940 (Why is no real title available?) | 1993-08-25 | Paper |
| scientific article; zbMATH DE number 398938 (Why is no real title available?) | 1993-08-25 | Paper |
Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
Discrete Mathematics | 1993-06-20 | Paper |
On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q\)-codes meeting the Griesmer bound]
Designs, Codes and Cryptography | 1993-01-16 | Paper |
Generalized Hamming weights of linear codes
IEEE Transactions on Information Theory | 1992-09-27 | Paper |
Runlength-limited codes for mixed-error channels
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Binary (18,11)2 codes do not exist-Nor do (64,53)2 codes
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
There is no binary (25,8,10) code
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
New bounds on binary linear codes of dimension eight (Corresp.)
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
