| Publication | Date of Publication | Type |
|---|
On the Capacity of Write-Unidirectional Memories With Nonperiodic Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Information Security
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Information Security and Privacy
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Information Security and Cryptology - ICISC 2003
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Progress in Cryptology - INDOCRYPT 2004
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Topics in Cryptology – CT-RSA 2005
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Information Security Practice and Experience
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Information Security and Privacy
Lecture Notes in Computer Science | 2005-09-07 | Paper |
On the undetected error probability for binary codes
IEEE Transactions on Information Theory | 2005-05-31 | Paper |
Constructions of permutation arrays
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On the constructions and nonlinearity of binary vector-output correlation-immune functions
Journal of Complexity | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1980944 (Why is no real title available?) | 2003-09-15 | Paper |
On the minimum average distance of binary codes: Linear programming approach
Discrete Applied Mathematics | 2003-08-26 | Paper |
On equidistant constant weight codes
Discrete Applied Mathematics | 2003-06-10 | Paper |
Self-complementary balanced codes and quasi-symmetric designs
Designs, Codes and Cryptography | 2003-04-03 | Paper |
On the Svanstrom bound for ternary constant-weight codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
On the constructions of highly nonlinear zigzag functions and unbiased functions
Information Processing Letters | 2002-07-14 | Paper |
| On equidistant constant weight codes | 2001-10-14 | Paper |
On the depth distribution of linear codes
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
Algebraic-geometry codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
IEEE Transactions on Information Theory | 1998-07-03 | Paper |
| scientific article; zbMATH DE number 1009723 (Why is no real title available?) | 1997-08-26 | Paper |
The redundancy of source coding with a fidelity criterion. 1. Known statistics
IEEE Transactions on Information Theory | 1997-05-22 | Paper |
| scientific article; zbMATH DE number 910910 (Why is no real title available?) | 1996-08-22 | Paper |
Bounds on the sizes of constant weight covering codes
Designs, Codes and Cryptography | 1995-07-20 | Paper |
On the generalized Hamming weights of product codes
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
Explicit construction of optimal constant-weight codes for identification via channels
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
Minimum distance of logarithmic and fractional partial m-sequences
IEEE Transactions on Information Theory | 1992-10-12 | Paper |
Generalized Hamming weights for linear codes
IEEE Transactions on Information Theory | 1992-06-26 | Paper |
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
Mathematics of Operations Research | 1990-01-01 | Paper |
Optical orthogonal codes: design, analysis and applications
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
A connection between a convex programming problem and the LYM property on perfect graphs
Journal of Graph Theory | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4095378 (Why is no real title available?) | 1987-01-01 | Paper |
Intersection graphs of paths in a tree
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3912430 (Why is no real title available?) | 1986-01-01 | Paper |
Monotone subsequences in (0,1)-matrices
Graphs and Combinatorics | 1986-01-01 | Paper |
Addendum to ``Odd and even Hamming spheres also have minimum boundary
Discrete Mathematics | 1986-01-01 | Paper |
Nonhomogeneous Trellis codes for the Quasi-Synchronous Multiple-Access Binary adder channel with Two Users
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
Coding for the binary symmetric broadcast channel with two receivers
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4116559 (Why is no real title available?) | 1985-01-01 | Paper |
Cross-monotone subsequences
Order | 1985-01-01 | Paper |
Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes
IEEE Transactions on Communications | 1985-01-01 | Paper |
Selecting non-consecutive balls arranged in many lines
Journal of Combinatorial Theory. Series A | 1984-01-01 | Paper |
Odd and even Hamming spheres also have minimum boundary
Discrete Mathematics | 1984-01-01 | Paper |
An error-trapping decoder for nonbinary cyclic codes (Corresp.)
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
A partition identity
Discrete Mathematics | 1983-01-01 | Paper |
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Optimal Sequencing of Items In a Consecutive-2-out-of-n System
IEEE Transactions on Reliability | 1983-01-01 | Paper |
Decomposing a Permutation into Two Large Cycles: An Enumeration
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
On the characterization of statistically synchronizable codes (Corresp.)
IEEE Transactions on Information Theory | 1980-01-01 | Paper |
